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
Before contest
Codeforces Round 940 (Div. 2) and CodeCraft-23
2 days
Register now »
Codeforces Round 940 (Div. 2) and CodeCraft-23
2 days
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/19/2024 12:51:59 (k3).
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