Hello , suggest any problem (or set of problems) that can be solved using recursion and it's grid based , problems like go from s to e , or find the shortest path .... etc
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hello , suggest any problem (or set of problems) that can be solved using recursion and it's grid based , problems like go from s to e , or find the shortest path .... etc
Name |
---|
https://codeforces.me/contest/1811/problem/D
thanks
If you are looking for a standard problem set I recommend looking at Graph Algorithms inside CSES's problem set.
Here are some problems from that set that are grid based:
yeah , i will take a look at them , thanks
USACO flood fill
pretty nice , thanks
contest dp atcoder, https://atcoder.jp/contests/dp
good luck!
CSES queens and chess