How can i solve this problem
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 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