1st we have a array of n element. there are two types of query. 1. 1<=r<=l<=n and D. 1<=D<=10^9 we have to add D between r to l. 2. 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.
Range query divisible by x
1st we have a array of n element. there are two types of query. 1. 1<=r<=l<=n and D. 1<=D<=10^9 we have to add D between r to l. 2. 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) |