Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 days
Register now »
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 days
Register now »
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 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 | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
+6
As a tester, be ready to make 10 attempts on E before AC. :evil smile: |
|
+19
As a tester, contest tested me more than me testing it. OP problems. |
|
On
SeaYellow →
My First Blog — Why Understanding Psychology and Philosophy is Good for CP, 7 weeks ago
0
Didn't read your blog completely and didn't understand exactly what I read, but why tag Jiangly ? |
|
+6
And some gravity too, you definitely forgot that. |
|
Do you think you are Aleksei Daniliuk ?! |
|
+6
As a tester, problem D is really cool. |
|
0
I really hope that CM means check mate for you here. |
|
0
How many pawns do you have left ?! |
|
+12
Bro has attended 669 contests throughout 16 years, that's insane. Really MAD !! I appreciate it a lot. |
|
+4
Problems appearing may be easy to solve, but problems are Harddd by quality. Have fun! |
|
+1
Problem D is fire, I confirmed. Y'all should confirm too... |
|
0
Not expected from ICPC almost world champions. Edit: Congratulations man, take a bow. |
|
+1
Best way to spend weekend, let's compete!! |
|
+11
He doesn't need editorial, editorial needs him. He is (*_^) MathModel ORZ... |
|
0
Ahh shot, here we go again... |
|
+13
Last blitz round, I had so much fun. That 5th problem was really nice! Hoping to see Orz problems this time too! |
|
+3
You know what, better to attend this contest than to sleep on weekends. I'm competing, let's compete. |
|
+1
Again <(^_^) salute bow to MathModel who has beautified this round, from formatting my ugly problem statement to make my weak test cases strong to correcting my solution and improving complexity of it to determining cool conditions for subtasks and constraints to getting problem aboard with the help of testers and translators to the smooth round which'll happen, I am really grateful for the opportunity to work under this guy... |
|
+1
I don't think about college exams, I think in them. First principle, trying to find formulas which great people took thousands of years (I don't study (I should (Maybe))). I'm such a clown.. |
|
+2
As a friend of manjunath1729, he is so smart for ugly GF, but too dumb for pretty GF. (He's actively searching for GF), Of-course GF stands for generating functions (discord). |
|
+4
As an author, I can guarantee that Eolymp has extra-crazy math problems, and MathModel is an orz co-ordinator. Meow Meow |
|
+5
MathModel orz |
|
+9
My chess.com username is AST493. |
|
0
https://atcoder.jp/contests/abc416/submissions/67945292 Can someone help me find the counter test case for my solution ?! |
|
0
Hint: Where should 1 occur in original array A according to the pref and suf arrays ?! Hint 2 Thank you for making submission(s)! |
|
+3
No proofs, just the loads of casework XD. Thank you for investing your time and making a correct submission! |
|
0
You'll never know if I tested this round XD. |
|
0
Oh I see, that is clever. Thank you for notifying this to me, you really saved my hard work put in to prepare this problem! |
|
-11
Seems like second problem is closely related to Goldbach's conjecture! |
|
0
Yes, I know, I used that code to generate numbers such as 2^n-1. And it finally made it to the solution as well... |
|
0
Umm, not so formal, but XOR is addition and subtraction without carry, and gcd(a,b)=gcd(a,a+b) and gcd(a,b)=gcd(a,|a-b|). Thank you for making a submission though! |
|
0
Build the graph in which each cell on chess board contributes 2 nodes, one for D and another for AD. Find the shortest path distances for given cells and for a1 as well, then try all the permutations of the nodes i.e. k! Isn't most optimal it seems... |
|
0
Ahh double digit, I see, wasn't intended though. |
|
+5
Thanks for making a submission... |
|
0
Ahh, I could have used co-ordinate system, but I wanted the problem to be chessy chessy chess chess... |
|
0
Oh, I see. That is clever. Increased constraints maybe suitable for hard version of this problem. |
|
+3
Man of chess culture. |
|
0
Polygon only supports .mp files as images. So I couldn't convert JPEG and PNG to .mp files, so I did it this way... Are you facing any issue or was just curious ?! |
|
+1
Don't forget to tell me what's the estimated rating of problem according to you, and where should it be placed if it appears in a Div.2 contest! |
|
+1
Fixed! |
|
+1
Fixed! |
|
-6
You |
|
-10
Use no emojis in these blogs. |
|
-11
Let l1 be the start time of the LC biweekly contest, and r1 be the ending time for the same, let l2 be the start time of the CF round 1026, and r2 be the ending time for the same. Now because l1<l2<r1<r2, there's a clash, Ok ?! |
|
+28
Satyam343, so we gonna hit a median related problem! Aren't we ?! |
|
0
I have the same doubt now. Did you find an answer to it ?! |
|
0
XOR is an addition and subtraction without carryovers! |
|
+8
You are farming too much nowadays. |
|
0
But how are you guaranteeing that the "x" in the solution for E2 will always be in between "a" and "c+1" for every gcd "g" ?! |
|
Clear the global num vector! |
|
0
But we can't come to that node when it is processed and removed out of the queue right. That is what my solution achieves using the vis 2D array. I'm maybe opposing you too much, but I didn't get a concrete answer from ya, Don't get me wrong...Captain Cool. |
|
0
?! |
|
0
Auto comment: topic has been updated by Titan493ASST (previous revision, new revision, compare). |
|
0
Any simple counter for my first statement, or a proof to counter it ?! And I think you are getting 2 wrong. |
|
0
I think, but it could be possible we are coming there with a better ans than before seems wrong to me, as we are processing that node with that particular bicycle, then it is not possible to meet that node with the same bicycle and lesser distance. And if it is even possible, my answer is lesser than jury, that's another puzzle. |
|
0
I appreciate, But I would like to know, why my solution fails ?! Any counter test case that you can think of ?! |
|
0
Hmmm, cool |
|
0
https://ideone.com/Ypu1s1 My code assumes that you have to flip only 2 elements, isn't that incomplete ?! Still I got AC. Help. |
|
0
Analyze mine and then that of the rainboy. |
|
+1
It has to be the Delta Encoding ! |
|
+7
Problem with the MODE was really interesting! |
|
0
Nice bro, you got a kool mindset. |
|
0
Nahh, but my comment on one of the blogs about changing PFP every day for December got heavily down voted... I just posted the picture of sir Lionel Andreas Messi and sir Christiano Ronaldo who were playing chess. |
|
+4
Y'all are freaking ratists. |
|
-15
Try this, It is fire! |
|
+25
You ate 5 STAR maybe... |
|
+3
Hey ladies and gentlemen, this is my code for verifying how the dynamics of the C's solution work https://www.ideone.com/fQB1zU and following is the submission link of the AC verdict for the corresponding Que' https://mirror.codeforces.com/contest/2040/submission/295645589 hope you understand it, if not, ping me back freely! |
|
0
Oh |
|
0
++ |
|
0
I did one contest and it was a nice experience, but when I tried to make 2nd contest, even if I enter the contest level, it says "Please Select Contest Level". Help! |
|
0
Please take a look at my submission and try to check what is wrong in the code, what test case it might be failing ?! Any help would be highly appreciated, trust me, it would really be! https://mirror.codeforces.com/contest/2039/submission/293983985 |
|
0
As a participant, I will participate! BTW, what watch are you wearing, sir ?! ArshiaDadras |
|
+5
As a participant, I'll participate! |
|
0
Thank you! And as long as I remember, you were also in the top 10 contributors for a long long time right?! What about Codeforces profile having a graph which will represent the contribution history as well ?! Would it be great?! |
|
0
yotta fast edito' Thankkyou |
|
+10
The picture in the post brings back memories of the song "Close to the Sun" by TheFatRat. It takes me right back to high school days, when the line between passing time and wasting it was just a little blurrier. Feel free to give it a listen if you're in the mood: https://www.youtube.com/watch?v=oJuGlqO85YI Thanks for the nostalgia boost! |
|
+8
As a participant, I read all the comments and wondered why only one peng' has orange beak and why are the 2 rubik's cubes having 2 different "**shades of green**" ?! |
|
0
As a participant, I read all the comments! |
|
0
Ohk, thank you! |
|
0
Ummm, what is MHC R3 ?! |
|
0
Inspiring! |
|
0
Yo, this guy's my senior at the college and he freakin' wants to be unrated! |
|
0
Ummm, No, didn't know that such thing existed, but my good name is Tanishq, it kinda sounds like TanX, maybe...Yes! |
|
0
C was tooo gorgeous... Gave it the attempt of my life on Codeforces... Learnt a lot, it was like an adventure... Thank you contest×codeforces |
|
0
OMG round developer's first reply on my comment... happy to see... BTW Can D be solved with the same kind of logic for CSES Movie Festival ?! |
|
0
how is editorial even published 4 days ago?! |
|
-65
That I don't know, I just know, if tourist will be there, He'll win* *dominate The CHAD... |
|
-11
someone upvoted Mike's post and downvoted mine, SEDLYF |
|
-8
Auto comment: topic has been updated by Titan493ASST (previous revision, new revision, compare). |
|
0
I appreciate, Would like to know the reason! |
|
On
GGapa →
What can you do when you have an idea for a question during the contest but you can't work it out., 20 months ago
0
bro, source code please |
