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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 161 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Find user
→ Recent actions
Range query divisible by x
Revision en2, by YoyOyoYOy000y000, 2018-06-01 10:58:57
History
Revisions
| 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) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/11/2026 14:55:07 (g2).
Desktop version, switch to mobile version.
Supported by
