→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Comments
|
0
how is time complexity of 484B -Maximum Value calculated |
|
0
same story got 1 wa because of that |
|
0
thanks, this gives me redirect loop error in chrome but works in firefox... might be some cookie problem or something !!! |
|
0
are the contest problem available in english also ?? |
|
0
me too hacked 12 with same |
|
0
why is this if k>=4 and k^2=p1*p2+1 than k must be even and k-1 and k+1 must be primes,I dont understand the theorem you used.can you please explain... |
|
0
Hi, I know this is not the best place to put this but please see the people in cf-191 standings at position 82.84,85,86 highly suspicious names and solution timings |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/24/2026 06:52:46 (l2).
Desktop version, switch to mobile version.
Supported by
