Hi, please provide an algorithm for this question: Click
I am trying it from long time but couldn't reach a proper algo.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Hi, please provide an algorithm for this question: Click
I am trying it from long time but couldn't reach a proper algo.
Name |
---|
The number of possible paths is 2*(n*(n-1)+2), so you can solve it by brute force
Can you explain how you got this number?
Okay I got it, just confirming:
For each vertex in one row there are N-1 vertices that end the Hamiltonian path.
Plus for vertex 1 and N there are N ways so that 2.
As there are 2 rows so finally multiplied by 2.
yes, i got this number in that way too