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.
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) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
