CF 6A——比赛 I - Triangle

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 test(s)

input

4 2 1 3

output

TRIANGLE

input

7 2 2 4

output

SEGMENT

input

3 5 9 1

output

IMPOSSIBLE

题目分析：大意：有四根棒，利用其中三根，问是否可以构成三角形，或者退化三角形，或者不能够构造成三角形。输出规则自己看；

思路：先设两个判断变量，flag1和flag2=0，如果能构造三角形，flag1=1,如果能构造退化三角形，flag2=1;     

能形成三角形的条件是：三条边中较短的两条边的和大于第三边；     

能形成退化三角的条件是：三条边中较短的两条边的和等于第三边；

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int a[4];
    int max1,max2,min1,min2;
    int flag1=0,flag2=0;
    for(int i=0; i<4; i++)
        cin>>a[i];
    sort(a,a+4);
    max1=a[3];
    max2=a[2];
    min1=a[1];
    min2=a[0];
    if(min2+min1>max2||min2+min1>max1||min2+max2>max1||min1+max2>max1)
        flag1=1;
    if(min2+min1==max2||min2+min1==max1||min2+max2==max1||min1+max2==max1)
        flag2=1;
        //cout<<min2<<min1<<max2<<max1<<endl;
    if(flag1)
        cout<<"TRIANGLE"<<endl;
    else if(flag2)
        cout<<"SEGMENT"<<endl;
    else
        cout<<"IMPOSSIBLE"<<endl;
    return 0;
}