CF 6A Triangle (判断三角形)

小咪咪 2022-08-23 05:39 123阅读 0赞

A. Triangle

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

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

题目大意：有四个线段问能否构成面积为正的三角形，若能则输出TRIANGLE；能否构成面积为0的三角形（两边之和等于第三边），若能则输出SEGMENT；若都不能则输出IMPOSSIBLE。

在网上看到的这个题，哪里有面积为0的三角形呢，真是神奇。

Code1：

#include <iostream>  
    #include <algorithm>  
    #include <cstdio>  
    using namespace std;  
    int main()  
    {  
        int a[4];  
        for(int i=0;i<4;i++)  
            cin>>a[i];  
        sort(a,a+4);  
        for(int i=0;i<2;i++)  
            if(a[i]+a[i+1]>a[i+2])  
                return 0*printf("TRIANGLE");  
        for(int i=0;i<2;i++)  
            if(a[i]+a[i+1]==a[i+2])  
                return 0*printf("SEGMENT");  
        return 0*printf("IMPOSSIBLE");  
    }

Code2：

#include <iostream>  
    #include <stdio.h>  
    using namespace std;  
      
    int main()  
    {  
        int a[10];  
        scanf("%d%d%d%d",&a[1],&a[2],&a[3],&a[4]);  
        int b[10];  
        int f=0,ff=0;  
        for(int i=1;i<=4;i++)  
        {  
            int t=1;  
            for(int j=1;j<=4;j++)  
            {  
                if(i==j)  
                    continue;  
                b[t++]=a[j];  
            }  
            if(b[1]+b[2]>b[3]&&b[1]+b[3]>b[2]&&b[2]+b[3]>b[1])  
            {  
                f=1;  
                break;  
            }  
            if(b[1]+b[2]==b[3]||b[1]+b[3]==b[2]||b[2]+b[3]==b[1])  
                ff=1;  
        }  
        if(f)  
            printf("TRIANGLE\n");  
        else if(ff)  
            printf("SEGMENT\n");  
        else  
            printf("IMPOSSIBLE\n");  
        return 0;  
    }