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 | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 151 |
10 | awoo | 147 |
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
|
14 years ago,
#
|
←
Rev. 2
→
![]() ![]() You should use Burnside's lemma (this is a copy of my previous post in English interface)
→
Reply
|
![]() Verdona0
|
13 years ago,
#
|
←
Rev. 2
→
![]() ![]()
→
Reply
|
Name |
---|