# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3904 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3494 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | maroonrk | 3350 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
1 | cry | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 159 |
5 | awoo | 158 |
6 | adamant | 157 |
7 | -is-this-fft- | 156 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
How to solve This problem using FFT ?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | darkworld1 | 2020-07-22 13:55:50 | 4 | Tiny change: 'ty is n(long)^2. Here ' -> 'ty is n(log(n))^2. Here ' | ||
en1 | darkworld1 | 2020-07-22 13:55:07 | 442 | Initial revision (published) |
Name |
---|