How can i solve this problem
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
How can i solve this problem
Name |
---|
To solve this problem we should use dynamic programming; States will be [last vertex][mask for vertexes];
At every moment we will pick vertex which connected to our last vertex;
And if last vertex is already connected with starting vertex and if we already have at least 3 vertexes in our mask, we should add 1 to answer of this state;
Answer of current state will be d[next vertex][mask + next vertex]
Answer will be d[starting vertex][mask + starting vertex]
Here is my code for better understanding
Can you please illustrate it with an example.Consider the given test case example of problem