a)I have n zeros and m ones and I want to counting the number of circular permutation of this m+n numbers .
m<=50 and n<=50
b) I want to count the number of circular permutation of n zero and ones .
(number of zeros + number of ones = n)
n<=100
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
a)I have n zeros and m ones and I want to counting the number of circular permutation of this m+n numbers .
alexander.yuriev
|
13 лет назад,
#
|
0
You should use Burnside's lemma
→
Ответить
|
alexander.yuriev
|
13 лет назад,
#
|
←
Rev. 2
→
0
You should use Burnside's lemma (this is a copy of my previous post in English interface)
→
Ответить
|
Verdona0
|
13 лет назад,
#
|
←
Rev. 2
→
0
→
Ответить
|
Название |
---|