vovuh's blog

By vovuh, history, 5 weeks ago,

Notice the unusual start time.

Hello!

Codeforces Round #674 (Div. 3) will start at Sep/28/2020 11:05 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

This round consists mostly of the problems of the first stage of All-Russian Olympiad of School Students in Saratov and will be hosted during the real competition time. The problems were invented and prepared by Ivan BledDest Androsov, Alexander fcspartakm Frolov and me.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

• take part in at least two rated rounds (and solve at least one problem in each of them),
• do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria ZeroAmbition Stepanova, Mikhail pikmike Piklyaev, Maksim Ne0n25 Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round. Also thanks to Artem Rox Plotkin and Dmitrii _overrated_ Umnov for the discussion of ideas and testing the round!

Good luck!

UPD: Thanks to Ivan MrReDoX Ushakov, Ivan Ivan19981305 Georgiev and Dmitry sladkayaKlubnichka Kadomtsev for testing the round!

UPD2: Editorial is published!

• +258

 » 5 weeks ago, # | ← Rev. 2 →   +35 *Notice the unusual start time.
•  » » 5 weeks ago, # ^ |   +1 Thank you so much!! I would have missed it.
 » 5 weeks ago, # |   0 I think vovuh should update the blog mentioning unusual start time.
 » 5 weeks ago, # |   +1 weird time tho
 » 5 weeks ago, # |   +3 Sorry cannot participate because of the practical class at the same time
•  » » 5 weeks ago, # ^ |   +22 Same but I am bunking them.
•  » » 5 weeks ago, # ^ |   +1 Gonna get my ass kicked for codeforcing at work xD
 » 5 weeks ago, # | ← Rev. 2 →   +87 Me Also. xD :) ()
•  » » 5 weeks ago, # ^ |   0 we r really waitin!! XD
 » 5 weeks ago, # |   +16 Why so unusual start time ?? :(
•  » » 5 weeks ago, # ^ |   +22 "This round consists mostly of the problems of the first stage of All-Russian Olympiad of School Students in Saratov and will be hosted during the real competition time."
•  » » » 5 weeks ago, # ^ |   +22 I See, its going to be fun then!!!!!!!!!
•  » » 4 weeks ago, # ^ |   -10 yeah...i think all contests should be held usual time:)
 » 5 weeks ago, # |   +16 So unusual time. Its lunchtime here in India.
•  » » 5 weeks ago, # ^ |   +14 And the standard time is dinner time ;_;
•  » » 5 weeks ago, # ^ |   +1 dont say lunchtime...it confuses with codechef lunchtime ....lol
•  » » » 5 weeks ago, # ^ |   +1 but lunchtime is at dinnertime
 » 5 weeks ago, # |   +20 All-Russian Olympiad alright imma skip this one
•  » » 5 weeks ago, # ^ | ← Rev. 2 →   +13 This is the first (of 4) level of Russia National Olympiad. Problems usually are really easy.
•  » » » 5 weeks ago, # ^ |   0 I am trusting you
•  » » » » 5 weeks ago, # ^ |   0 me too
 » 5 weeks ago, # |   +42 Me after remembering the previous div2 contest based on russian Olympiad for school students: i am gonna skip this because of unusual time.
•  » » 5 weeks ago, # ^ |   +11 Its Div-3 bro, what do you got to lose, its unrated for you
 » 5 weeks ago, # |   -30 Bruh this contest is suit for me but i think i won't participate(because of the unusual start time)
 » 5 weeks ago, # | ← Rev. 2 →   -30 Aw man, I think a lot of people (including me) won't be able to participate because of the unusual timing :/Edit: I'll miss because I've to attend online lectures, just though I'd add this here..
 » 5 weeks ago, # |   -29 really wanted to participate but wont be able to due to my online classes.hope for some magic
•  » » 5 weeks ago, # ^ |   +5 you guys are attending online classes?
•  » » » 5 weeks ago, # ^ |   +18 No, TBH.
•  » » » 5 weeks ago, # ^ |   +1 F**k online classes. They are not worth attending!!
•  » » » 5 weeks ago, # ^ |   0 Nope :)
•  » » 5 weeks ago, # ^ |   +4 I am skipping classes.. not worth enough a CF contest lol.
•  » » » 5 weeks ago, # ^ |   0 i am also skipping my class
 » 5 weeks ago, # |   0 Really excited for this contest, but it's unusual time is not suitable for most of the college students in India as we have online lecture at that time.
•  » » 5 weeks ago, # ^ |   +7 you guys are attending online lectures?
 » 5 weeks ago, # |   -75 submit F in last 5 seconds and find my output is following: YES 1 1 1 1 1 1 1 3 4 2 3 1 RDLL DRDD ULUU NO instead of YES 1 1 1 1 1 1 1 3 4 2 3 1 R D L L D R D D U L U U NO Hope my solution is wrong XD
•  » » 5 weeks ago, # ^ |   +43 Round is not even started yet, but u already submitted, Ur coding speed is so enormous!
•  » » » 5 weeks ago, # ^ |   +29 I miss the golden time in which I can delete the misplaced comment. T_T
•  » » 5 weeks ago, # ^ |   0 well looks like your wish came true xD
 » 5 weeks ago, # |   0 4 AM for me then.
 » 5 weeks ago, # | ← Rev. 2 →   0 Deleted for posting at a wrong place.
•  » » 5 weeks ago, # ^ |   0 Too bad this contest is Div 3.
 » 5 weeks ago, # |   0 Bruh ,you ain't getting me this time .I still remember that russian 6th grade student's round . This one is for all russian student olympiad. Even more tougher.
 » 5 weeks ago, # |   0 BledDest and vovuh are gem problemsetter
•  » » 4 weeks ago, # ^ |   0 are ratings updated?
•  » » » 4 weeks ago, # ^ |   0 not yet !
•  » » » » 4 weeks ago, # ^ |   0 oh fine.Normally how long does it take for updation? I am new here so I don't know much
•  » » » » » 4 weeks ago, # ^ |   0 it may very contest to contest , we can say anything that in that amount time it will update, usually in div 3 it take more time then div 2. hope it help you . all the best keep coading bro
•  » » » » » » 4 weeks ago, # ^ |   0 thanks for the info.Yes i will :)
 » 5 weeks ago, # |   0 should i eat lunch or give this contest?
•  » » 5 weeks ago, # ^ |   0 Why not both?
 » 5 weeks ago, # |   0 I'll be eating and crying at the contest time as it's lunchtime and I suck at DIV 3://
 » 5 weeks ago, # |   +3 Gonna wake up at 4 am(my local time) for this contest! Very excited!
 » 5 weeks ago, # |   +9
 » 5 weeks ago, # |   +3 Time too bad. Have classes. Any after 3pm UTC works fine.
 » 5 weeks ago, # |   0 really weird time !
 » 5 weeks ago, # | ← Rev. 2 →   +4 Every time I want to improve my CP skills, my college is letting me down and this is another example.
 » 5 weeks ago, # |   +15 It would be pretty good if CF were in this time rectangle in the future.
 » 5 weeks ago, # |   +29 Another suitable time for Chinese......But "based on" makes me afraid!
•  » » 5 weeks ago, # ^ |   +27 I can finally have a CF competition and have not to sleep at 1:00 in China :)
•  » » » 5 weeks ago, # ^ |   +29 Don't be afraid!It isn't hard at all!
 » 5 weeks ago, # | ← Rev. 2 →   +6 Oops, sorry It was the wrong post :((
 » 5 weeks ago, # |   +31 Coding is love.![ ](from Imgflip Meme Generator)
•  » » 5 weeks ago, # ^ |   0 Same here bro xdd
•  » » 5 weeks ago, # ^ |   0 us fr
 » 5 weeks ago, # | ← Rev. 2 →   -8 vovuh score distribution plzz..
•  » » 5 weeks ago, # ^ |   +6 There are no score distributions in Div.3
 » 5 weeks ago, # |   0 IN INDIA IT's OUR ONLINE CLASS TIME
•  » » 5 weeks ago, # ^ |   +8 It's impossible to conduct a contest such that time will be suitable for everyone across the world.
 » 5 weeks ago, # |   +1 This is the first time a div3 round is not rated for me! idk i just want to share this
 » 5 weeks ago, # |   0 No as a tester, I would say sth commentWierrrrrd!
 » 5 weeks ago, # |   0 After a long time, a rated div3 for me :P.glhf
 » 5 weeks ago, # |   +14
 » 5 weeks ago, # |   0 haha .... i had to choose between this and online class :(
 » 5 weeks ago, # | ← Rev. 2 →   0 After the contest ends, how to solve D?How to not double count subarrays with zero sum?
•  » » 5 weeks ago, # ^ |   0 You can have a look at my submissionhttps://codeforces.com/contest/1426/submission/94110582
 » 5 weeks ago, # |   0 How to solve F?
•  » » 5 weeks ago, # ^ | ← Rev. 2 →   0 we want to count the total number of abc, ab?, ?b?, ???, ??c, a?c, a??, ?bc subsequences occurring in all the strings, we can replace ? with the character that we need to make it abc. I've named variables for better understanding. In my code, k = count of ? so far submission
•  » » 5 weeks ago, # ^ |   0 started from back of string and kept the count of subsequences of type abc,bc and c
 » 5 weeks ago, # |   0 how to solve c?
•  » » 5 weeks ago, # ^ |   0 binary search
•  » » » 5 weeks ago, # ^ |   0 Can you please elaborate ?
•  » » » 5 weeks ago, # ^ |   0 how?
•  » » » 5 weeks ago, # ^ |   0 It can be solved without binary search too, simple arithmetic calculation
•  » » 5 weeks ago, # ^ |   0 For this, I got a pattern of the required number of moves like 0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, ...... Hope it will be helpful.
•  » » » 4 weeks ago, # ^ | ← Rev. 2 →   +1 Took time for figuring that out. Found editorialist solution more easy btw.
•  » » 5 weeks ago, # ^ |   0 I found x*(x+1)>=n using binary search but it wasn't correct for last two sample test cases and then I found x*x>=n as well as x*(x+1)>=n separately and took minimum of both, it got accepted.
•  » » » 4 weeks ago, # ^ |   0 but why you have to find x*(x+1) in the first place?thanks
•  » » 5 weeks ago, # ^ |   0 Suppose we perform the +1 operation $x$ times and the duplicate operation $y$ times. Clearly we want to perform all the $x$ operations first, so that each subsequent $y$ operation adds as much as possible. Then the sum of the array will be $(1+x)+y(1+x)=(1+x)(1+y)$. We want $(1+x)(1+y) \ge n$, so each of $(1+x)$ and $(1+y)$ is either $\lfloor \sqrt(n) \rfloor$ or $\lfloor \sqrt(n) \rfloor+1$. Then we can just try the cases.
•  » » » 4 weeks ago, # ^ | ← Rev. 2 →   0 so each of (1+x) and (1+y) is either ⌊(√n)⌋ or ⌊(√n)⌋+1. Then we can just try the cases.i didnt get the last part how this is possible?and why the solution does not go beyond the root n thanks
•  » » » » 4 weeks ago, # ^ |   0 If we want to minimize $a+b$ and want $ab\ge n$, then we want $a$ and $b$ to be as close to each other as possible (just try a few values... it's very intuitive). That means each of $a,b$ must be around $\sqrt{n}$. In this problem, $a=1+x$ and $b=1+y$.
•  » » » » » 4 weeks ago, # ^ |   0 ohh ok got it thanks
•  » » » » » 4 weeks ago, # ^ | ← Rev. 2 →   0 We can apply AM>=GM  ((x+1)+(y+1))/2 >=sqrt((x+1)(y+1))  ((x+1)+(y+1))/2 >=sqrt(n)  ((x+1)+(y+1)) >=2*sqrt(n) x+y >= 2*sqrt(n)-2 -----for n not perfect square x+y >= 2*sqrt(n)-1 -----for n perfect square 
•  » » 5 weeks ago, # ^ |   0 it is better to increase 1 up to some number let say x and then append this x up to when the array sum becomes equals or greater than target value nhere x should be the floor(square root of n) or 1 plus to this valuehere is mine solution 94092529
•  » » 5 weeks ago, # ^ |   0 https://codeforces.com/contest/1426/submission/94102291I hope this makes it clear.
•  » » 4 weeks ago, # ^ |   0 I pre calculated maximum possible sum for i operations (1 <= i <= 63244). To maximise, wee can use floor(i/2) operations of type 1 and ceil(i/2) of type 2.When the values are precalculated, we can just use the lower_bound to find the index for a particular n.https://codeforces.com/contest/1426/submission/94156182
 » 5 weeks ago, # |   +6 what was the testcase no 10 of problem D??
•  » » 5 weeks ago, # ^ |   0 Something like this.5-1 1 -1 1 -1
•  » » » 5 weeks ago, # ^ |   0 What will be the correct ans for this
•  » » » » 5 weeks ago, # ^ |   0 4
 » 5 weeks ago, # |   0 Can some one give me idea about B & Dthanks in advance
•  » » 5 weeks ago, # ^ |   0 For B you just have to input 4 nums n times , let's say x,y,a,b and check (y==a && m%2==0) since it is not possible to build a 2X2 tile in odd m , and for symmetric if you have y==a you can just use only that tile many times to build a matrix.
•  » » » 5 weeks ago, # ^ |   0 OPS i was checked for (x==d&&y==a)that's why i got wrong verdict It's my bad luck
•  » » 5 weeks ago, # ^ |   0 for B: if any 2x2 tile has diagonal element same then answer will be yes, keep in mind that tile length and width is 2 so the the resultant square will be multiple of two
•  » » 5 weeks ago, # ^ |   0 In your B, a doesn't have to be equal to d, just b should be equal to c and m should be even.
•  » » » 5 weeks ago, # ^ |   0 i Was check for a==d && b==c that why i got wrong verdict
•  » » 5 weeks ago, # ^ |   0 For B,let say matrix is A BC DIf m is odd, answer will be NOFor even m If for any matrix B == C then answer will be YES else NO
 » 5 weeks ago, # |   +49 Problem F is exactly the same as ABC104 Problem D
 » 5 weeks ago, # |   0 How to solve D neatly ? I can think of one way where we count the disjoint subarrays with zero sum.
•  » » 5 weeks ago, # ^ | ← Rev. 3 →   0 Think of it as you have, say $k$ intervals (imagine as segments on the $x$-axis, from $interval[i][0]$ to $interval[i][1]-1$) and each interval has elements that sums to $0$. Now basically, you need to find the total number of vertical lines to make, such that every segment is cut at least once. Implementation
 » 5 weeks ago, # |   0 How to solve D? went upto prefix sums and thought if prefixsum[i] is 0 or has already occurred then add 1 to the answer but it doesn't seem to work because segments can collide. Can anybody explain a neat approach?
•  » » 5 weeks ago, # ^ |   +3 i counted all the segment that collides in one then also ans was coming wrong on testcase 10 anyone can explain
•  » » » 5 weeks ago, # ^ | ← Rev. 4 →   +1 If you find subarray with sum zero ending at index i then you insert very big number between index i-1 and i. Now you don't need to care about elements to the left of index i. inline void solve() { ll n, i, s = 0, ans = 0; cin >> n; ll a[n]; set st; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) { s += a[i]; if (st.find(s) != st.end() || s == 0) //there is case of zero subarray sum { //So we increase our ans and ans++; //clear set and make sum = a[i] st.clear(); s = a[i]; } st.insert(s); } cout << ans << endl; } 
•  » » 5 weeks ago, # ^ |   0 went up to prefix sums and thought if prefixsum[i] is 0 or has already occurred then add 1 to the answer — it's perfectly okay till now then you just need to clear your container and do everything that you need by assuming the current position of the array as the starting position. Hopefully, it will do your job.
•  » » 5 weeks ago, # ^ |   0 Think of it as you have, say $k$ intervals (imagine as segments on the $x$-axis, from $interval[i][0]$ to $interval[i][1]-1$) and each interval has elements that sums to $0$. Now basically, you need to find the total number of vertical lines to make, such that every segment is cut at least once. Implementation
 » 5 weeks ago, # |   0 The number of participant's are not so many for the unusual start time.
 » 5 weeks ago, # |   0 Since the contest time is unusual,I bunked my class to participate in the contest.The Dashboard was quite interesting and I enjoyed the contest very much.
 » 5 weeks ago, # |   0 thanks vovuh for fast editorial ^.^
 » 5 weeks ago, # |   0 Wow,The editorial is ready!!!
 » 5 weeks ago, # |   0 Just when I was submitting the D problem ,my electricity supply went off,gave the contest from phone...poor me,but problems were superb and am glad I participated..Thanks vovuh
 » 5 weeks ago, # |   0 Can someone help with with this submission? I could not think of a testcase that fails. 94110488
•  » » 5 weeks ago, # ^ |   0 your code will fail for when n=1 and X =1 Cuz (1-2)/1=-1 So else part will give -1+1=0
•  » » » 5 weeks ago, # ^ |   0 Bruh there goes my ratingThank you
 » 5 weeks ago, # |   0 Did codeforces recently changed the rating formula?
•  » » 5 weeks ago, # ^ | ← Rev. 2 →   0 I dont know but maybe this might be the reason...the number of participants is less hence you may see less change in delta even if you have good rank.
•  » » » 5 weeks ago, # ^ |   +1 Yeah, I thought that I was really hoping to touch expert but nevermind I try next round.
•  » » » » 5 weeks ago, # ^ |   +1 Yes and I wanted to be specialist..sed..next round.
•  » » » » 5 weeks ago, # ^ |   0 I followed you, and I think if you are not hacked, you will turn blue.
•  » » » » 5 weeks ago, # ^ |   0 i'm also very close to blue :(
 » 5 weeks ago, # |   0 Excuse me! Why is E like A in terms of difficulty?
•  » » 5 weeks ago, # ^ | ← Rev. 2 →   0 The fact that it is E has psychological effect hence the number of solves is almost 10 times less then A..despite the difficulty level.
•  » » » 5 weeks ago, # ^ |   0 Number of solves is 10 times less mainly because there are 3 more questions between A and E which people attempt, and mostly move ahead only when they are done with those.
•  » » 5 weeks ago, # ^ |   0 There is a general thing. People can solve A because its A, people cant solve E even if its easy cause thats E
 » 5 weeks ago, # |   0 There is a question: I did not participate in this round because of something. If I hack someone, will I be rated?
•  » » 4 weeks ago, # ^ |   0 No
 » 5 weeks ago, # | ← Rev. 2 →   0 I started the contest half an hour late... yet managed to solve A,B,C,D ! Today was a good day for me!Thanks vovuh for the awesome round :)
•  » » 5 weeks ago, # ^ |   0 Why good day? You managed to get lot of penalties with better performance due to be late
•  » » » 5 weeks ago, # ^ |   0 Solving 4 problems in 1.5 hrs was a boost in confidence for me! I think that matters more than the penalties :)
 » 5 weeks ago, # |   0 Today's Div. 3 (Round #674): Spoiler alert for those who are thinking to give contest (virtually)
 » 5 weeks ago, # |   0 When will rating will be changed
•  » » 5 weeks ago, # ^ |   0 Rating for Div3 and Educational rounds(Div2) will be updated 1-2 hours after the open hacking phase is completed.
•  » » » 4 weeks ago, # ^ |   0 not updated till now
 » 5 weeks ago, # |   0 The advantages of being a Chinese have been revealed ：） The start time is 16:05 for me.
 » 5 weeks ago, # |   +1 Is there any benefit for successful hacking, in this round?
 » 5 weeks ago, # |   +1 Why don't we go beyond sqrt(n) in problem C ?
 » 5 weeks ago, # |   +4 is there any point for hacking in div3?
 » 5 weeks ago, # |   +1 Can anyone tell me on what test case my solution for B fails? It is hacked. Here is my submission.
•  » » 5 weeks ago, # ^ | ← Rev. 4 →   +1 12 23 56 43 65 4Your code print YES. But the ans is NO
 » 5 weeks ago, # |   +2 Can someone explain how hacks work for ICPC-style rounds like this one? Is there any competitive reward for successful hacks?
 » 5 weeks ago, # |   +1 Hands down the best contest I have participated in so far!
 » 5 weeks ago, # |   +1 Can anyone explain how this works:Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.I see xin_chen, CupCapCup and midheight at places [3, 4 and 5] accordingly. But that doesn't seam right: Their places are increasing but their (finish time + #WA * penalty) is decreasing >> [ (55 + 4 * 10) == 95 , (70 + 2 * 10) = 90 , (62 + 10) = 72] Plus, their number of WA decreasing: [4, 2, 1] but Penalty is increasing: 188, 193, 199 — it could make sense if their finish time was increasing, but it's not the case.How to make any sense of it? Thank you in advance.
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   +2 The penalty of xin_chen is: 2 + 9 + 13 + 27 + 42 + 55 (number of minutes since the start until the task is solved) + 4 * 10 (for WA) = 188Hope that will make it clearer
•  » » » 4 weeks ago, # ^ |   0 Wow, Super! Thank you, that made everything clear.
 » 4 weeks ago, # |   +1 Why my rating is still not updated?
•  » » 4 weeks ago, # ^ |   0 Has anyone's rating changed?
 » 4 weeks ago, # |   0 waiting for rating changes ...
 » 4 weeks ago, # |   0 Will it not be rated for untrusted participants? As my ratings haven't changed yet, being < 1600 and already 5+ hours have passed after the end of the hacking phase.
•  » » 4 weeks ago, # ^ |   0 This is because they might be working on the plagarism tests now and removing the cheaters.
•  » » 4 weeks ago, # ^ |   0 You can see your rating predictions on cf-predictor. It's pretty accurate.https://cf-predictor-frontend.herokuapp.com/
 » 4 weeks ago, # |   0 As I am new to Codeforces so can anyone tell me that in this contest will I get any rating or not because I have solved the 3 questions but and also got my rank but not any rating and even in my contest section it is not showing anything.please help me out?
•  » » 4 weeks ago, # ^ |   0 Wait for some time, it will get updated.
•  » » 4 weeks ago, # ^ |   0 https://cf-predictor-frontend.herokuapp.com/Found this predictor in another comment by abhijit , check it out.
 » 4 weeks ago, # |   0 Generally within 12 hours after completion of hack phase, rating change occurs
 » 4 weeks ago, # |   0 when will the ratings change...how long does it generally take??.
 » 4 weeks ago, # |   0 I solved 3 problems and I hope that soon change of my rating class come up to me from newbie to pupil!!
•  » » 4 weeks ago, # ^ |   0 Well cf rating predictor says you are getting 22 points h5jam.
 » 4 weeks ago, # |   +2 When are the ratings going to update for this round?
•  » » 4 weeks ago, # ^ |   0 The same question
•  » » » 4 weeks ago, # ^ |   0 Within 12 hours after completion of hacking phase
•  » » » » 4 weeks ago, # ^ |   0 Isn't it over?
•  » » » » » 4 weeks ago, # ^ |   0 System testing is on I guess.
 » 4 weeks ago, # |   0 Why hasn't the rating updated after the contest? it's almost 24 hours now...
•  » » 4 weeks ago, # ^ |   0 system testing just begins,omg
 » 4 weeks ago, # |   +2 When the ratings will be updated?
 » 4 weeks ago, # |   0 Was this Contest unrated ?
•  » » 4 weeks ago, # ^ |   0 maybe
•  » » » 4 weeks ago, # ^ |   0 They have updated the ratings
 » 4 weeks ago, # |   0 Solved 3 for the first time and I get a 0 rating change
•  » » 4 weeks ago, # ^ |   0 I also face the same issue, I had solved three problems in less time. I think the rating should be increased but the rating is decrease for the same. why?
 » 4 weeks ago, # |   0 I had no rating change....when will it happen?
 » 4 weeks ago, # |   0 For whatever reason, the final updated rank is significantly higher than what it was initially after the contest. Generally as far as I've seen, the rank drops, as the ones out of competition are taken off the list. Is this peculiar only to me or am I not seeing something?
 » 4 weeks ago, # |   0 I'm asking again, please can someone tell why don't we proceed beyond sqrt(n)+5 in problem C. Is there any mathematical proof for it? Thanks in advance!
 » 4 weeks ago, # |   0 Hi everyone! Can someone please help me with this solution from ecnerwala. How did he find max-flow in non winning edges in the code here — https://codeforces.com/contest/1426/submission/94072786How did he arrive at that one liner solution? Just a little insight will be very helpful.Thanks a lot