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.
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 | jiangly | 3845 |
| 2 | tourist | 3798 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3589 |
| 6 | Ormlis | 3532 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 10 | Um_nik | 3450 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | Qingyu | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 149 |
| 9 | awoo | 147 |
| 10 | TheScrasse | 145 |
Auto comment: topic has been updated by YoyOyoYOy000y000 (previous revision, new revision, compare).