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.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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
Name |
---|