Hi everybody,
I need help.I've been looking the problem for hours.But i cant find my mistake.This is my awful solution.16437994.Could anyone explain what is my mistake and what should i do? Thanks...
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 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 |
Auto comment: topic has been updated by nemesis (previous revision, new revision, compare).
Variable divisorsCount is the number of divisors mod (MODULE — 1). By divisiorCount /= 2; you are trying to get half of number of divisors mod (MODULE — 1), which doesn't work. (MODULE — 1) is even, so remainder of 2x mod (MODULE — 1) is not enough to tell remainder of x mod (MODULE — 1). You can for example count divisorsCount mod 2 * (MODULE — 1), then the divisorCount /= 2; would work.