# | 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- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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.