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 another through rotation or through reversing.
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 another through rotation or through reversing.
Can anyone help me provide a critical test case for this problem ?
my solution: http://ideone.com/JDfL7D
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 160 |
| 2 | Qingyu | 160 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 155 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 149 |
| 9 | awoo | 147 |
| 10 | Um_nik | 146 |
