→ Pay attention
Before contest
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
2 days
Register now »
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
2 days
Register now »
*has extra registration
→ Top rated
| # | 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 |
→ Top contributors
| # | 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 | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/15/2026 06:41:54 (g2).
Desktop version, switch to mobile version.
Supported by
what is the solution to the problem C Golf Bot
Fast Fourier Transform :) though 1 of the 2 that solved it during SWERC, did O(n^2) with a very small constant (I think they used int's as bitmasks)
That's true. Our priority was to make it fair between C/C++ and Java, but -O2 and bitwise operations are a killer.
Are you competing this year?
Yes, I am, with angargo (as last year) and albertnez, new member of UPC-1; dirbaio reached the 2 WF limit last year.
Cool, I'll see you there then :)
Good luck!