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 | 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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
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