Codeforces Beta Round #6 (Div. 2 Only) A. Triangle 水题

A. Triangle

题目连接：

http://codeforces.com/contest/6/problem/A

Description

Johnny has a younger sister Anne, who is very clever and smart. As she came home from the kindergarten, she told his brother about the task that her kindergartener asked her to solve. The task was just to construct a triangle out of four sticks of different colours. Naturally, one of the sticks is extra. It is not allowed to break the sticks or use their partial length. Anne has perfectly solved this task, now she is asking Johnny to do the same.

The boy answered that he would cope with it without any difficulty. However, after a while he found out that different tricky things can occur. It can happen that it is impossible to construct a triangle of a positive area, but it is possible to construct a degenerate triangle. It can be so, that it is impossible to construct a degenerate triangle even. As Johnny is very lazy, he does not want to consider such a big amount of cases, he asks you to help him.

Input

The first line of the input contains four space-separated positive integer numbers not exceeding 100 — lengthes of the sticks.

Output

Output TRIANGLE if it is possible to construct a non-degenerate triangle. Output SEGMENT if the first case cannot take place and it is possible to construct a degenerate triangle. Output IMPOSSIBLE if it is impossible to construct any triangle. Remember that you are to use three sticks. It is not allowed to break the sticks or use their partial length.

Sample Input

4 2 1 3

Sample Output

TRIANGLE

Hint

题意

给你四条边，然后让你选三个出来

首先问你选出来的能不能构成面积为正的三角形

如果不行，问你能不能组成面积为0的三角形

否则输出impossible

题解：

数据范围太小，直接瞎暴力吧……

代码

#include<bits/stdc++.h>
using namespace std;
int a[4];
int check(int x,int y,int z)
{
    if(x==y)return 0;
    if(y==z)return 0;
    if(x==z)return 0;
    x=a[x],y=a[y],z=a[z];
    if(x+y>z&&x+z>y&&y+z>x)return 2;
    if(x+y==z||y+z==x||x+z==y)return 1;
    return 0;
}
int main()
{
    for(int i=0;i<4;i++)
        cin>>a[i];
    for(int i=0;i<4;i++)
        for(int j=0;j<4;j++)
            for(int k=0;k<4;k++)
                if(check(i,j,k)==2)
                    return puts("TRIANGLE"),0;
    for(int i=0;i<4;i++)
        for(int j=0;j<4;j++)
            for(int k=0;k<4;k++)
                if(check(i,j,k)==1)
                    return puts("SEGMENT"),0;
    return puts("IMPOSSIBLE"),0;
}