# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
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!