codeforce 6A
来源:互联网 发布:数控g92带图编程实例 编辑:程序博客网 时间:2024/06/08 04:04
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
/*题意:四条边选3个能构成三角形就输出,TRIANGLE, 两边之和等于第三边的输出segment,不能的impossible。*/
/*思路:排序,那么能构成三角形的只有两种情况,segment的也只有两种情况,剩下就是不能的*/
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int main(){ int a[4]; while(scanf("%d%d%d%d", &a[0], &a[1], &a[2], &a[3]) != EOF){ sort(a, a + 4); if(a[0] + a[1] > a[2] || a[1] + a[2] > a[3]){ printf("TRIANGLE\n"); continue; } else if(a[0] + a[1] == a[2] || a[1] + a[2] == a[3]){ printf("SEGMENT\n"); continue; } else printf("IMPOSSIBLE\n"); } return 0;}
- codeforce 6A
- codeforce 6A
- Codeforce A
- Codeforce # A Plug-in
- codeforce 2A Winner
- Contest on codeforce A
- codeforce 11 04 A
- codeforce小水题--A. Presents
- Codeforce #145A Cinema
- codeforce日记 371A
- CodeForce 393A Nineteen
- codeforce 402A - Nuts
- Codeforce A. Milking cows
- codeforce 427A
- codeforce 433A
- codeforce 7A
- codeforce 9A
- codeforce 10A
- Ubuntu使用教程:无法获得锁 /var/lib/apt/lists/lock
- ubuntu12.04-server设置静态IP
- spark数据导入、处理实例
- 大话设计模式-初夜
- Object方法简介
- codeforce 6A
- Linux 重启命令
- 第一小项目(python磁盘空间不足QQ邮箱报警0.0001)
- Netty 入门笔记
- POJ 1178 Camelot 笔记
- 减至法解题的经典题型
- 第25章 系统的频域分析及其应用
- 基于UML的需求分析和系统设计(完整案例和UML图形演示)
- tomcat配置优化