| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
Today i tried to solve this problem
the simplified version of the problem is no ways of assigning 2 different objects in n different places. so in this problem 2 different objects are carrot and baby carrot. we are given no of places
we have to print no ways of plant this two different carrots in n places .
how to solve this ?
Number of spanning trees in complete bipartite graph GX, Y is : XY - 1 × YX - 1
X : is the number of nodes in the first set.
Y : is the number of nodes in the second set.
Reference
Now you should sum the answer of every (X,Y)
x = 1, y=n-1
x = 2, y=n-2
...
then multiply it by the number of permutations which is equal to n! because you have n item and all of then are distinguishable.