1st we have a array of n element.
There are two types of query.
1<=r<=l<=n and D. 1<=D<=10^9 we have to add D between r to l.
1<=r<=l<=n and X. 1<=D<=10^9 .how many numbers are divisible D in r to l?
How to build segment tree for this ques.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Range query divisible by x
1st we have a array of n element.
There are two types of query.
1<=r<=l<=n and D. 1<=D<=10^9 we have to add D between r to l.
1<=r<=l<=n and X. 1<=D<=10^9 .how many numbers are divisible D in r to l?
How to build segment tree for this ques.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | YoyOyoYOy000y000 | 2018-06-01 10:58:57 | 13 | |||
en1 | YoyOyoYOy000y000 | 2018-06-01 10:58:03 | 277 | Initial revision (published) |
Название |
---|