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.
# | 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 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | YoyOyoYOy000y000 | 2018-06-01 10:58:57 | 13 | |||
en1 | YoyOyoYOy000y000 | 2018-06-01 10:58:03 | 277 | Initial revision (published) |
Name |
---|