| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
I think this blog can compensate the editorial till it comes out. |
|
0
how can be solved using Meet in the middle ? |
|
0
yes exactly :'''''( |
|
+2
MikeMirzayanov can you help me :( ?? I still didn't solved the issue |
|
0
you wanna count all pair such that their product is below their G to validate whether G is the answer or not. |
|
0
I think you've forgotten to multiply by the depth , am I wrong :/ ? so you should write N^4 |
|
+3
wow! , your solution is very interesting thanks <3 !!! |
|
+13
|
|
+5
finally AC , Big Thanks IgorSmirnov , you're great debugger by the way :) |
|
0
I'm sorry tooo :(( , but i went to WA on test case 6 lool here |
|
0
I think nope :/ because i compare two strings with each others so i used lst = i (the first position before the beginning of the last string) so i am getting its end with lst + size |
|
0
Ohh I thought that this operation works in O(1) but you made it clear to me :) but there's another mistake somewhere :''( , I got WA on test case 5 too |
|
0
guys i still struggling to get AC :( , if someone can help me I got WA on test case 5 and my solution works in O(|Needed String|) |
|
0
yes :/ |
|
0
IgorSmirnov can you help me :/ ? I got WA on test case 5 while my algorithm works in linear time O(|Size of needed string|) that's good enough |
|
+28
WHEN YOU FOUND A SOLUTION FOR PROBLEM B AND CODEFORCES SAYS TO YOU "CONTEST IS OVER" |
|
+4
what's wrong !!?
|
|
+3
guys is that site is true ?! http://cfpredictor.us-west-2.elasticbeanstalk.com/roundResults.jsp?contestId=766 |
|
+9
recursion style |
|
On
Baba →
CodeCraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined) Announcement, 10 years ago
-26
tourist again :( ! |
|
0
try this site 100 % math problems https://projecteuler.net/ |
|
0
Thanks :) ! |
|
0
i think so :/ , but i need to change my rating :"( |
|
-24
I wish the time of the contest will be any time instead of breakfast time for muslims people in ramadan :/ , there is many contest in this time , can any one who will create a new contest can make it any time but not in our breakfast time ?, i think there is many Programmers will join it |
|
+11
all newbie people need that :'( |
|
0
can i join if my age is less than 18 (i am in school not university) ? |
|
+7
i think the magic color will not change before 10/1 but your rating will change after the contest |
|
-17
this contest will be amazing ☺ ! |
| Name |
|---|


