Given k alphabets and a length of n, find how many unique strings can be formed using these k alphabets of length n. Two strings are considered same if one can be obtained from through rotation or through reversing.
# | 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 |
8 | awoo | 154 |
10 | luogu_official | 151 |
Burnside's Lemma Problem
Given k alphabets and a length of n, find how many unique strings can be formed using these k alphabets of length n. Two strings are considered same if one can be obtained from through rotation or through reversing.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | maqsud13101033 | 2017-03-14 02:03:35 | 8 | Tiny change: 'ined from through r' -> 'ined from another through r' | ||
en1 | maqsud13101033 | 2017-03-14 01:59:29 | 239 | Initial revision (published) |
Name |
---|