Given an undirected graph with $$$N$$$ vertices and $$$M$$$ edges, count the number of simple paths that consist of exactly $$$7$$$ vertices.
Constraints: $$$N \leq 100 $$$ $$$M \leq \frac{N \cdot (N - 1)}{2}$$$
UPD: I've solved it by myself
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Can you help with a problem
Given an undirected graph with $$$N$$$ vertices and $$$M$$$ edges, count the number of simple paths that consist of exactly $$$7$$$ vertices.
Constraints: $$$N \leq 100 $$$ $$$M \leq \frac{N \cdot (N - 1)}{2}$$$
UPD: I've solved it by myself
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | Art.twink | 2024-04-01 13:55:06 | 722 | |||
en3 | Art.twink | 2024-04-01 12:26:30 | 3 | Tiny change: '\n\nUPD: I solved it' -> '\n\nUPD: I've solved it' | ||
en2 | Art.twink | 2024-04-01 12:25:57 | 30 | Tiny change: ' - 1)}{2}$' -> ' - 1)}{2}$\n\nUPD: I solved it by myself' | ||
en1 | Art.twink | 2024-04-01 10:53:19 | 223 | Initial revision (published) |
Name |
---|