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 | 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 | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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
→
Ответить
|
Название |
---|