I don’t get it, man. I can only solve very very basic recursion problems, but when I encounter problems like Tower of Hanoi or Josephus, my brain melts. I kind of understand what I need to do, but I have trouble translating that into recursive code.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
I don’t get it, man. I can only solve very very basic recursion problems, but when I encounter problems like Tower of Hanoi or Josephus, my brain melts. I kind of understand what I need to do, but I have trouble translating that into recursive code.
Name |
---|
same that is the reason too that I am not able to solve dp problems
practice makes perfect.
where can i practice?
im Currently solving this — https://codeforces.net/group/MWSDmqGsZm/contest/223339
practice a lot. it is interesting.
By spelling it correctly :)
didn't work :(
Go through this blog
Auto comment: topic has been updated by Ryuuji_Nakamura (previous revision, new revision, compare).