Find The Number Of Common Divisors That Are Greater Than 1 Of All SubArrays N<=1e5,2<=ai<=1e5 Ans Mod 1e9+7 First TestCase : 3
2 10 15 , Ans = 9
Second TestCase : 6
3 6 11 22 44 2 , Ans = 22
Thanks In Advance
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | AmShZ | 142 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 134 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
HaveYouEverOrNever | 2023-02-22 01:14:20 | 4 | ||
| en1 |
|
HaveYouEverOrNever | 2023-02-22 01:12:42 | 258 | Initial revision (published) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/06/2026 08:00:02 (g2).
Desktop version, switch to mobile version.
Supported by
