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 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
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.