CodeForces 18A Triangle (几何)

Description

At a geometry lesson Bob learnt that a triangle is called right-angled if it is nondegenerate and one of its angles is right. Bob decided to draw such a triangle immediately: on a sheet of paper he drew three points with integer coordinates, and joined them with segments of straight lines, then he showed the triangle to Peter. Peter said that Bob's triangle is not right-angled, but is almost right-angled: the triangle itself is not right-angled, but it is possible to move one of the points exactly by distance 1 so, that all the coordinates remain integer, and the triangle become right-angled. Bob asks you to help him and find out if Peter tricks him. By the given coordinates of the triangle you should find out if it is right-angled, almost right-angled, or neither of these.

Input

The first input line contains 6 space-separated integers x₁, y₁, x₂, y₂, x₃, y₃ — coordinates of the triangle's vertices. All the coordinates are integer and don't exceed 100 in absolute value. It's guaranteed that the triangle is nondegenerate, i.e. its total area is not zero.

Output

If the given triangle is right-angled, output RIGHT, if it is almost right-angled, output ALMOST, and if it is neither of these, outputNEITHER.

Sample Input

Input

0 0 2 0 0 1

Output

RIGHT

Input

2 3 4 5 6 6

Output

NEITHER

Input

-1 0 2 0 0 1

Output

ALMOST

水几何，判直角就OK

#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long LL;
struct point
{
    int x,y;
}a[4],b[4];
int fx[]={0,0,-1,1};
int fy[]={1,-1,0,0};
int dis(point a,point b)
{
    return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
int can(point x,point y,point z)
{
    int d[4];
    d[0]=dis(x,y);
    d[1]=dis(y,z);
    d[2]=dis(x,z);
    sort(d,d+3);
    if(d[0]==0) return 0;
    if(d[2]==d[1]+d[0]) return 1;
    return 0;
}
int main()
{
    int i,j,k,T;
    while(scanf("%d%d%d%d%d%d",&a[1].x,&a[1].y,&a[2].x,&a[2].y,&a[3].x,&a[3].y)!=EOF)
    {
        if(can(a[1],a[2],a[3]))
        {
            printf("RIGHT\n");
            continue;
        }
        int flag=0;
        for(i=1;i<=3;i++)
        {
            for(j=0;j<4;j++)
            {
                for(k=1;k<=3;k++)
                    b[k]=a[k];
                b[i].x=b[i].x+fx[j];
                b[i].y=b[i].y+fy[j];
                if(can(b[1],b[2],b[3])) flag=1;
            }
        }
        if(flag) printf("ALMOST\n");
        else printf("NEITHER\n");
    }
    return 0;
}