| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 164 |
| 2 | adamant | 149 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
|
+30
As a tester, Dominater069, Everule and satyam343 orz |
|
On
JaySharma1048576 →
Invitation to CodeChef Starters 114 (Rated till 6-stars) — 27th December, 2 years ago
+7
So much mindless implementation with figure out what are the edge cases. |
|
+43
I went to Alaska and did master level testing. |
|
0
Might be possible, my bad. |
|
0
Probably requires minor constant optimizations. 207226137 passed in 3 seconds. |
|
+3
Not sure if it is compatible with your solution, but in F replacing segment tree with a priority queue or a set gives AC in approx 3 seconds. |
|
+40
As a tester, I shall farm contribution. PS: Hope you like the round and wish you positive rating :D |
|
+10
Okay I'm a bit annoyed (and it certainly is my fault) that I FST'd Problem D and once again (yes, previous times also I was reaching Master and then FST'd) I have to wait to touch that yellow colour again. What was the mistake? Compare these two codes to find out: WA on test 25 code: https://mirror.codeforces.com/contest/1750/submission/179611048 AC code: https://mirror.codeforces.com/contest/1750/submission/179704899 To make things simpler, I shouldn't have modded the value of cc, since it's required in later stages as the original value. A funnier fact is that using MOD = 1e9 + 7 instead of 998244353 would've actually worked because cc has an upper bound of m = 1e9. At this point, it seems like my fate doesn't want me to reach master again :( Anyways, it was a great contest! A big thank you to everyone involved in the problem setting team. (Although I believe C was a bit harder than usual :P) |
|
-6
I think it has been quite a long wait now. Any updates? |
|
0
What is wrong with this comment? Why are people downvoting it? |
|
+1
|
|
+14
Can agree. |
|
+12
how to work hard like you |
|
+12
Bruh. |
|
+4
Thanks. |
|
+1
Thanks a lot! Fixed the typo and added the problem. |
|
+9
Apparently, the main idea for the problem was the same as one of the ideas used in one of the problems in yesterday's Codechef Snackdown Finals. |
|
On
radoslav11 →
Invitation to September Lunchtime 2021 — Saturday, 25th September, 6:30 PM IST, 5 years ago
+10
The change in timings is most probably because there is Facebook Hacker Cup Round 2 from 10.30 pm to 1.30 am IST. |
|
+63
He never said that upvoting 'as a tester' comment will get you positive delta :( |
|
+22
vishesh312 setter orz |
|
+15
OTZ |
|
+7
Are you math? Because I hate you when you come as Div 2 Bs. |
|
Its showing "Failed to log in" for me, after using the same username and password. |
|
+17
Deep down you know that is your alt account and you made it for bad mouthing. |
|
0
Please predict mine when you get time, thanks in advance. |
|
+7
Well, the working of D was googleable. You just need to connect and implement. Link to the site: https://www.codechef.com/wiki/tutorial-expectation (Q3). |
|
0
On the first iteration it will return 2 as mid (because its 0 indexed) |
|
+6
Should probably be something like 6 3 3. Actual answer should give 36, people who failed system tests, their answer is 120. |
|
+39
Weak pretests for C. Huge number of people getting WA on test 10. |
|
+17
I guess that codeforces is trying to make interactive problems a part of the contests, which according to me, is a good thing to do. |
|
-7
Did someone force you to reply here? |
|
+3
Yes, but don't you think the implementation will go for a toss? I am not telling you that my solution is the best, just telling you from my perspective, I code a solution which is the easiest to implement. |
|
0
We put the ones in $$$k / n$$$ iterations, and thus the remaining ones will be $$$k$$$ % $$$n$$$. Note, over here the answer is $$$2$$$. The remaining ones should be lesser than $$$n$$$, because if not, then we could have added another iteration to use the $$$n$$$ ones. As the remaining ones are lesser than $$$n$$$, it means that they are lesser than the number of rows and columns. Thus, we iterate for the first $$$k$$$ % $$$n$$$ rows and columns, in the next iteration, and initialise that point $$$a[row][col]$$$ to $$$1$$$. |
|
0
Judging a problem without taking part in contest By solving it after the contest ends. |
|
+7
The following is not the way written in the editorial, but I have done it in my solution. Firstly, lets observe that if $$$k$$$ is divisible by $$$n$$$, the answer is $$$0$$$, and when it is not, the answer is $$$2$$$. Proof There are $$$n$$$ rows and $$$n$$$ columns. ($$$k$$$ % $$$n$$$) is always less than $$$n$$$. Thus each extra integer, can be fitted in these $$$n$$$ rows and columns. Now, how to fit the integers? What I did was first insert $$$1$$$s in indexes $$$[1, 1], [2, 2], ...., [n, n]$$$. In the next iteration, I inserted $$$1$$$s in indexes $$$[1, 2], [2, 3], ...., [n, 1]$$$ Like this, we have $$$(k / n)$$$ iterations. I had put the extra $$$(k$$$ % $$$n)$$$ 1s simply as if it was the $$$(k / n) + 1$$$ th iteration, and only the first $$$(k$$$ % $$$n)$$$ 1s need to be inserted. My submission for reference: 85648287 |
|
+5
And currently, mine is $$$(6 + 7)$$$ = $$$13$$$, but if they would have swapped $$$A$$$ and $$$B$$$, it would have been $$$(1 + 7)$$$ = $$$8$$$. But that doesn't matter much, rating would have been affected by $$$1$$$. Focus on improving skills brother! |
|
+4
I got a Wrong Answer on System Testing in D. Div3, here I come :). |
|
0
Yes, it is rated. |
|
0
Due to the unusual timing, I can't participate in the contest. RIP rating. |
|
-11
Hope this round has strong pretests... |
|
-13
Wish everyone high rating and I hope that most of you go to the next rank in this contest. |
|
On
dreamoon_love_AA →
Codeforces Round #631 (Div. 1 and Div. 2) — Thanks, Denis aramis Shitov!, 6 years ago
+10
All the best to everyone who will participate in this round. I hope to become a specialist after this contest. |
|
0
Thanks. |
|
0
Hi, just wanted to know when will the scoring distribution be put up? |
|
0
In Question E, my solution is giving MLE. Could anyone please help me. Link to submission : https://mirror.codeforces.com/contest/999/submission/66542471 |
|
0
When will the editorial of the problems be posted? |
| Name |
|---|


