- You have to make an array of n elements where the summation of any SUBARRAY won't be divisible by m (n > m). Is it possible? If not then proof?
- You have to make an array of n elements where the summation of any SUBSET won't be divisible by m (n > m). Is it possible? If not then proof? for simplicity: 1 <= n, m <= 100000
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 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 | 171 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 07.06.2024 13:07:37 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by void.abyss (previous revision, new revision, compare).
It is impossible. Consider remainders of the prefix sums of the array. There are at least two that are same, since m < n.
So basically 2 is also not possible?
Yes
http://matcomgrader.com/problem/5777/regalos/
Here is the problem in Spanish. If you are too lazy to translate it notice that in the first line you are given $$$n$$$ and $$$m$$$. You should find index of the values such that their sum is divisible by $$$m+1$$$