| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
TLE with an O(n sqrt(n))
I was solving this interesting number-theory + trees problem. And I came up with an 
solution where n ≤ 200000.
My idea is that the answer for every node will either be a factor of the root or be a factor of the number itself, and only these about 
values need to be tested.
The solution in the e
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
proofbycontradiction | 2018-12-06 11:06:47 | 214 | (published) | |
| en2 |
|
proofbycontradiction | 2018-12-06 10:57:24 | 814 | ||
| en1 |
|
proofbycontradiction | 2018-12-06 10:50:51 | 411 | Initial revision (saved to drafts) |
