I don't find any solution idea for this problem . I am totally stuck in this problem . If anyone solve the problem , please give me the idea for this problem . Thanks in advance !
# | 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 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
I don't find any solution idea for this problem . I am totally stuck in this problem . If anyone solve the problem , please give me the idea for this problem . Thanks in advance !
Name |
---|
Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).
OP changed the question from HIGHWAY — > HIGH . This comment is uselss
can you explain your idea please . thanks !
Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).
I think the problem is just counting spanning trees
Any more good resources to understand the algorithm ? Thanks a lot for giving the link of algorithm .
Just try Googling "counting spanning trees," or "Kirchoff's theorem" and there are a lot of sources. Here's a proof, and here's how to find a determinant
Thanks a lot ! I will try my best to solve the problem .
Thanks a lot . Finally I solved the problem !