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 | 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 | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 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 !