№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
Название |
---|
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!