№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3741 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3489 |
7 | Radewoosh | 3483 |
8 | Kevin114514 | 3442 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
2 | atcoder_official | 162 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | nor | 150 |
Название |
---|
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.