POJ 1244 Slots of Fun

POJ 1244 Slots of Fun

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!

题目的大意就是要判断输入中字母相同且构成等边三角形三点的字母有哪些，
等边三角形等边三角形，就是三边相等就行了，数据也小，直接暴力就行，最主要的问题是求两点间的距离，这里可以把整个三角形就是一个60°的斜坐标系，推一下斜坐标系两点距离就可以了

坐标系.png

然后到这里就把ab的距离求出来了，直接暴力判断三点距离相等就行了

#include
#include
using namespace std;
char record[13][13];
int zmnum[26];
int zm[26][4][2];
int result[26];
int getdis(int x1,int x2,int y1,int y2){
    return (x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-(x2-x1)*(y2-y1);
}
int main(){
    int n;
    while(cin>>n&&n){
        memset(result,0,sizeof(result));
        memset(zm,0,sizeof(zm));
        memset(zmnum,0,sizeof(zmnum));
        for(int i=0;i>record[i][j];
            }
        }
        if(n==1){
            cout<<"LOOOOOOOOSER!"<