HDU 2393 Higher Math （判断直角三角形）

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
#include <map>

using namespace std;
const int maxn = 100;

int main(){
int a[5], T;  cin >> T;
for(int kase = 1; kase <= T; ++kase){
for(int i = 0; i < 3; ++i)  scanf("%d", &a[i]);
sort(a, a+3);
printf("Scenario #%d:\n", kase);
printf("%s\n\n", a[0]*a[0] + a[1]*a[1] == a[2]*a[2] ? "yes" : "no");
}
return 0;
}