Can anyone please tell me the process how to solve this problem . Thanx in advance :)
# | 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 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Can anyone please tell me the process how to solve this problem . Thanx in advance :)
Name |
---|
I don't know how to solve it using Inclusion-Exclusion. I have DP solution.
To compute cnt value in O(1) split dp array into c[i] arrays.
Array number x has elements with numbers { x, x + c[i], x + c[i] * 2... }.
cnt value is equal to sum of integers on some subarray of array number j % c[i].
You have to construct prefix-sum array for each array to cumpute it.