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...
→ Обратите внимание
До соревнования
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 27.11.2024 03:41:15 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
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.