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
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 150 |
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 years ago,
#
|
←
Rev. 2
→
0
You should use Burnside's lemma (this is a copy of my previous post in English interface)
→
Reply
|
Verdona0
|
13 years ago,
#
|
←
Rev. 2
→
0
→
Reply
|
Name |
---|