As a tester, I like all problems!

I can say that all the problems are very interesting to solve and the authors have done a great job inventing them.

By the way, does dkirienko help you?

If the answer is "yes" — is it meaning that participant can solve all problems using Python? :)

Is the round going to be Starcraft-themed? :P

Hope all of you will get good rating after this round .

Love the idea of per-problem feedback prompts! Although I wonder why people already started voting — are those testers or trolls? :P

So please, vote for each problem after the round's end.

you should have waited round to end for putting votes, now alot people will vote but forget to re-vote

The people who vote for the Bad problem even before they see the problem are the same people who always ruin beautiful things!

It is sad to see that some people have already voted "a bad problem" . Anyway, I wish everyone good luck for the contest!

As a tester I think there should be a section to ask for contribution.

Hello, I am a beginner who recently joined codeforces. Will there be a division 3 contest anytime soon? Thanks.

I don't understand why is it possible to evaluate problems before the round, it would be good update later , but why now?

nobody reads tags expect me

As a tester, I do read tags!

DELETED

Hope to get +69.

What about The people who vote for the Bad problem even before they see the problem!! what are u doing?!

I appreciate the idea of collecting the feedback regarding individual problems. But I'm getting the feel that this way of collecting the feedback might lead to a lot of false statistics. The round hasn't started yet and already you can realize some surprising data.

I suggest putting the voting buttons in the editorial. People should provide feedback only after they have seen the solution.

Great initiative!

new challenge for all contestants........good luck

Interesting delete line.

Which is more easy problem A or problem E?
I am new on codeforces. Plz tell me.

Good luck!

Wow! The authors of the round have avatars from Starcraft 2. We should participate!

Wowwwwwwwwwwwwwwwwww how can you add the likes?

as a !tester , i am here to farm contribution.

I am not sure the categories for evaluating problems are right. Quite often the problems I fail to solve (or fail to solve without reading the editorial) are the most interesting (best?) problems.

Hoping for a contest which do not contain problems like previous Div2 C

Good timing of the Australian Open Final, has ended 20 minutes before the contest.

Good luck everyone

ALL the best guys..

bitforces.

If I do multiple submissions, and all are passed then my score depends on my first submission or last submission

great round, loved the problems!

Hint for task C?

I have no idea why my solution to B passed pretests :OO

The fact that C=E1 in scoring distribution is strange for me.

back to mathforces :(

also thanks for very not misleading scoring of the last task

Is C Ad-Hoc?

DELETED

How to solve D without range query data structures?

Btw I really like the monotonic observation. Its such an obvious fact that as we increase the number of elements the gcd will not increase, but it really did not strike me in relation to the problem.

There were so many submissions by unrated accounts around the same time. Were the solutions of first 4 problem leaked or something ?

bit operation contest. lacked variety of problems...

I love problem D

bitforces

Very cool contest and interesting tasks!!!

Read at this bc I can't delete this comment: https://codeforces.net/blog/entry/99442#comment-882354

More cheat today.

@ MikeMirzayanov

we need to ban the cheat accounts,this kind of account makes imfair to cp

What's more , I find that most of accounts which submitted their code in 01:59 of E were suspect of cheat.

How is this wrong for E1? I maintained an Euler tour and segment tree. If I want to connect node 1 to node x. So max distance here will be max((max distance in the subtree of node x — dis[x] + i), max in the remaining tree excluding the subtree). Finally I take min ans for each x. Can someone pls give a counter example where this fails?

Я, конечно, не специалист, НО ВОТ ЭТА ГРУППА УЧАСТНИКОВ КАЖЕТСЯ СОМНИТЕЛЬНОЙ!!!!

abaddon9379992 zandira332 gubkabiba1312 vityakrishka69 copatoch777 salozida41234 artiom_barbary12 svingerchoper utopia_show1234 triada_tropik oposite_of_mom govorunishka f5robot2 popka_golovka312 gregory_pergant urod_marod Bad_google octopus3141 slivok_show GIMRAN__MOTHER aggressive_kid doggy_style22 popje popu_mit_nado chaba toster11 e3utpak friend01 andrewopsss chaba011 gaiday goodluck01 rot_ogorod Jazzer01 artem011 ignat0505 Naabordazh petro1990 sergserg marygot Artsiom27 joker03 opacha iozzw barlonix SerGoGo NastyaNestea Artemis011 Dastaqq ioz401 vareev calger catorey Voytenko gaspersq GenaNa Tema.ka tapertex nikitosss katushaaa jalora

Is this even possible to create a solution for D that exceeds time limit?

In question B ,if we take input 6,then according to editorial solution answer will be {3 2 1 0 4 5} but the optimal ans is {2 3 1 0 4 5}.

Good contest

During the contest when I was solving problem c, I got the intuition that we can solve this in a total of three steps in these sequence 1. either increase a or b by some amount. 2. take the OR. 3. increase the b to match the value with the second step value. Although I was not able to prove it during the contest. I submitted it just based on some gut feeling. So I just want to know is this the case with other people too? or do you guys first prove your solution and then submit it?

MikeMirzayanov I'm not really sure where to put this, but I received these two messages:

Attention!

Your solution 144568353 for the problem 1632D significantly coincides with solutions Weierstrass/144555583, codebuster_10/144561876, 876pol/144568353, Winterfrost/144569022, xiaoququsd/144572170, Kanheyalal/144572862, dimss/144575074, Kawaii/144576113, matouzouken/144576356. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://codeforces.net/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.

Attention!

Your solution 144557728 for the problem 1632C significantly coincides with solutions Weierstrass/144543081, codebuster_10/144548751, Kawaii/144549603, matouzouken/144551794, Winterfrost/144556519, 876pol/144557728, xiaoququsd/144562448, dimss/144563984, Kanheyalal/144564250. Such a coincidence is a clear rules violation. Note that unintentional leakage is also a violation. For example, do not use ideone.com with the default settings (public access to your code). If you have conclusive evidence that a coincidence has occurred due to the use of a common source published before the competition, write a comment to post about the round with all the details. More information can be found at http://codeforces.net/blog/entry/8790. Such violation of the rules may be the reason for blocking your account or other penalties. In case of repeated violations, your account may be blocked.

I wrote the code for both these submissions locally on vscode and I don't know any of the people mentioned in the message. Also, the codes don't seem that similar in the first place.

However, just to be sure, the code for 1632C is fairly short and is just a false positive. I had also submitted a couple WA submissions before this one, so its not like I copied it off of someone.

I got the code for the sparse table in 1632D from https://brilliant.org/wiki/sparse-table/, and the rest of the code is also short and is just two pointers.

(also, sorry for tagging you)

wow how many cheaters were removed? I should have got only +7 delta at the end of contest but now got +22

In the third problem, isn't b' the same as a'|b. But, it doesn't give me the correct solution. If anyone could explain.

Hi I am a newbie and would appreciate some assistance here. My submission fails with verdict Wrong answer on test 2. However when I click on my submission number I can only see test case 1 which is succeeding. My question is how can I see test case 2 ?

I have a trouble understanding problem D example test case 3:

input
7
2 12 4 8 18 3 6
output
0 1 1 1 2 2 2 

I expect that for prefix (2 12 4 8) we will need only 2 replacements, but it's 1 according to example

Specifically, I see two separate pairs: GCD(2, 12) = 2 and GCD(4, 8) = 2. I expect that we will need to replace one value in each pair

Can you help me?

Hi MikeMirzayanov, My id has been hacked and someone has submitted fraudulent copied solutions from my account. They have even changed the email address of the account to something random and I can't even recover it. I am sending this message from an existing session. Dm'ed you the details. Please help.