| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Auto comment: topic has been updated by adurysk (previous revision, new revision, compare).
Thanks , the blog is really quite interesting and informative.
Many such problems (including those two in the blogpost, if I'm not mistaken) can also be solved in sublinear time. It's cool and worth thinking about, so I encourage you to do so :).
Spoilers below in Section 2. http://www.mimuw.edu.pl/~pan/papers/farey-algorithmica.pdf
Can u tell how to calculate cnt2[d] and how to link it with no of pairs having i and j as multiple of it's gcd multiple?
The link is now broken, can you please share the post here? adurysk
Auto comment: topic has been updated by adurysk (previous revision, new revision, compare).