The International Betting Machine company has just issued a new type of slot machine. The machine display consists of a set of identical circles placed in a triangular shape. An example with four rows is shown below. When the player pulls the lever, the machine places a random letter in the center of each circle. The machine pays off whenever any set of identical letters form the vertices of an equilateral triangle. In the example below, the letters 'a' and 'c' satisfy this condition.
In order to prevent too many payoffs, the electronics in the machine ensures that no more than 3 of any letter will appear in any display configuration.
IBM is manufacturing several models of this machine, with varying number of rows in the display, and they are having trouble writing code to identify winning configurations. Your job is to write that code.
Input
Input will consist of multiple problem instances. Each instance will start with an integer n indicating the number of rows in the display. The next line will contain n(n + 1)/2 letters of the alphabet (all lowercase) which are to be stored in the display row-wise, starting from the top. For example, the display above would be specified as
4
abccddadca
The value of n will be between 1 and 12, inclusive. A line with a single 0 will terminate input.
Output
For each problem instance, output all letters which form equilateral triangles on a single line, in alphabetical order. If no such letters exist, output "LOOOOOOOOSER!".
Sample Input
4
abccddadca
6
azdefccrhijrrmznzocpq
2
abc
0
Sample Output
ac
crz
LOOOOOOOOSER!
Source: East Central North America 2002
纠结了,这题我也说不清用了啥算法……
题意,给一个正三角形,一共有n行,第i行有i个字母(小写的哦),其中的三个元素有可能构成一个正三角形,并且这三个点的字母相同,求这样的字母,按字典序排列……
最多12行,不解释,暴力没商量,这里求两个点的距离的时候用到了一个小知识,用三维坐标记录每个点的位置,这样两个点的距离就是三维之间查最大的那个的值(max(map[a].x-map[b].x,map[a].y-map[b].y,map[a].z-map[b].z))
代码:
#include<math.h>
#include<stdlib.h>
struct node {
} map [ 80 ];
int cmp( const void * a , const void *b)
{
}
int match( int a , int b)
{
}
int distance( int a , int b)
{
}
int main()
{
}