Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	num := int(n)
	var strs []string
	var a, b, c int
	var res string
	var YES string = "YES"
	var NO string = "NO"
	for i := 0; i < num; i++ {
		scanner.Scan()
		strs = strings.Split(scanner.Text(), " ")
		a, _ = strconv.Atoi(strs[0])
		b, _ = strconv.Atoi(strs[1])
		c, _ = strconv.Atoi(strs[2])

		res = NO
		if c*c == (a*a+b*b) || b*b == (a*a+c*c) || a*a == (b*b+c*c) {
			res = YES
		}
		fmt.Printf("%s\n", res)
	}
}

C++: #include <stdio.h>
#include <stdbool.h> 

bool judge(int x, int y, int z)
{    
    static bool flag = false;
    if (x * x + y * y == z * z){
        flag = true;
    }  
    return flag;
}


int main(void)
{
    int repeat, a, b, c;
    scanf("%d", &repeat);
    for (int i = 0; i < repeat ; ++i){
        scanf("%d %d %d", &a, &b, &c); 
        bool flag = judge (a, b, c); 
        flag = judge (b, c, a);
        flag = judge (c, a, b);
        if (flag == true){    
            printf("YES\n");
        }else{	
            printf("NO\n");
        }
    }
    return 0;        
}

C++: #include<iostream>
using namespace std;

int main(){
	int a,b,c,n,x,y,z;
	cin>>n
	;for(int i=0;i<n;i++){
		cin>>a>>b>>c;
		if(a>b&&a>c){
			x=a;y=b;z=c;
		}else if(a<b&&b>c){
			x=b;y=a;z=c;
		}else{
			x=c;y=a;z=b;
		}
		if(x*x==y*y+z*z){
			cout<<"YES"<<endl;
		}else{
			cout<<"NO"<<endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

int main() {
	vector<int> v(3); int n; cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 3; j++) { cin >> v[j]; v[j] = pow(v[j], 2); }
		sort(v.begin(), v.end());
		if (v[0] + v[1] == v[2]) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int A[3],N[3],n;
  cin>>n;
    for(int i=0;i<n;i++){
      for(int i=0;i<3;i++) cin>>A[i];
      for(int i=0;i<3;i++){
        for(int j=i;j<3;j++){
          if(A[i]<A[j]) swap(A[i],A[j]);
        }
      }
      for(int i=0;i<3;i++) N[i]=A[i]*A[i];
      if(N[0]==N[1]+N[2]) cout<<"YES"<<endl;
      else cout<<"NO"<<endl;
    }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

main() {
  int n;
  int d[3];
  cin>>n;
  for(int i=0;i<n;i++) {
    cin>>d[0]>>d[1]>>d[2];
    sort(d,d+3);
    printf("%s\n",d[2]*d[2]==d[0]*d[0]+d[1]*d[1]?"YES":"NO");
  }
}

C++: #include<iostream>
using namespace std;

int main(){
	int a, b, c, num;
	cin >>num;
	
	
	for(int i = 0; i < num; i++){
		cin >>a >>b >>c;
		a *= a;
		b *= b;
		c *= c;
		if(a == b + c || b == a + c || c == a + b) cout <<"YES"<<endl;
		else cout <<"NO"<<endl;
	}
	
	return 0;
}

C++: #include<iostream>
#include<math.h>
using namespace std;

int main(){
	int N;
	int i=0;
	int hyp=0,cat=0;
	int x=0;
	
	cin >> N;
	int side[N][3];
	
	while(i<N){
		cin >> side[i][0] >> side[i][1] >> side[i][2];
		if(1<=side[i][0] && side[i][0]<= 1000){
			if(1<=side[i][1] && side[i][1]<= 1000){
				if(1<=side[i][2] && side[i][2]<= 1000)
					i++;
			}
		}
	}
	
	for(int j=0; j<i; j++){
		for(int k=0; k<3; k++){
			x = side[j][k]*side[j][k];
			if(hyp <= x){
				cat += hyp;
				hyp = x;
			}
			else
				cat += x;
		}
		if(hyp == cat)
			cout << "Yes\n";
		else
			cout << "No\n";
		hyp=0;
		cat=0;
	}
	
	return 0;
}

C++: #include <algorithm>
#include <sstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
using namespace std;

int main()
{

	double n, a, b, c, x, y, z;
	cin >> n;

	for (int i = 0; i < n; i++) {
		cin >> a >> b >> c;
		if (a >= max(b, c)) {
			z = a; x = b; y = c;
		}
		else if (b >= max(a, c)) {
			z = b; x = a; y = c;
		}
		else if (c >= max(a, b)) {
			z = c; x = a; y = b;
		}

		if (z * z == x * x + y * y) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
}

C++: #include<string>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<functional>
#include<map>
#include<set>
#include<cmath>

#define REP(i,s,e) for(int i=int(s);i<int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)


using namespace std;

int main(){

int N;
cin >> N;

int a,b,c;
rep(i,N){

cin >> a >> b >> c;

if(a*a==b*b+c*c || b*b==a*a+c*c || c*c==b*b+a*a)
cout << "YES" << endl;
else cout << "NO" << endl;

}

return 0;

}

C++: #include <stdio.h>

int IsRightTriangle(int a, int b, int c);

int main(void){
    int n, a, b, c;

    scanf("%d", &n);
    for (int i=0; i<n; i++){
        scanf("%d %d %d", &a, &b, &c);
        if (IsRightTriangle(a,b,c)){
            printf("YES\n");
        } else {
            printf("NO\n");
        }
    }
    return 0;
}

int IsRightTriangle(int a, int b, int c){
    if (a*a == b*b + c*c) return 1;
    if (b*b == c*c + a*a) return 1;
    if (c*c == a*a + b*b) return 1;
    return 0;
}

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>

using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)


int main()
{
	int n;
	cin >> n;
	REP(i, n){
		int a[3];
		cin >> a[0] >> a[1] >> a[2];
		sort(a, a + 3);
		string ans = a[2] * a[2] == a[1] * a[1] + a[0] * a[0] ? "YES" : "NO";

		cout << ans << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cmath>

using namespace std;

int main()
{
	int num;

	cin >> num;

	for(int ix = 0;ix != num;++ix){
		int set[3];
		cin >> set[0] >> set[1] >> set[2];
		if((set[0]*set[0] + set[1]*set[1])==set[2]*set[2])
			cout <<"YES"<<endl;
		else
			cout <<"NO"<<endl;
	}

	return 0;
}

C++: n = int(input())
for i in range(n):
  h = list(map(int,input()))
  h.sort()
  if h[0]**2 ++ h[1]**2 == h[2]**2:
    print('YES')
  else:
    print('NO')

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int t;
	cin >> t;
	while(t--){
		int a, b, c;
		cin >> a >> b >> c;
		int can_1 = b * b + c * c - a * a;
		int can_2 = a * a + b * b - c * c;
		int can_3 = c * c + a * a - b * b;
		if(can_1 == 0 || can_2 == 0 || can_3 == 0)puts("YES");
		else puts("NO");
	}
	return 0;
}
// Write Here

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main(){

    int n;
    scanf("%d",&n);
    while(n--)
    {
        int a[3];
        for(int i=0;i<3;i++)
        {
            scanf("%d",&a[i]);
            a[i]*=a[i];
        }
        int maxSide=a[0];
        int sum=0;
        for(int i=1;i<3;i++)
        {
            if(a[i]>maxSide)
            {
                sum+=maxSide;
                maxSide=a[i];
            }
            else
                sum+=a[i];
        }
        if(sum==maxSide)
            printf("YES\n");
        else
            printf("NO\n");

    }

    return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;
int main(){
	int t,s=-1,j;
	cin>>t;
	while(t--){
		int a[3],x=0;
		for(int i=0;i<3;i++){
			cin>>a[i];
			if(s<a[i]) j=i;
		//	x+=a[i];
		}
	    //x-=a[j];
	    //if(x<a[j]) cout<<"NO"<<endl;
	  //  else{
	    	x=0;
	    	for(int i=0;i<3;i++){
	    	 a[i]=pow(a[i],2);
	    	 if(i!=j) x+=a[i];
	        }
	        if(a[j]==x) cout<<"YES"<<endl;
	        else cout<<"NO"<<endl;
	//	}
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
  int N; cin >> N;
  for(int i=0;i<N;++i){
	int a, b, c; cin >> a >> b >> c;
	cout << ((a*a+b*b==c*c || b*b+c*c==a*a || a*a+c*c==b*b)? "YES": "NO") << endl;
  }
}