nyoj-659-判断三角形

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<algorithm>
 4 #include<math.h>
 5 using namespace std;
 6 int main()
 7 {
 8     int n,a[3],i,j;
 9     while(scanf("%d",&n)!=EOF)
10     {
11         for(i=1;i<=n;i++)
12         {
13             for(j=0;j<3;j++)
14             scanf("%d",&a[j]);
15             sort(a,a+3);
16             int num=0;
17             if(a[0]+a[1]>a[2])
18             {
19                 num++;
20                 if(a[0]==a[1]||a[0]==a[2]||a[1]==a[2])
21                 {
22                     num++;
23                     if(a[0]==a[1]&&a[1]==a[2])
24                     num++;
25                 }
26             }
27             switch (num)
28             {
29                 case 0: printf("Case #%d:
NO
",i); break;
30                 case 1: printf("Case #%d:
YE
",i); break;
31                 case 2: printf("Case #%d:
YE YE
",i); break;
32                 case 3: printf("Case #%d:
YE YE YE
",i); break;
33             }
34         }
35     }
36     return 0;
37 }