How to find the number of pairs of integers (x,y) such that gcd(x,y) = 1?
n<=1e6
x<y<=n
time limit = 2s
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3885 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3580 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3506 |
| 7 | ecnerwala | 3505 |
| 8 | Radewoosh | 3457 |
| 9 | Kevin114514 | 3377 |
| 10 | gamegame | 3374 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | atcoder_official | 161 |
| 4 | maomao90 | 158 |
| 4 | -is-this-fft- | 158 |
| 6 | djm03178 | 157 |
| 7 | Dominater069 | 156 |
| 8 | adamant | 154 |
| 9 | luogu_official | 153 |
| 10 | awoo | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/30/2024 19:07:48 (j1).
Desktop version, switch to mobile version.
Supported by
