# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Name |
---|
In fact there are many generalizations of Cayley theorem (though I didn't know that particular one).
One was given as a problem on Putnam competition one year ago: http://www.artofproblemsolving.com/Forum/viewtopic.php?p=3315688&sid=56608f6bc111f1ce8bcfb33ff1220ce3#p3315688
Here is another one I know. Assume that we want to compute number of forests on n vertices with k trees such that vertices with indiced 1, ..., n belong to other trees. Then number of them is equal to knn - k - 1.
Despite the fact that there are many of them I always got problems even with proving basic version :p.