Hi!;
i am trying to solve this problem KPMAZE-Maze on spoj .. which i could summarize to count the number of spanning trees in a small graph (at most 25 nodes)...
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
need help with a kirchhoff's theorem
Hi!;
i am trying to solve this problem KPMAZE-Maze on spoj .. which i could summarize to count the number of spanning trees in a small graph (at most 25 nodes)...
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | Mohamed.Sobhy | 2018-12-09 22:48:16 | 63 | (published) | ||
en2 | Mohamed.Sobhy | 2018-12-09 22:46:59 | 104 | |||
en1 | Mohamed.Sobhy | 2018-12-09 22:41:55 | 242 | Initial revision (saved to drafts) |
Name |
---|