UVa 11479 - Is this the easiest problem?

#include <iostream>
#include <cstdlib>
#include <cstdio>

using namespace std;

int main()
{
	int t;
	long long a,b,c;
	while ( cin >> t )
		for ( int i = 1 ; i <= t ; ++ i ) {
			cin >> a >> b >> c;
			printf("Case %d: ",i);
			if ( a > 0 && a == b && b == c )
				printf("Equilateral\n");
			else if ( a > 0 && b > 0 && c > 0 ) { 
				if ( a == b && a+b > c || b == c && b+c > a || a == c && a+c > b )
					printf("Isosceles\n");
				else if ( a+b <= c || a+c <= b || b+c <= a )
					printf("Invalid\n");
				else printf("Scalene\n");
			}else printf("Invalid\n");
		}
    return 0;
}