Can anyone please tell me the process how to solve this problem . Thanx in advance :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can anyone please tell me the process how to solve this problem . Thanx in advance :)
Название |
---|
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.