Okrut's blog

Good Bye 2020
By Okrut, 17 months ago, In English

Hello Codeforces!

We have a pleasure to invite you to Good Bye 2020, which will take place on Dec/30/2020 17:35 (Moscow time). You will have 3 hours to solve 9 problems. The round will be rated for participants of both divisions.

The problems for this round were prepared by gawry, Anadi and me.

We would like to thank everyone who made this round possible:

We hope you will enjoy the problem set! Good luck!

UPD: Score distribution: $$$500$$$ $$$-$$$ $$$750$$$ $$$-$$$ $$$1000$$$ $$$-$$$ $$$1000$$$ $$$-$$$ $$$1500$$$ $$$-$$$ $$$1750$$$ $$$-$$$ $$$2500$$$ $$$-$$$ $$$3500$$$ $$$-$$$ $$$4000$$$

UPD: Editorial

UPD: Congratulations to the winners!

  1. tourist
  2. maroonrk
  3. Benq
  4. scott_wu
  5. fivedemands
  6. Um_nik
  7. mnbvmar
  8. heno239
  9. aid
  10. ainta
Announcement of Good Bye 2020
 
 
 
 
  • Vote: I like it
  • +1604
  • Vote: I do not like it

»
17 months ago, # |
  Vote: I like it +206 Vote: I do not like it

New year magic when ?

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +628 Vote: I do not like it

    WHEN

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it +310 Vote: I do not like it

      .

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +18 Vote: I do not like it

        Don't be sad, It's now available in your profile, have fun :)

        → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it +43 Vote: I do not like it

      As a tester, I recommend participants to say Good Bye 2020 with full energy so that year like 2020 should never come back. :)

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +2 Vote: I do not like it

        Should this be considered a hint?

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +6 Vote: I do not like it

          B+

          → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +5 Vote: I do not like it

          I think so. It is a hint that the problems will be impossibly hard

          → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
            ← Rev. 2   Vote: I like it +5 Vote: I do not like it

            Just put all your efforts today into this contest and you'll really see a beautiful 2021. Because the problems are easy!

            → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +13 Vote: I do not like it

        In my personal experience goodbye(s) are insanely hard contests and this is goodbye f***ing 2020, which has been really a crappy year, so as a contestant i hope no less than an insanely impossible to solve contest :D.

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +2 Vote: I do not like it

          No, that is not true. I have said it generally and there is nothing to preassume about the difficulty of the contest. Problems are really good and interesting.

          → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
              Vote: I like it +16 Vote: I do not like it

            You're extremely cute, lol :D I was clearly making a joke, but thanks for the reply. This is my first contest in a while so i may suck anyways :D.

            → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Aren't you ready for Corona 2.0. The year 2021 may be worse. Although Programmers do not care about qurantine.

        → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it -6 Vote: I do not like it

        okay professor.

        → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      It's a mockery!!!

      → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    In January, after New year

    I wait magic too, i wanna change nickname

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it +9 Vote: I do not like it

      me too bro

      → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      So can I take yours then !

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I don't mind

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +3 Vote: I do not like it

          So cool bro . It would be great . Really excited !

          → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
        ← Rev. 2   Vote: I like it 0 Vote: I do not like it

        You can't. As far as I know names stay reserved for the same person who once took them. Try searching for Raptor.L in the handle search bar to see what I mean by that.

        → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +19 Vote: I do not like it

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    From today ;)

    → Reply
»
17 months ago, # |
  Vote: I like it +24 Vote: I do not like it

more than glad to say good bye 2020 with more than a trifle of passion

→ Reply
»
17 months ago, # |
  Vote: I like it -20 Vote: I do not like it

Will there be a interactive problem like last year?

→ Reply
»
17 months ago, # |
  Vote: I like it +52 Vote: I do not like it

I was literally waiting for this contest since 10 months :)

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +170 Vote: I do not like it

    Says someone registered 9mos ago xD

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it -185 Vote: I do not like it

    I'm already waiting for Good Bye 2021

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it +545 Vote: I do not like it

      Mike knows 2020 is THE END. He didnt even scheduled Hello 2021.

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it -10 Vote: I do not like it

        Or maybe he was waiting for you to comment this comment.

        → Reply
    • »
      »
      »
      17 months ago, # ^ |
      ← Rev. 2   Vote: I like it -145 Vote: I do not like it

      Who keeps downvoting me instantly? Is that a bot or something?

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +461 Vote: I do not like it

        May be a group of moralizers

        → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +113 Vote: I do not like it

        You have demoralized a lot of people. Maybe they are taking revenge. xD

        → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +20 Vote: I do not like it

        Very funny, maybe you should take the opportunity to change the handle

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it -77 Vote: I do not like it

          Yes, I'm thinking about that, so that their bot can't target the new handle

          → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            LMAO, maybe MikeMirzayanov should check if the bots exist and do something

            → Reply
            • »
              »
              »
              »
              »
              »
              »
              17 months ago, # ^ |
                Vote: I like it -52 Vote: I do not like it

              Bots do exist, I know how they work. It used to be just too easy to make a new CF account, (there were no captchas).

              I know that at least one of my enemies had around 30 accounts. It's easy to make a bot to downvote someone, because there are no captchas for login, so writing a bot is not a big deal for the people here, they're all coders.

              → Reply
              • »
                »
                »
                »
                »
                »
                »
                »
                17 months ago, # ^ |
                  Vote: I like it -70 Vote: I do not like it

                Even we can create a bot to submit and solve the problems fetching submission of others post the contest and also down-vote Monogon. I am thinking of making the same kind of a script against Monogon.

                → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it +81 Vote: I do not like it

                  You downvoted me, I did nothing.

                  You downvote Monogon, I'll take revenge!

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                  ← Rev. 2   Vote: I like it +21 Vote: I do not like it

                  This comment of yours didn't got downvoted , looks like your haters love monogon.

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it +69 Vote: I do not like it

                  No, actually my haters are indian, and a lot of them are asleep by now.

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  Ok , My mistake , When I commented you didn't had any downvoted but now you have 6 (P.S.: I upvoted your comment before commenting the first comment)

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it +9 Vote: I do not like it

                  I am still waking up :) Remembered me.

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  No, actually my haters are indian, Actually they want dance performance.

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  You are really cute and talented don't know what the hell kind of person can hate you. If anybody is a true coder they won't never hate a talented coder. Might be your haters are jealous of your achievement.

                  Anyways you keep up your inspirational journey. You are hell of a motivation.

                  → Reply
                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  17 months ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  You're the only person that ever called me cute since my teenage. Thankss a lot.

                  → Reply
            • »
              »
              »
              »
              »
              »
              »
              17 months ago, # ^ |
              ← Rev. 2   Vote: I like it 0 Vote: I do not like it

              skip

              → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it -8 Vote: I do not like it

        If someone is in mood of down voting then please downvote this too. adhocers

        → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    I was literally waiting for 2020 to come because I wished to watch 2020 cricket match at 20:20 pm with my 2020 biscuits but unfortunately it did not happen so now I am waiting for the earth to destroy and start its counting again from 0.

    → Reply
»
17 months ago, # |
  Vote: I like it +12 Vote: I do not like it

Can't be more excited for an year to end. Thanks codeforces and all its team for being a constant part of our daily life even in such a pandemic situation.

→ Reply
»
17 months ago, # |
  Vote: I like it +5 Vote: I do not like it

I can smell the taste of rating loss :v (kidding)

→ Reply
»
17 months ago, # |
  Vote: I like it +166 Vote: I do not like it

As a tester, I would like to honor memory of Chester

If you struggle with depression, don't be afraid of reaching for help!

Have yourself a wonderful CF round!

→ Reply
  • »
    »
    17 months ago, # ^ |
    ← Rev. 2   Vote: I like it +39 Vote: I do not like it

    Just curious how it is related

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it -93 Vote: I do not like it

      2020 and depression

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
        ← Rev. 2   Vote: I like it +164 Vote: I do not like it

        it seems you have a serious antifanclub XD

        → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +6 Vote: I do not like it

        why people are downvoating demoralizer??any reason??his streams helped me sometimes.please give respect to him.

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +22 Vote: I do not like it

          Some stupid haters downvote the post as soon as he writes and then as you know that the future of the comment depends on it's starts people go on downvoting it.

          → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
              Vote: I like it -123 Vote: I do not like it

            I just think that MikeMirzayanov is great.

            (Let's see if they have the balls to downvote this too)

            → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +169 Vote: I do not like it

          idk, it starts being slightly annoying seeing a comment by him on almost all blog posts (not judging tho)

          → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
              Vote: I like it -89 Vote: I do not like it

            I get downvoted on CF because I don't have a life outside it? Well ok nice makes sense

            → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +28 Vote: I do not like it

          His comments are demoralizing.

          → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    This is my December...

    → Reply
»
17 months ago, # |
  Vote: I like it -94 Vote: I do not like it

Rename it to FUCK OFF 2020

→ Reply
»
17 months ago, # |
  Vote: I like it +52 Vote: I do not like it

As a tester, I would say that this contest is the only good thing happening in 2020.

→ Reply
»
17 months ago, # |
  Vote: I like it -13 Vote: I do not like it

Happy NewBye 2020 !

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +42 Vote: I do not like it
meme
→ Reply
»
17 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Will there be in this New year a nickname changing and New year magic?

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    just one thing i want in my life right now, is "NEW YEAR MAGIC" :3 wanna change my handle badly!

    → Reply
»
17 months ago, # |
  Vote: I like it +34 Vote: I do not like it

Good bye 2020 and Happy 2020-II :))

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

can i reach expert before 20201? what do you guys think?

→ Reply
»
17 months ago, # |
  Vote: I like it +12 Vote: I do not like it

one day I will also reach candidate master. AMEN

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +21 Vote: I do not like it

    "Shoot for the moon — If you miss, you'll end up in the stars."

    → Reply
»
17 months ago, # |
  Vote: I like it -8 Vote: I do not like it

SecondThread as you are one of the best coders who have experience with problems, what is your opinion about the contest?

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +36 Vote: I do not like it

    Thanks! I don't like talking about problem sets before they are released (to anyone other than the authors of course), but I would definitely recommend participating if you can!

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I am looking forward for this with huge interest!

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +21 Vote: I do not like it

I love coding but I want to gather with my family at the end of the year :((

Good luck to you and have a nice New Year's Eve <3

→ Reply
»
17 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Will be there also Hello 2021 contest?

→ Reply
»
17 months ago, # |
  Vote: I like it +67 Vote: I do not like it

I WISH I WOULD HAVE GIRL FRIEND IN 2021

→ Reply
»
17 months ago, # |
  Vote: I like it +57 Vote: I do not like it

Some coders with the name ---"I LOVE _______" are extremly waiting for 2021...xD

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    I_love_myself has nothing to worry about

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    I am too bro.My name is Roman.

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    I am gonna set my name to tanya_romanova_loves_me xD

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      This account actually exists

      → Reply
  • »
    »
    17 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    how do I change my handle name, please refer me to some blog or steps (I am asking since I think maybe we can change it at the end of a year, if I am wrong then just excuse me for asking)

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I don't think you can do that.. You should have decided what you wanted as your handle beforehand. :)

      → Reply
»
17 months ago, # |
  Vote: I like it +39 Vote: I do not like it

Do KAN and Nebuchadnezzar coordinate together because they have the same name?

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope everything will be better in 2021

→ Reply
»
17 months ago, # |
  Vote: I like it +4 Vote: I do not like it

LazyPrime ORZ

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

I think that Goodbye 2020 is the only good thing in 2020

Hope everything will be better!

→ Reply
»
17 months ago, # |
  Vote: I like it +22 Vote: I do not like it

As a tester, I found the problems very interesting and enjoyed solving them. Good luck :)

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Or enjoyed not able to solve them? :P

    I must say these 3hrs rounds are usually more difficult :(

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hoping MikeMirzayanov to change his username as a new year gift :)

→ Reply
»
17 months ago, # |
  Vote: I like it +50 Vote: I do not like it

I hope that the design of Legendary grandmaster will be upgraded to New Year Magic. Look at the rating digits

→ Reply
»
17 months ago, # |
  Vote: I like it -11 Vote: I do not like it

Just curious, What is the strategy to be followed to increase rating in global rounds?

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

How come rating of some coders directly start from 1500?

→ Reply
»
17 months ago, # |
  Vote: I like it -11 Vote: I do not like it

Points Distribution?

→ Reply
»
17 months ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

I was waiting for this contest since I started competing on codeforces this year. Looking forward to correct the mistakes made in last 2 contests.

→ Reply
»
17 months ago, # |
  Vote: I like it +166 Vote: I do not like it

As a tester, Good Morning and Goodbye!

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I was waiting for this contest. Finally it's on tommowwrrow

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I wish This Good Bye 2020 will not become good bye expert for me.

→ Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

What about the Score-Distribution (or penalties for wrong submission) ?

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I hope, the new year will erase the filth of this pandemic situation. Thanks a lot for creating Good Bye 2020 contest.

→ Reply
»
17 months ago, # |
  Vote: I like it +15 Vote: I do not like it

Can't be more excited for an year to end. Thanks codeforces and all its team for being a constant part of our daily life even in such a pandemic situation.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Thank you for all your help and guidance on YouTube! : )

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    yea and thank you and all other youtubers and streamers to help understand the solution better :)

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Are you going to participate today ?

    → Reply
»
17 months ago, # |
← Rev. 4   Vote: I like it -16 Vote: I do not like it

Codeforces to 2020 :) :)

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

As a tester I think you will enjoy these statements : )

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    We just enjoy short statements, are they?

    → Reply
»
17 months ago, # |
  Vote: I like it +95 Vote: I do not like it

→ Reply
»
17 months ago, # |
  Vote: I like it +23 Vote: I do not like it

Request : Dark mode/theme for codeforces in 2021

it feels better on eyes, continuously switching between text editor (which has dark theme) and codeforces Websites causes eye strain.

Just a small request to devlopers.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    or just modify your text editor until they add it?

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Tiresome way: change the CSS properties ,every time or add script(i don't know if this will work), till they add it?

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    refer to this blog

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is it rated?

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is this contest suitable for someone in Div. 3. I am in grade 9 and have a decent understanding of CP up until this point.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can try the first three problems.

    → Reply
»
17 months ago, # |
  Vote: I like it +69 Vote: I do not like it

3 hours, 9 tasks. it looks like good training for ICPC.

Can you allow team registration?

→ Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

31 December: Am i joke to You! (*_*)

→ Reply
»
17 months ago, # |
  Vote: I like it +5 Vote: I do not like it

My First Good Bye Contest in Codeforces!

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    My first reply to gokulvaradan in codeforces!

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This is most anticipated Good Bye Contest!!! 2020 good bye :)

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

ded

:"

sed :"}

→ Reply
»
17 months ago, # |
  Vote: I like it +8 Vote: I do not like it

The first contest I gave was Hello 2020. How soon a year passed

The main reason for my progress this year has been Codeforces

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +13 Vote: I do not like it

.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Anish Giri eliminated already so there is no point in watching anymore :/

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I was cheering for dubov... The last game was orz

      → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Dubov rocks , personally i don't prefer Giri . So that's not problem for me.

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        The way he eliminated Carlen was orzzzzzz so yeaaa... Dubov is <3

        My two fav things from Russia 1. Codeforces 2. Daniil Dubov

        → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Good Bye 2020!May the soul of all the deceased of this year find peace and 2021 be a great year for all of us!

→ Reply
»
17 months ago, # |
  Vote: I like it -8 Vote: I do not like it

I just miss monogon's comments :(

→ Reply
»
17 months ago, # |
  Vote: I like it +2 Vote: I do not like it

rated for both divisions? I think we have div1, div2, div3. which two are rated?

→ Reply
»
17 months ago, # |
  Vote: I like it +3 Vote: I do not like it

pog

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

hoping to be pupil before 2021 :)

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

May god bless us in 2021!

→ Reply
»
17 months ago, # |
  Vote: I like it +6 Vote: I do not like it

I hope this last contest won't land me back into specialist. Fingers crossed :)

→ Reply
»
17 months ago, # |
  Vote: I like it -30 Vote: I do not like it

maa ki chut 2020 ki , me to nhi karega participate xd

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Seems like this would become the contest with highest number of participants. 17k+ have already registered!

→ Reply
»
17 months ago, # |
  Vote: I like it +17 Vote: I do not like it

My rating is 2021, wondering if I should give this contest to spoil it...

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it -13 Vote: I do not like it

    Any advice to reach 1800+. I have practiced over 350 questions but still Iam newbie. Not even specialist or pupil.

    → Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it 
Your code here...
print("Hello 2021")

I think that all code editor should change their welcome style--> "Hello world"-->"Hello 2021"

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Dear Codeforces I am a newbie coder please make a contest on [contest:Hello 2021]

→ Reply
»
17 months ago, # |
  Vote: I like it +6 Vote: I do not like it

Today's contest will help me to reach pupil. AMEN

→ Reply
»
17 months ago, # |
  Vote: I like it +31 Vote: I do not like it

GoodBye rating!

→ Reply
»
17 months ago, # |
  Vote: I like it -8 Vote: I do not like it

May Almighty make all things right in 2021....

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This is the last contest of year I hope this at least goes well for me

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +44 Vote: I do not like it

I really don't want to bring my orange name to 2021 . This is my last chance to reach red in 2020!

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    All the best

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Same :( i want to become red

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Sadly,I miss the chance.

    I just forget to add a line of "reverse(ALL(s0))" in problem G and keep getting "wa on 4".This contest teaches me not to ignore every small detail .

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Goodbye Rating` ~~~~~ cout<<"good bye rating" ~~~~~`

→ Reply
»
17 months ago, # |
← Rev. 3   Vote: I like it -9 Vote: I do not like it

I Love Second :(

→ Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Nice, I have been waiting for a long time. Thanks Codeforces !!!!

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

HAPPY NEW YEAR GUYS HOPE U ALL GOOD RATINGS :D

BYE 2020 : )

→ Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Why not be "Hello 2021"???

→ Reply
»
17 months ago, # |
  Vote: I like it +63 Vote: I do not like it

2020 was the worst phase my life. Full of depression and suicidal thoughts. Literally I was striving to overcome. Luckily I survived and now I will be participating here in Good Bye 2020 :)

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    Hope this contest will make you a good memorize. All the best!

    → Reply
»
17 months ago, # |
  Vote: I like it +25 Vote: I do not like it

When is the contest "Good bye COVID-19"?

→ Reply
»
17 months ago, # |
  Vote: I like it +11 Vote: I do not like it

This makes me soooo happy. Finally 2020 is going :')

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I've never had a positive delta in any Div1 Div2 combined round, let's see if I'm able to get out of this curse today :P

→ Reply
»
17 months ago, # |
  Vote: I like it +4 Vote: I do not like it

Goodbye, 2020! Hope this will be a good round with strong pretest, short and clear statement problem.

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Good Bye 2020 on 30th Dec: MikeMirzayanov be like I can't wait till 31st to say good bye to 2020.

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Good Bye 2020 :)

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I have a feeling I'll have a positive delta in this round :-P

→ Reply
»
17 months ago, # |
  Vote: I like it +15 Vote: I do not like it

Rating Bye-Bye 2020?

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This is my last comment in 2020

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Those who start 2021 year with a rating of 2021 will be lucky :P

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

4 problems with scoring less than 1000, 6 less than 1750! Is it gonna be SpeedForces :\

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hoping this Good Bye 2020 doesn't turn out to be Good Bye ratings. Fingers crossed.

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +2 Vote: I do not like it

One Decade on codeforces will be completed by today's conntest for tourist

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

i wish i can change my rating instead of codeforces handle :_

→ Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

does this distribution mean problems would be easier?

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +310 Vote: I do not like it

I know the authors and I have an idea. Let's not destroy their New Year's Eve and let's assume that the statements are correct, and not ask 500 questions this round, ok? This is a combined round, we can assume that if something is wrong, then, let's say, somebody orange+ will ask a question about this. OK? If you think that something is wrong with the statement — assume that you misunderstood it.

What do you think about this idea guys? Let's treat this as a gift for them.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Yes

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    There are already more than 1200 orange+ registered participants so I suggest that oranges like me should leave that responsibility for reds.

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it +23 Vote: I do not like it

      24000 vs 1200 is a huge difference :P

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        There are guys wid 1200 rating and who never reached more than 1400 are orange and black...

        → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Will there be an interactive problem?

→ Reply
»
17 months ago, # |
  Vote: I like it -10 Vote: I do not like it 
cout<<"Happy Good Contest"<<endl;
cout<<"New year luck"<<endl;

:)

→ Reply
»
17 months ago, # |
  Vote: I like it +13 Vote: I do not like it

this year thaught me many things, gave me many experience, but the best thing i ever experienced was that happiness when my first solution was accepted on codeforces contest. hello every coders out here, i love you all.

→ Reply
»
17 months ago, # |
  Vote: I like it -29 Vote: I do not like it

contest starts in 60....59.....58....57.....56.....55......54.......53......52......51......can't count more

→ Reply
»
17 months ago, # |
  Vote: I like it +41 Vote: I do not like it

Really enjoyed the statements! Thank you!

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Something irrelevant, if I submit the correct solution twice do I get -50 as penalty for that?

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    yes.. count the last correct submission. others as penalty.

    → Reply
»
17 months ago, # |
  Vote: I like it -25 Vote: I do not like it

I thought the last contest of this year will bring a good rating changes for newbies like me. But alas!!.I couldn't even figure out problem A statements....After all it is year 2020(a cursed year).

→ Reply
»
17 months ago, # |
  Vote: I like it +72 Vote: I do not like it

Should've had one more problem between F and G :(

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it -15 Vote: I do not like it

Bye 2020 !!... Let's find out how will your 2021 be

click one of the options below...if u get Rick Roll ..Believe me your 2021 will be amazing

1.A

2.B

1.C

2.D

→ Reply
  • »
    »
    17 months ago, # ^ |
    ← Rev. 2   Vote: I like it +21 Vote: I do not like it

    Jokes on you, the browser usually shows the url in the bottom left corner when you hover your mouse over a link.

    → Reply
»
17 months ago, # |
  Vote: I like it -13 Vote: I do not like it

Solve A,B and C fast and then see your rank fall.

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve E ??
I wish my knowledge like apollo or pan !

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it -10 Vote: I do not like it

    Yup, I was stuck on E too :\

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    Basically, you fix j and then you realise that the answer for all sums with that j is (sum of i&j) * (sum of j|k). Then you just use bitwise decomposition of the numbers to find those values quickly.

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      How exactly do you find the values quickly, if you could elaborate on that? I've realized the first observation and couldn't figure out the other part.

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        You decompose each number into its bit representation.

        Then if bit x is on in j, you add 2^x * (number of bit x on across all numbers) to the sum of i&j and n * 2^x to the sum of j|k.

        If bit x is off, you just add 2^x * (number of bit x on across all numbers) to the sum of j|k.

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          I pretty much did this but got TLE. Can someone tell me why? https://codeforces.com/contest/1466/submission/102858405

          → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
            ← Rev. 2   Vote: I like it +3 Vote: I do not like it

            Your logic is correct but actually the time limit is strict. Check the constants that are responsible for TLE. And calling functions within functions causes too much overhead.

            I think the function calc is the reason for TLE. It is an extra loop each time which can be computed in testcases function itself without any extra loop.

            → Reply
          • »
            »
            »
            »
            »
            »
            17 months ago, # ^ |
              Vote: I like it +3 Vote: I do not like it

            slow IO. Try using ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); on the begining

            → Reply
    • »
      »
      »
      17 months ago, # ^ |
      ← Rev. 2   Vote: I like it -8 Vote: I do not like it

      can you see my code and tell me where I made mistake?)

      → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      After skimming the editorial, it is clear to me how algebraically we can discover this fact (of separating the components as you did). When you solved in in contest, did you also do algebraic manipulations or is there an intuitive reason for why this is true?

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +5 Vote: I do not like it

        I looked at the double sum after fixing j and realised it could be separated out into the product of two sums. It's somewhat intuitive if you have played around with a lot of summations, I guess, but I still did the algebraic proof for it.

        → Reply
  • »
    »
    17 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    You should split to bits all the numbers and count bits in each position out of 60, let it be kb[i]. Fix each x[j] then you can count the sum of all (x[i]&x[j])*(x[j]|x[k]). In order to compute (x[i]&x[j]), choose all positions p where bit of x[p] in this position is 1, then (x[i]&x[j]) = sum of 2^p * kb[p] for all p. In order to compute (x[i]|x[j]), choose all positions p where bit of x[p] in this position is 1 and all over positions p1, then (x[i]&x[j]) = sum of 2^p * n + sum of 2^p1 * kb[p1]

    → Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

I'm like 50-50 on whether G is super brain observation or string algorithm, and either one is :(

Good contest though. A bit on the easy side for the first six questions, but nice problems.

→ Reply
»
17 months ago, # |
  Vote: I like it -13 Vote: I do not like it

test 7 on F

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

A good contest for me at the end of the year, solved 5, wish they pass the system testing :) Finally became specialist at the end of the year :)

→ Reply
»
17 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

any ideas/hint for D? i did dfs but can't recognized my bugs :/

EDIT: got AC right now, thanks guys for your insights chenreddy Liviu2000 rum3r Guslix

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    DFS not needed. Try to solve the problem by observing the optimal edge distribution for small inputs. Try to make use of indegrees.

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      can you try D on this testcase?? 1 7 10 6 5 4 8 2 1 1 2 1 3 1 4 2 5 3 6 4 7 Ans-> 36 46 56 62 67 71 but i think instead of 46 it would be 42 it said sum of maximum of each colored compoment? can you correct me where i am getting wrong?

      → Reply
  • »
    »
    17 months ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    try to build an array of pairs {degree,weight} and then sort it.

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    spoiler
    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It's can make new subgraph of new color such way that the new subgraph is connected. New subgraph obtains from one of current subgraphes by splitting to 2 parts. Each time when k increasing by 1, the value of coloring is increasing by the value of such vertice where was splitted the old subgraph. So for each k choose maximum vertice of possible. Just count for each vertice the number of edges that adjacent this vertice

    → Reply
»
17 months ago, # |
  Vote: I like it +13 Vote: I do not like it

Cool NY contest, thanks!

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This round was sexy AF. I really enjoyed the problems (like a lot!). This has been my best performance so far and I'm very happy that I was able to do so in the last contest of the year. It's been a rough year for many, a great time to grind CP for others and a somewhat meh year for me. Whatever it has been, happy new year to everyone! Hope everyone has a great year ahead!

I don't understand how F could possible have 1000+ solves as it seems way too orz than normal. If someone could tell me how to solve, I would be very happy about it. The problems this round were great (to say the least) and the difficulty ordering and level felt perfectly balanced. Thank you authors!

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    If you think about how xor of individual dimensions cancel out on F, we can reduce it to a minimum spanning tree problem. Edges will be connecting the two dimensions that are on in a matrix (or a dimension to 0 if the matrix only has one on dimension), and weights on the edges is simply the edge number. This produces lexicographical order.

    It can be shown that all 2^|S'| possible sums produced are unique.

    → Reply
»
17 months ago, # |
  Vote: I like it +16 Vote: I do not like it

Was score decay adjusted for 3 hour duration?

→ Reply
»
17 months ago, # |
  Vote: I like it -50 Vote: I do not like it

Another shit of 2020 ended today lowering n to 10000 in C allows dp[N]*[26]*[26] solutions but memory limit exceeded due to tight constraints.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Maybe just changing 2/3 character long palindromes was enough.

    → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Change that 26 to 2.

    → Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I wish you a happy new year Hoping for your increasing success and a world without corona virus in 2021!

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

If only I could have done D a bit faster :( with more accuracy :((

→ Reply
»
17 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why this code gives TL? https://codeforces.com/contest/1466/submission/102850721

→ Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

How to Solve Problem C ?

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can always make a palindrome cease to exist if you change its middle character (if even length) or change 2 middle characters (odd length > 3). So we just need to find length 2 and 3 palindromes and change them so that they donot remain palindromic.

    → Reply
  • »
    »
    17 months ago, # ^ |
    ← Rev. 2   Vote: I like it +3 Vote: I do not like it

    Iterate from 1 to n and if s(i,i+1) is a palindrome then replace s[i+1]. Else if s(i-1,i ,i+1) is a palindrome replace s[i+1].

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Why is it always optimal to replace $$$i+1$$$ ?

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        Changing i+1 will rule out the possibility of i+1,i+2 and i+1,i+2,i+3 being a palindrome as well.

        → Reply
»
17 months ago, # |
  Vote: I like it +1 Vote: I do not like it

How to solve C, anyone?

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can always make a palindrome cease to exist if you change its middle character (if even length) or change 2 middle characters (odd length > 3). So we just need to find length 2 and 3 palindromes and change them so that they donot remain palindromic.

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I came up with that idea, but couldn't proceed more than that. tried a way to remove greedily but was failing i.e. getting WA. Can you elaborate how to remove 2/3 len palindromes?

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
        ← Rev. 2   Vote: I like it 0 Vote: I do not like it

        Check if the first two characters are same, then change the second one. Now run a loop form the 3rd character to last and check if it is equal to any of the previous two characters. If it is, change it. When I say change, consider to changing it to some arbitrary character which is not a lower case alphabet. This is because, since you have 25 choices to change the character, and a character from the string can only contribute to maximum 4 different palindromes, that is, i-2, i-1, i+1, i+2. There is always an optimal choice that doesn't affect other palindromes.

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          my second submission had exactly same idea, but smh it got WA and i thought that this idea is incorrect.

          → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +1 Vote: I do not like it

        Yeah sure,

        For len 2 palindromes, say at indices : (i,i+1) you have to set the second character(i+1) such that it does not equal to i,i+2 and i+3.

        For len 3 palindromes, say at indices : (i,i+1,i+2) you have to set the third character(i+2) such that it does not match (i,i+1,i+3 and i+4).

        Also there is a condition for len-3 here : (s[i]!=s[i-1]) which is explained below :

        So we would first correct all 3 len palindromes and then proceed to filter all 2 len.

        Explanation of condition:

        Say there is some string of form "bbab". Here there is a 3 len "bab" substring. So according to our logic we would make the last b equal to some other valid character, say now it became : "bbax". Now we proceed to 2 len filter and find "bb". And now say we get "byax". So changes are 2, but answer is 1 as you can always change the second b. i.e "bxab" works here.

        Lastly we count the new changes by storing the indices in a set.

        C
        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          thanks for the detailed explanation. got it. i did smthg similiar, will try to figure out what went wrong.

          → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Perfect explanation, thanks!! orz

          → Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    approach each adjaent 3 characters must be different. think of greedy/dp now

    → Reply
»
17 months ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

why did this submission get time limit :(

→ Reply
»
17 months ago, # |
  Vote: I like it +6 Vote: I do not like it

Because of question E, I learnt how to write and submit C++ code today. I have always been writing in Python.

It is a good start for 2021.

→ Reply
  • »
    »
    17 months ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    Because of question E, I learnt to be careful with mods

    → Reply
    • »
      »
      »
      17 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      me too

      → Reply
      • »
        »
        »
        »
        17 months ago, # ^ |
          Vote: I like it +2 Vote: I do not like it

        I wish I found the bug quickly.

        → Reply
        • »
          »
          »
          »
          »
          17 months ago, # ^ |
            Vote: I like it +3 Vote: I do not like it

          Can't believe I didn't find the overflow in n*xs[i]%MOD until after the contest. I spent more than 20 minutes double-checking everything except this.

          → Reply