MagentaCobra's blog

By MagentaCobra, 5 weeks ago, In English,

Hey everybody!

We (MagentaCobra, Tlatoani, golions, qlf9) are super excited to invite you to take part in Codeforces Round #655 (Div. 2), which will happen on Jul/11/2020 18:05 (Moscow time). Please note the unusual start time. The round is rated for users with rating strictly less than 2100, although higher rated users are more than welcome to take part out of competition.

Huge thanks to those who helped make this round possible:

There will be 6 problems and 2 hours to solve them.

We really hope you enjoy our first contest!

UPD: Scoring Distribution:

500—1000—1500—2000—2500—3000

UPD: Due to long queue, the round will be unrated. We're extremely sorry this happened, and all of us are sad about it. We hope you will at least enjoy the problems.

UPD: Editorial

 
 
 
 
  • Vote: I like it
  • +1346
  • Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

Auto comment: topic has been updated by MagentaCobra (previous revision, new revision, compare).

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -27 Vote: I do not like it

    No score distributions until now?

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +24 Vote: I do not like it

      Once score distribution was published 2/3 hours before.but its 32 hours more left why are you hurrying!

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +19 Vote: I do not like it

      What do you even use score distributions for? Is there some op preparing/strategy based on score distribution I am unaware of?

      • »
        »
        »
        »
        4 weeks ago, # ^ |
          Vote: I like it +55 Vote: I do not like it

        Well usually people go from the easiest to the hardest. But for example if both E and F have the same score, you might want to read both of them first and then decide which one to solve.

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

          What order to read problems can be decided right before the round starts. You don't need to know 32 hours in advance

          • »
            »
            »
            »
            »
            »
            4 weeks ago, # ^ |
              Vote: I like it +53 Vote: I do not like it

            That's true I suppose. I was just answering the question of why you even need to know the scores.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Feel sorry for people who got their best rank in this contest (like me). Sob :(

»
4 weeks ago, # |
  Vote: I like it +194 Vote: I do not like it

Hope you all enjoy the problems :)

»
4 weeks ago, # |
  Vote: I like it +97 Vote: I do not like it

xD how much problems did he rejected :)

»
4 weeks ago, # |
  Vote: I like it +96 Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Hoping to see good and interesting problems rather than only maths

»
4 weeks ago, # |
  Vote: I like it +169 Vote: I do not like it
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +54 Vote: I do not like it

    I think you shouldn't put memes in a language other than English or Russian, many of us don't understand it.

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +71 Vote: I do not like it

      You mean: "I think you shouldn't put memes"?

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +81 Vote: I do not like it

      Or maybe only in English,many of us don't understand Russian too.

      • »
        »
        »
        »
        4 weeks ago, # ^ |
          Vote: I like it -63 Vote: I do not like it

        No offense, but do you think it is decent to say that in a website maintained by a Russian university? Why "should" Russian users spend time translating their memes to let you understand?

        • »
          »
          »
          »
          »
          4 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          This is not about wasting time, I mean memes are for fun... if someone is spending his time in making it then it's better if everyone understand it.

          P.s: I don't think Russian gets a special power if this website is maintained by Russian university.

          • »
            »
            »
            »
            »
            »
            4 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            How would you feel if you are maintaining an online community where someone else say that people shouldn't use your mother tongue? Maybe we should also remove the "In Russian" button when posting, to let everyone understand the comments, tutorials, etc.? Sometimes people just use ready-made memes. It takes much time to edit the picture if you want to translate. If you don't like it, maybe you can choose to ingore and sorry for wasting that 5 seconds trying to understand that. There are still more than a hundred likes for that meme.

            • »
              »
              »
              »
              »
              »
              »
              3 weeks ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              hey u it has more indian and american users than russians lol.So it should be in whatever language he wants

              • »
                »
                »
                »
                »
                »
                »
                »
                3 weeks ago, # ^ |
                  Vote: I like it 0 Vote: I do not like it

                That's true. But as you said "whatever language he wants", Russian memes should be ok as well? I didn't say we shouldn't use indian :)

                • »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  »
                  3 weeks ago, # ^ |
                    Vote: I like it 0 Vote: I do not like it

                  so you use russian,who stopped u lolz

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +19 Vote: I do not like it

      It is saying " Rating double in 25 days "

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Also, tell this to AtCoder YouTube channel!! It would be nice if they make content/tutorials for English viewers also.

»
4 weeks ago, # |
  Vote: I like it +22 Vote: I do not like it

You forgot to mention that score distribution will be updated later

»
4 weeks ago, # |
Rev. 2   Vote: I like it +121 Vote: I do not like it

I hope C and D will not be too easy. Bring back the glory of div2C.

»
4 weeks ago, # |
  Vote: I like it -22 Vote: I do not like it

Hoping to see myself in Cyan after this round.

»
4 weeks ago, # |
Rev. 2   Vote: I like it -80 Vote: I do not like it

I have to miss a Div.4 round for this :(

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Your 1st round!! hope we enjoyed

»
4 weeks ago, # |
Rev. 2   Vote: I like it -30 Vote: I do not like it

[Deleted]

»
4 weeks ago, # |
  Vote: I like it -29 Vote: I do not like it

Me: Finally a question I think I can solve!
(Looks at the only test cases provided)
Input: 0
Output: 0
Input: 1
output: 1
Me: Welp.

»
4 weeks ago, # |
  Vote: I like it -76 Vote: I do not like it

Hope to become LGM this contest!

»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

Why there is no "as a tester" comments until now ??

»
4 weeks ago, # |
  Vote: I like it +29 Vote: I do not like it

Waiting for this contest, Contest in a gap of seven days (Global Round 9 was on the 4th of July). Excited Can't-Wait!

»
4 weeks ago, # |
Rev. 2   Vote: I like it -31 Vote: I do not like it

The editorial better be out instantly. All you guys have to do is press the "Publish" button.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Wow! This seems like a really good contest!!!!! Out of curiosity, is there any advice you would give a new and inexperienced :P coder? In particular, I am very interested in what qlf9 has to say.

»
4 weeks ago, # |
  Vote: I like it +28 Vote: I do not like it

Interesting to see four author from four different country. Finally a round which will not called some countryan round.

I am little bit curious to know how you four people from four different country get together to prepare the round?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    I think they studied in the same school, although I'm not sure

»
4 weeks ago, # |
  Vote: I like it -52 Vote: I do not like it

one day CODEFORCES will renamed to MONGONFORCES

»
4 weeks ago, # |
  Vote: I like it +29 Vote: I do not like it

Where are the tester comments, how will I know if the problems are interesting :P

»
4 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

i hope that the statement of Problems be to short like Announcement :XD

»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Long time no see :v

»
4 weeks ago, # |
  Vote: I like it -26 Vote: I do not like it

I hope we all will get maximum increase in rating in the first contest of MagentaCobra

»
4 weeks ago, # |
  Vote: I like it -7 Vote: I do not like it

new round after so many days, really excited about it. let's get those lost ratings from last round.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You are talking about lost rating...BUT you get +83 in your last round.

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it -17 Vote: I do not like it

      I was talking about many people lost rating in global round 9 , so a good chance to perform better and boost confidence

»
4 weeks ago, # |
  Vote: I like it +23 Vote: I do not like it

Hope to have negative rating after this contest.

»
4 weeks ago, # |
  Vote: I like it +138 Vote: I do not like it

so many unnecessary blog in recent action !!

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -35 Vote: I do not like it

    Does asking doubt come under unnecessary blog?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    Hard work & up your rank

    Create a meme to increase your contribution

»
4 weeks ago, # |
  Vote: I like it +12 Vote: I do not like it

Our college decided to dump on us every deadline of submission between 8th-10 July and I still can't believe how well it fit in the long gap between after back-to-back rounds!

»
4 weeks ago, # |
  Vote: I like it -25 Vote: I do not like it

Please upload the scoring/weightage distribution of the problems

»
4 weeks ago, # |
Rev. 5   Vote: I like it +19 Vote: I do not like it

Me watching more and more contests coming after each other!

»
4 weeks ago, # |
Rev. 2   Vote: I like it +72 Vote: I do not like it

[Your text to link here...](

)
»
4 weeks ago, # |
Rev. 4   Vote: I like it -20 Vote: I do not like it

Every time I read comments .There are lots of memes and some of these are motivating to take part in round .

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

my first contest need some suggestions??

»
4 weeks ago, # |
  Vote: I like it +169 Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it -35 Vote: I do not like it

Why Div 3 contest is not coming?

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I hope to become expert in this round :)

»
4 weeks ago, # |
  Vote: I like it +53 Vote: I do not like it

Go Colonials!

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope there will be interesting problems. Good luck and High rating.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

ummm what is meant by cyan etc etc. i am new here and don't know much about the slangs used here !!

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

is your score the same as your rating? i'm new to this website so idk how it works :/

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -6 Vote: I do not like it

    High rated person — good int CP low rated person — not so good in CP. I think this about sum's it up ; )

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    No,you will be given a rank based on your total score and your rating will increase if you performed better in comparison to the rating you already have.It is not like if you have earned total 2000 points then your rating will become 2000 !!

»
4 weeks ago, # |
Rev. 2   Vote: I like it -49 Vote: I do not like it

![ ](meme.jpg)

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    When you want something, all the universe conspires in helping you to achieve it.

    - Paulo Coelho
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Thanks for your support guys! I am overwhelmed.

»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

A few days ago, my contribution was +1, now it's 0, how to keep or rise my contribution?

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Unusual start time nowadays have become the new usual start time.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

wow! the one who is no.2 contributor is coordinating this round!!! I think we will get problems that we will enjoy to the fullest

»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Hi I am a beginner.I want to ask that at least how many questions one should solve in a Div2 contest to avoid rating decrement.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    In your rating range two problems.. I guess even if you solve just 1 but fast.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Looking at your current rating two questions should definitely do the job and sometimes, if the second question is little bit tough then solve the first question quickly to avoid rating decrement.

»
4 weeks ago, # |
Rev. 2   Vote: I like it +1 Vote: I do not like it

24k+ participants already!

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Who the hell is Patrick?

»
4 weeks ago, # |
  Vote: I like it +12 Vote: I do not like it

Isn't the queue very long?

»
4 weeks ago, # |
  Vote: I like it -56 Vote: I do not like it

why does printing odd numbers in first problem throw a wrong answer??

»
4 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

over 75 pages of submissions in queue...

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

that's all(

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

i am sorry...i wasn't aware of it...

»
4 weeks ago, # |
  Vote: I like it -7 Vote: I do not like it

Sorry to say this. I'm really disappointed with the contest :(

»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

waiting for hundreds of "queue forces" commentaries :)

»
4 weeks ago, # |
  Vote: I like it +45 Vote: I do not like it

Waiting and Waiting..Really Annoying !!!

»
4 weeks ago, # |
  Vote: I like it +17 Vote: I do not like it

Can we have this contest unrated, please?

»
4 weeks ago, # |
  Vote: I like it +29 Vote: I do not like it

Yet Another Queue Problem

»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

(i am crying): what is going on codeforces?((

»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

i submit problem number B 10minutes ago..it's still in queue

»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

I think this round will unrated!!!

»
4 weeks ago, # |
  Vote: I like it +14 Vote: I do not like it

After a week of waiting...

»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

More Than 125 page of queue

»
4 weeks ago, # |
Rev. 2   Vote: I like it -17 Vote: I do not like it

coool!

»
4 weeks ago, # |
Rev. 2   Vote: I like it +10 Vote: I do not like it

my code had been in queue for 15 minutes, I think this round will be unrated

»
4 weeks ago, # |
  Vote: I like it +24 Vote: I do not like it

10 minute queue is definitely not reasonable and round should be unrated..

»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

168 pages of queue :(

»
4 weeks ago, # |
  Vote: I like it +13 Vote: I do not like it

already 15 mins now still in queue

»
4 weeks ago, # |
Rev. 2   Vote: I like it +31 Vote: I do not like it

I don't want to look like I am overreacting, but I think that most of the beauty of CF rounds comes from the instant feedback and, as you can notice, this rounds has a big lack of such feature. Therefore, in my opinion, this round should become unrated.

»
4 weeks ago, # |
Rev. 2   Vote: I like it +23 Vote: I do not like it

Shoot,I had been waiting for about 10 minutes to get WA on test 1

»
4 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Is it gonna be unrated ?

»
4 weeks ago, # |
  Vote: I like it +13 Vote: I do not like it

I was waiting for this contest since 1 week but such queuing issue is really annoying

»
4 weeks ago, # |
  Vote: I like it +14 Vote: I do not like it

Okay, I give up! It would be ridiculous if this round is rated!

»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

QUEUEFORCES

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

Welcome to Queueforces

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

QueueForces

»
4 weeks ago, # |
Rev. 2   Vote: I like it -7 Vote: I do not like it

Hey, MikeMirzayanov , please do something. Taking too much time to submit a solution to a problem

Edit: The round is unrated but still I will participate as the questions are very interesting :)

»
4 weeks ago, # |
  Vote: I like it +125 Vote: I do not like it

»
4 weeks ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

The questions are really interesting but the long Queue ruined the contest.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

f this

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

submit a solution and then refresh and refresh for 15 minutes+ to see that solution passed or not or even Wa on test 1..What the hell -_-

»
4 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

The contest should be unrated.

»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

As per the announcement, contest should go unrated if the queue goes for more than 15 minutes, right? I could see that it is 20 minutes long right now. So, is it going to be unrated?

»
4 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

20 minutes and still in the queue..

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Right now the queue is 16 minutes+. Disappointing.

»
4 weeks ago, # |
  Vote: I like it +184 Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Queue is 15 minutes long now... Will it be still rated?

»
4 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Will it be unrated?

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

_**MAKE THE CONTEST UNRATED -_- **_

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Queueforces again :(

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Queue reached 15min. Is it rated? NO! It's unrated!

»
4 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

YEEEEAAAAH ... round unrated !!

»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

It is sad that round is unrated. btw Problems were interesting.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    How to solve B ..

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      one of a or b has to be a factor of n in optimal answer

    • »
      »
      »
      4 weeks ago, # ^ |
      Rev. 3   Vote: I like it 0 Vote: I do not like it

      Let the smallest prime factor of n be r.

      Answer will be n/r and (r-1)*n/r

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      If n is even then a and b is n/2 and if it is prime then 1 and n-1 else the largest factor which divides n other than n itself so let it be x then x and n-x.

      • »
        »
        »
        »
        4 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        if n is an odd and a multiple of 3, we can directly have largest factor x=(n/3)

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Im supposed to be pupil in this round. Sad

»
4 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

Queues Again Came Up , I again fear Monogons Next Round!

»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

Sorry, because of the long queue the round is unrated.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Its unrated now :)

»
4 weeks ago, # |
Rev. 2   Vote: I like it +1 Vote: I do not like it

Was literally doing good in this one, btw nice questions

»
4 weeks ago, # |
  Vote: I like it +55 Vote: I do not like it

Testcases were weak for C and moreover announcement for A actually gave out the answer.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    How to solve C

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      The answer is either 0 or 1 or 2. Think about it.

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Contest might be unrated ,but still it is running.Ask your question related to answers after the contest.

      • »
        »
        »
        »
        4 weeks ago, # ^ |
        Rev. 2   Vote: I like it +3 Vote: I do not like it

        I guess it's better to solve problems after contest else one has to wait 25+ min just to get verdict

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Just curious, what wrong idea was able to pass due to the weak pretests of C?

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +7 Vote: I do not like it

      9
      3 1 2 6 4 5 9 7 8
      For this test case answer is 1. In my code I had the condition when the max element till now becomes equal to the index, I was incrementing my answer by 1 or 2. My code will print 3 for the test case mentioned and it passed the pretests.

    • »
      »
      »
      4 weeks ago, # ^ |
      Rev. 2   Vote: I like it 0 Vote: I do not like it

      I forgot about test when "unsorted" part is in the middle

      Like this

      Really stupid that their didn't make $$$t \leq 1000$$$ and made second case all permutation of 6... It is really easy to generate and I think that would reduce number of failed codes from 600 to around 20...

»
4 weeks ago, # |
  Vote: I like it -6 Vote: I do not like it

Please Unrate this contest. I have submitted the second question twice, thinking that the packets of the first submission might have dropped. Both the submissions passed the pretests but timings of the second one were considered.

I would have not submitted the second one twice if I have got the response for the second one quick.

»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

Great! waited a week to participate and then it's become an unrated round

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    It's like going to Pierre's on Wednesdays

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope we won't have the same issue in tomorrow's contest.

BePositive

»
4 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Very interesting tasks and once again unrated.

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

It's sad that contests with nice problems are getting unrated. First Monogon's round, now this.

»
4 weeks ago, # |
  Vote: I like it +13 Vote: I do not like it

To be honest, I feel bad for the authors.

»
4 weeks ago, # |
  Vote: I like it -14 Vote: I do not like it

Today hackerearth and codeforces became the same :)

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    hackerearth is way behind in terms of problem quality

»
4 weeks ago, # |
  Vote: I like it -9 Vote: I do not like it

Problemset was quite intersting, yet unrated. :3

»
4 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

I have really enjoyed your problems! I hope to see you in the next rounds as writers :=)

»
4 weeks ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

When you start performing well after a long time and the world conspires against you.
UPD: Now, I realized that the world conspired to save me from weak pretests.

»
4 weeks ago, # |
  Vote: I like it +37 Vote: I do not like it

No need to apologize MikeMirzayanov. You have been doing an awesome job. We are proud to have you.

»
4 weeks ago, # |
  Vote: I like it -23 Vote: I do not like it

Others: Solving questions hoping queue will become short.

Me(Knowing the Reality): Refreshing announcement Page again and again for more memes and so.

Note
»
4 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Nice contest after long long time, but it's unrated :(

»
4 weeks ago, # |
  Vote: I like it +30 Vote: I do not like it

One hour before contest

Me: Well, good rating to me, contest after a long time.

Goes to contest page to register

Me: Oh look, there are so many upcoming contests!

Monogon contest name stands out

Me: Lol, when Monogon made a contest the last time, contests this close were plagued with Queueforces. Let's hope it doesn't happen this time.

Submit B, redirects to status page

Gives up CP and becomes a soothsayer's apprentice...

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +25 Vote: I do not like it

    The queue strikes back.

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      “Mike Awakens”.

      Becomes the “Last to Shuteye”.

      Leads to the “Rise of the Sleepcoder”.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I thought cf has overcome it queue problem. Last few contests were very nice. Pretests were judged very fast and they were very strong too. Sad about today's contest. Hope things will be fine soon.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

In C, is it true that you can sort any permutation in 2 or less actions?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yes! It's true. :D

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    if(number of moves req>1):

    I think so. We can just shuffle every element such that no one is in correct place and then in the next move, put all of them in the correct position

»
4 weeks ago, # |
  Vote: I like it -20 Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

waited for this round for about 7 days and got LONG QUEUE PROBLEM(

»
4 weeks ago, # |
  Vote: I like it +178 Vote: I do not like it

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Please translate. D:

    • »
      »
      »
      4 weeks ago, # ^ |
      Rev. 2   Vote: I like it -20 Vote: I do not like it

      solution given to your grandson

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +19 Vote: I do not like it

      You submit the solution, but verdict will be given to your grandson Xd

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      There is this famous TV comedy show in India. In that show during a festival sale, this character who worked in a shop as assistant gave the idea of the offer to shopkeeper-"Let people buy items, we will take money from their grandsons." This meme is based on that line "You solve the question, verdict will be given to your grandsons"!.

»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

Just Want to ask one question to problem setter why you used name Omkar ?

At the start of the contest I was like, Did I made any mistake? ...xD

»
4 weeks ago, # |
  Vote: I like it +16 Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

When you finally think you gonna reach expert but god has other plans.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

The queue is ruining the experience...

»
4 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

To be honest, I feel bad for the authors. Problem were pretty interesting

»
4 weeks ago, # |
  Vote: I like it +17 Vote: I do not like it

Why cant the difficulty of A,B,C be increased so there are lesser number of submissions? and i don't think there's much one can learn from the current A B C problems anyways.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    maverick16 thats why there is a div1 too. I think the problems were very interesting.

»
4 weeks ago, # |
  Vote: I like it +108 Vote: I do not like it

Mike after making changes to the platform:
PS: this is just a meme and I really respect what Mike is doing for the cp community

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

What about the Educational Round tomorrow? Is it going to be postponed?

»
4 weeks ago, # |
  Vote: I like it -14 Vote: I do not like it

Guys, I am disheartened a lot. I started CP just 3 months ago. I was a noob. Today, before the round becoming unrated my rank was 1260. Delta was +206. It is very rare. I have lost the confidence. What positives should I take from this?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +28 Vote: I do not like it

    If you have the ability to go +206 this round, you will be able to do so again in future rounds. Just keep practicing and know that you're improving!

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      The artwork in ur dp seems really cool; can you tell me the source?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -11 Vote: I do not like it

    same about me. Delta was +238, though it would be lower, had everyone done the problems with usual speed. I suggest you not to worry since in the long run, such things won't matter much. If you really improved your skills, you will get that rating in the next contests.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -17 Vote: I do not like it

    negative contribution!! XD
    u can do good in the next round too, i was also getting enough delta to be in div 1 :)

»
4 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

How many servers are running cf?

»
4 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

I am feeling bad for the problem setters.

»
4 weeks ago, # |
Rev. 3   Vote: I like it -29 Vote: I do not like it

Good contest and awesome problems.

»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

I saw somewhere that this is the first contest organised by its organisers. But it seems after looking at the questions that organisers have large experience. So much beautifull,difficult questions i have never seen in any single contest

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

:)

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Cool problems, pity the que blew out of proportion.

»
4 weeks ago, # |
  Vote: I like it +145 Vote: I do not like it

Nowadays, Codeforces has become Constructive forces, Missing those days when we were able to find good concepts like binary search, DP, Graph, DSU, etc in problems.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +36 Vote: I do not like it

    In the past, C, D problems really made me comfortable even when I could not solve them. These days, I feel like C, D problems are usually just some random observations with under 10 lines of code. God, I miss graph problems -_-

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +28 Vote: I do not like it

    Those days are never going to be back, at least not until antontrygubO_o is the coordinator. He rejects 72 problems just to make Codeforces, Atcoder.

»
4 weeks ago, # |
  Vote: I like it +13 Vote: I do not like it

It seems that we should slightly increase the difficulty of problem A, increase $$$T$$$ for the first problems and make fewer pretests for them.

»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

It's bad to see round unrated. I have a suggestion for next rounds . I don't know it is right or wrong.

There may be an unrated easy problem (a+b type) 10 minutes before contest starts, and at that time registrations should be closed. It will help in stress testing. If there will be any problem during testing then round should not be hosted.

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Anything could happen during the contest, so I don't think it'll help much.

»
4 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Can anyone help me in C? It's giving TLE

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    Even though it is unrated, contest is still ongoing. Please don’t discuss the problems.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

This contest has really good problems and perfectly matches div. 2 status but now it is unrated. let us, Hope, we get some more exciting contests like this one.

»
4 weeks ago, # |
  Vote: I like it -11 Vote: I do not like it

I think one should go through this article and understand difference between programming and coding.Programming vs Coding.These cleared many of my doubts between Coding and Programming.

»
4 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

The contest was really awesome, hope to see more from you! :)

»
4 weeks ago, # |
Rev. 3   Vote: I like it -30 Vote: I do not like it

[Sorry for the meme. But really disappointed , i missed a important task for attending this]

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

well slightly sad that contest is unrated.really feeling sad for all the problem setters.what a lovely set of questions we had today at our disposal.well as they tommorrow will be even better than today.fingers crossed .lets hope good ratings for tommorrow's contest.

»
4 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

Nice Contest! I really liked the problems!

»
4 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

How to solve D? Thanks in advnce:)

  • »
    »
    4 weeks ago, # ^ |
    Rev. 2   Vote: I like it +4 Vote: I do not like it

    You can choose at most (n+1)/2 elements, and you should choose (n+1)/2 elements because all elements are non-negative. And you can observe that unchosen elements cannot be adjacent.

    Then the problem is find n/2 elements which are not adjacent and have smallest sum. DP can solve it. The time complexity is O(n).

    I think I am right.

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I also thought of the same approach but couldn't figure out which n/2 elements to eliminate from the sum.Could you help a little more on how to do the dp part?

      • »
        »
        »
        »
        4 weeks ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        86561722 You can refer to my code. Notice that head and tail can not be chosen simultaneously.

        • »
          »
          »
          »
          »
          4 weeks ago, # ^ |
          Rev. 2   Vote: I like it 0 Vote: I do not like it

          qfhy Is it not possible that n/2 elements which contribute to smallest sum, change after one operation(for instance, after smallest element is replaced by sum of its adjacent elements in the very first operation).

          • »
            »
            »
            »
            »
            »
            4 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            Can you give an example? My submission has been accepted.

          • »
            »
            »
            »
            »
            »
            4 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            I see. This approach is global. No need to worry such things.

»
4 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

How to approach question D?

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    there is a simpler solution. firstly note that we cant have three consecutive elements in a sum. also we can't have two consecutive elements which are not in the sum. also note that we can only have at most (n+1)/2 elements in the sum. so we can simply find the max over the sum of all (n+1)/2 alternating sequences

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it -7 Vote: I do not like it

    Though I haven't implemented it , but may be this greedy works. Always try replacing those adjacent is who have maximum value of ai+1 +ai-1-ai. Idk if this works or not.

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I think it doesn't work. Try: 1 2 3 3 2. The answer is 7, but your algorithm (if I got it right) gives 6.

      • »
        »
        »
        »
        4 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I think it gives 7 replace 1 3 array becomes 4 3 2 Repalce 4 3 array becomes 7.

        • »
          »
          »
          »
          »
          4 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          This doesn't match your requirement of "maximum value". Your replacement gives: 3 + 1 — 2 = 2. But if you replace the 4 1 array (remember the array is circular) you get: 2 + 2 — 1 = 3, which is higher.

          If the circularity of the array confused you, let's rotate it: 2 1 2 3 3.

          • »
            »
            »
            »
            »
            »
            4 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            Yep Sorry! thus greedy fails for this problem. Only way is to consider all the possible cases through dp.. Thank you for figuring my mistake.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone please help me with approach of B. It's giving TLE in pretests 4

  • »
    »
    4 weeks ago, # ^ |
    Rev. 2   Vote: I like it +3 Vote: I do not like it

    Simply check for each factor.

    Time Complexity O(sqrt(n))

    Code

    • »
      »
      »
      4 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Thanks a lot! It was quite easy. I don't know why I couldn't crack it!

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Its simple for as we can see for even n ans is n/2, n/2 and for odd n if n is prime then ans is 1, n-1 it is self explanatory. now if n is odd and it is not prime then find smallest prime divisor of n let it is sm(n) so ans is n/(sm(n)), sm(n) it is optimal solution

    to find smallest prime divisor refer this

  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    If n is even then a and b is n/2 and if it is prime then 1 and n-1 else the largest factor which divides n other than n itself so let it be x then x and n-x.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

That's completely unfair !!. been for a long time doing bad in contests and when i don't, it's going to be unrated. i am very disappointed.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Waited for 10 minutes for the verdict Wrong answer on pretest 3.