Hello community,
Recently, I was trying to solve 156C - Cipher . After a lot of tries , I couldn't get anywhere.
Further there is no english editorial for the same too and I couldn't get it exactly through the codes.
Kindly help .
Thanks in advance .
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 14.11.2024 07:57:01 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
Two words coincide in their meaning iff their sum and length is equal. Then it's easy to solve this problem using this fact, but I don't know how to prove it.
Yups but how is it proven ?
Let's say there are N buckets numbered from 1 to N. Each bucket initially contains B_i balls. In each move, you can select any bucket, take a ball from it and place it on any of its adjacent buckets. However there cannot be more than 25 balls in any bucket at any moment. How many different combinations are possible given that you have infinite number of moves?
It's easier to visualize and I think the proof is kind of obvious if you re-formulate the problem like this.