CF 6A Triangle (判断能否构成三角形)
来源:互联网 发布:企业组织结构优化 编辑:程序博客网 时间:2024/06/05 02:03
Triangle
64-bit integer IO format: %I64d Java class name: (Any)
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
TRIANGLE
7 2 2 4
SEGMENT
3 5 9 1
IMPOSSIBLE
Source
q神不愧是q神,参考了他的代码.
AC代码:
#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");}
- CF 6A Triangle (判断能否构成三角形)
- CF 6A Triangle (判断三角形)
- 判断a,b,c的值能否构成一个三角形
- 判断三个顶点能否构成三角形
- 判断输入三条边能否构成三角形
- 判断输入三边能否构成三角形
- 判断能否构成三角形(异常处理)
- Java练习题15 判断能否构成三角形
- 输入三角形a,b,c的值判断其能否构成三角形并输出三角形的性质
- 如何判断三角形能否构成以及三角形的类型
- 输入三角形的三边值,判断能否构成三角形
- 判断输入的三角形边长能否构成三角形
- CF 6 A - Triangle
- cf 6a Triangle
- 简单的判断三个数能否构成三角形
- C语言程序题目--闰年判断,三边能否构成三角形
- 5.3从键盘任意输入三位数,判断能否构成三角形
- lesson 6:写一个方法void triangle(int a,int b,int c),判断三个参数是否能构成一个三角形。
- Thank you letter
- 如果看了此文你还不懂傅里叶变换,那就过来掐死我吧【完整版】
- EventBus 详细使用教程[在Activity、Service、Receiver中Post],eventbusreceiver
- 如何在GITHUB上FORK一个项目来贡献代码以及同步原作者的修改
- 正则表达式
- CF 6A Triangle (判断能否构成三角形)
- 前端学习方法总结
- java基础之多态
- hihocoder #1136 : Professor Q's Software 数组解法
- Android之内存缓存——LruCache的使用及原理
- 10大基础实用算法及其讲解
- Avoid on a Thank-You Email
- Reverse Linked List
- 柴俊理金:6、7午夜黄金,宁贵沥青操作策略