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.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3857 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 160 |
| 3 | Dominater069 | 160 |
| 5 | atcoder_official | 158 |
| 6 | adamant | 155 |
| 7 | Um_nik | 152 |
| 8 | djm03178 | 151 |
| 8 | luogu_official | 151 |
| 10 | awoo | 148 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Mar/10/2025 06:57:33 (j3).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by YoyOyoYOy000y000 (previous revision, new revision, compare).