考古团队发现一个由n个点构成的圆形图案，每个点代表一种颜色，解开谜题需用这些颜色重新绘制所有连线。题目要求计算最糟糕情况下尝试打开宝藏门的次数。输入包含点数n和可用颜色字符串S，输出最大尝试次数。示例输入输出已给出。
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 t
订阅专栏 解锁全文
扫一扫
130
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
