These days there are tons of problems on string transformation. I don't know any particular way to solve them... sometimes guessing works but surely that's not a good way. So I was wondering if there is any general method to attempt such problems, please share.
→ Обратите внимание
До соревнования
Codeforces Round #956 (Div. 2) and ByteRace 2024
33:20:03
Зарегистрироваться »
Codeforces Round #956 (Div. 2) and ByteRace 2024
33:20:03
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | adamant | 160 |
| 3 | maomao90 | 159 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 148 |
| 7 | SecondThread | 147 |
| 7 | atcoder_official | 147 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 06.07.2024 08:14:57 (f1).
Десктопная версия, переключиться на мобильную.
При поддержке
One of methods is connected with graphs. Try to depict letters as vertices and connections between them as nodes. Then run bfs/dfs and in many cases it's enough to solve 1500-1600 difficulties problems.
Thank you very much. Is there any source on which I can understand it better..
https://mirror.codeforces.com
Well, you can try these tasks, based on dsu and topological sort, hidden behind strings, which are extremely important techniques: 510C - Fox And Names, 638B - Making Genome in Berland, 939D - Love Rescue, 1384C - String Transformation 1