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.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/05/2024 09:50:47 (l3).
Desktop version, switch to mobile version.
Supported by
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://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