Problem Description
One day, a team of archaeologists found a figure and some ancient charactors at a relique. The figure was made up of n points distributing on a circle symmetrically.
After investigating the charactors, they got to know that a treasure was hid beneath the figure. In order to open the door to the treasure, they must redraw all the lines between any two points in the figure with some colors. If the figure was right, the door would open.
Now they want to know how many times they have to try at most to open the door, and they ask you for help.

Input
Each test case contains an integer n and a string S in a line. n is the number of points in the figure and S is a string made up of distinct capital letters, each indicating a color that can be used to redraw the figure. 3 <= n <= 50.

Output
Each case outputs the maximum times they may try in one line. Note that two figures are considered the same if one can be obtained by having rotation and mirroring on the other one.

Sample Input
3 BW
3 RGB
4 RG

Sample Output
4
10

## 19

• 写回答

#### 1条回答默认 最新

• threenewbee 2017-07-27 15:41
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

#### 悬赏问题

• ¥15 怎么制作一个人脸识别门禁系统
• ¥20 大华dss监控平台网络关闭登不进去
• ¥15 请使用蚁群算法解决下列问题，并给出我完整的代码
• ¥20 关于php录入完成后，批量更新数据库
• ¥15 请教往复密封润滑问题
• ¥15 cocos creator发布ios包
• ¥15 comsol压电材料数据
• ¥35 用python实现除法算法中goldschmidt算法
• ¥15 汇编代码转换成C代码
• ¥15 除法算法中的归一化具体是怎么变的？