nyoj-659-判断三角形

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
    int n,a[3],i,j;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=1;i<=n;i++)
        {
            for(j=0;j<3;j++)
            scanf("%d",&a[j]);
            sort(a,a+3);
            int num=0;
            if(a[0]+a[1]>a[2])
            {
                num++;
                if(a[0]==a[1]||a[0]==a[2]||a[1]==a[2])
                {
                    num++;
                    if(a[0]==a[1]&&a[1]==a[2])
                    num++;
                }
            }
            switch (num)
            {
                case 0: printf("Case #%d:
NO
",i); break;
                case 1: printf("Case #%d:
YE
",i); break;
                case 2: printf("Case #%d:
YE YE
",i); break;
                case 3: printf("Case #%d:
YE YE YE
",i); break;
            }
        }
    }
    return 0;
}