| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
How to solve spoj COPSEQ?
Problem link: here
The best way I could think of right now is factorizing using pollard rho and then do O(N*D) dp where D is number of divisors. Problem is D can be up to almost 10^5 for some highly composite numbers. Any help is appreciated, thanks!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Nanami_chan | 2018-08-08 04:15:15 | 369 | Tiny change: 'ersion):\nGiven $n <= 10^5\n' -> 'ersion):\n\nGiven **n** <= 10^5\n' | |
| en3 |
|
Nanami_chan | 2018-08-07 17:28:13 | 33 | Tiny change: 'em link: [here](https' -> 'em link: [Here](https' | |
| en2 |
|
Nanami_chan | 2018-08-07 17:26:47 | 322 | ||
| en1 |
|
Nanami_chan | 2018-08-07 04:30:37 | 320 | Initial revision (published) |
