How can i solve this problem
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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