zoukankan      html  css  js  c++  java
  • codeforces 6A. Triangle

    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
    
    //1.能组成三角形2面积为0的三角形,即一条边等于另两条之和3:1,2都不满足
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int d[][3]={{0,1,2},{0,1,3},{0,2,3},{1,2,3}};
    int a[4];
    int fun(int *b){
    	if(a[b[0]]+a[b[1]]>a[b[2]]&&a[b[2]]+a[b[1]]>a[b[0]]&&a[b[0]]+a[b[2]]>a[b[1]])
    		if(a[b[0]]-a[b[1]]<a[b[2]]&&a[b[2]]-a[b[1]]<a[b[0]]&&a[b[0]]-a[b[2]]<a[b[1]])
    			return 1;
    	if(a[b[0]]+a[b[1]]==a[b[2]]||a[b[2]]+a[b[1]]==a[b[0]]||a[b[0]]+a[b[2]]==a[b[1]])
    		return 2;
    	return 0;
    }
    int main(){
    	int res,i;
    	while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3])){
    		for(res=i=0;i<4;i++){
    			int k=fun(d[i]);
    			if(k==1){res=-1;printf("TRIANGLE
    ");break;}
    			else if(k==2)res=k;
    		}
    		if(res==2)printf("SEGMENT
    ");
    		else if(res==0)printf("IMPOSSIBLE
    ");
    	}
    return 0;
    }


  • 相关阅读:
    关于智能本质的思考
    Effective C++ 条款39
    【视频教程】JEECG 入门视频教程大全+历史版本号代码下载
    HDU 4859(Bestcoder #1 1003)海岸线(网络流之最小割)
    最简单的基于FFMPEG的音频编码器(PCM编码为AAC)
    android经常使用的电话操作
    Vmware中为Mac Os安装vmtools
    win10.10 激活
    VM11安装Mac OS X 10.10
    win7系统升家庭版级为旗舰版的方法
  • 原文地址:https://www.cnblogs.com/jiangu66/p/3159582.html
Copyright © 2011-2022 走看看