| # | 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 | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
How to solve this problem
Today I created this problem, idk maybe it exists somewhere
We have array of n numbers n <= 2e4, a[i] <= 1e6 And we have q queries q <= 2e4, 1 <= l <= r <= n
Initially we have subset with element a[l:r], we need to erase minimal number of elements from this subset so that gcd(subset) = 1 gcd of subset becomes 1
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| ru2 |
|
RetiredPlayer | 2020-08-04 00:14:16 | 20 | ||
| ru1 |
|
RetiredPlayer | 2020-08-03 23:04:29 | 766 | Первая редакция (опубликовано) |
