|
0
I wonder if there are any problems that can be solve with this |
|
0
orz |
|
0
I also use this solution as I'm desperate. If anyone know how this solution works and prove it please tell me!!! |
|
0
just wait for a few days, als why do you need the rating of a problem anyways? |
|
0
thought you did? also hi Fake S |
|
0
https://mirror.codeforces.com/profile/Lukauru just curious |
|
+3
congrat a oi |
|
0
Why is c and D soo hard Good and interesting problems, definitely learned something through the contest |
|
0
You're at rank 6525 |
|
0
you can find you standings in the friends' standing, see your standing, then search for the range of standings that you are in THEN search you name |
|
0
Good contest, Really hope I can break the 1200 rating barrier after this contest |
|
0
Cope with it |
|
0
pow() is incredibly inaccurate, please do not use it |
|
0
Hello, during the contest I submitted this code which got accepted, but after that my code go from accepted to "In queue", can anyone explain? Thank you Here's the link to the code: https://mirror.codeforces.com/contest/1850/submission/214905784 |
|
0
me too lulul |
|
0
I lost so much time on overflow prevention I have to use long double so my brain didn't get fried |
|
0
The most fun contest I've had in a while. Can't solve much problem in Div.3 so when I got 5 problems in this contest I feel somewhat awarding about my learning progress hehe. |
|
0
I gotta say the B problem gave me a stroke |
|
0
The solution for the 1324C — Frog Jumps is the longest L continuous string plus 1, its not that complicate |