CodeForces - 6A Triangle【水题】

最新推荐文章于 2022-01-24 22:12:25 发布

invoKer-

最新推荐文章于 2022-01-24 22:12:25 发布

阅读量276

点赞数

CC 4.0 BY-SA版权

分类专栏： codeforces 水题

本文链接：https://blog.csdn.net/inv00ker/article/details/102161773

codeforces 同时被 2 个专栏收录

145 篇文章

订阅专栏

水题

93 篇文章

订阅专栏

面对幼儿园妹妹Anne的挑战，Johnny需要从四根不同颜色的棍子中选择三根来构造一个非退化的三角形。任务看似简单，实则充满了各种可能性与限制。本文将探讨如何通过编程解决这一问题，并提供了一个C++代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【题目描述】
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.

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

【输出】
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.

【样例输入】
4 2 1 3

【样例输出】
TRIANGLE

【样例输入】
7 2 2 4

【样例输出】
SEGMENT

【样例输入】
3 5 9 1

【样例输出】
IMPOSSIBLE

题目链接：https://codeforces.com/contest/6/problem/A

代码如下：

#include <bits/stdc++.h>
using namespace std;
int a,b,c,d;
int main()
{
    cin>>a>>b>>c>>d;
    if((a+b>c && a+c>b && b+c>a) || (a+b>d && a+d>b && b+d>a) || (a+c>d && a+d>c && c+d>a) || (b+c>d && b+d>c && c+d>b))
        cout<<"TRIANGLE"<<endl;
    else if(a+b==c || a+b==d || a+c==b || a+c==d || a+d==b || a+d==c || b+c==a || b+c==d || b+d==a || b+d==c || c+d==a || c+d==b)
        cout<<"SEGMENT"<<endl;
    else
        cout<<"IMPOSSIBLE"<<endl;
    return 0;
}