1st we have a array of n element. ↵
↵
tThere 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?↵
h↵
How to build segment tree for this ques.
↵
↵
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.
