# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
Name |
---|
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!