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 | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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