| # | 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 | 150 |
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) |
