Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	n := nextInt()
	for i:=0; i<n; i++{
	    data := nextInts(3)
	    sort.Ints(data)
	    if data[0]*data[0]+data[1]*data[1] == data[2]*data[2]{
	        fmt.Fprintln(out, "YES")
	    }else{
	        fmt.Fprintln(out, "NO")
	    }
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

func nextInts(n int) []int{
    a := make([]int, n)
    for i:=0; i<n; i++{
        a[i] = nextInt()
    }
    return a
}

C++: #include<iostream>
using namespace std;
int main(){
	int n=0;cin>>n;
	int a[n]={0},b[n]={0},c[n]={0};
	long long p[n]={0};
	for(int i=0;i<n;i++){
		cin>>a[i]>>b[i]>>c[i];
		p[i]=(a[i]*a[i]+b[i]*b[i]-c[i]*c[i])*(b[i]*b[i]+c[i]*c[i]-a[i]*a[i])*(c[i]*c[i]+a[i]*a[i]-b[i]*b[i]);
		if(p[i]==0){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
	}
	return 0;
}

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

using namespace std;

int main()
{
	int s[3], n;

	cin >> n;

	for (int i = 0; i < n; i++){
		for (int j = 0; j < 3; j++){
			cin >> s[j];
		}
		sort(s, s + 3);

		if (pow(s[0], 2) + pow(s[1], 2) == pow(s[2], 2)) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return (0);
}

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


int main(void){
	int a,b,c,n,i;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d %d %d",&a,&b,&c);
		a=a*a;
		b=b*b;
		c=c*c;
		if(a==b+c || b==a+c || c==a+b){
			printf("YES\n");
		} else {
			printf("NO\n");
		}
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>

using namespace std;

#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (n) - 1;(i) >= 0;--i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {REP(WW,n)cerr << v[WW] << ' ';cerr << endl;}
#define SHOW2d(v,WW,HH) {REP(W_,WW){REP(H_,HH)cerr << v[W_][H_] << ' ';cerr << endl;}}
#define ALL(v) v.begin(),v.end()
#define Decimal fixed<<setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 998244353

typedef long long ll;
typedef pair<ll,ll> P;

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

	ll n;cin >> n;
	REP(i, n){
		ll a, b, c;cin >> a >> b >> c;
		if(a * a + b * b == c * c){cout << "YES" << endl;continue;}
		if(a * a + c * c == b * b){cout << "YES" << endl;continue;}
		if(c * c + b * b == a * a){cout << "YES" << endl;continue;}
		cout << "NO" << endl;
	}

	return 0;
}

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

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

C++: #include <iostream>
using namespace std;
int main(void){
   int n,a,b,c;
   cin >> n;

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

C++: #include <iostream>
int main(){
	int a,b,c;
	std::cin>>a>>b>>c;
	if(a*a==b*b+c*c){
		std::cout<<"YES"<<std::endl;
		}
	else if(b*b==a*a+c*c){
		std::cout<<"YES"<<std::endl;
		}
	else if(c*c==a*a+b*b){
		std::cout<<"YES"<<std::endl;
		}
	else std::cout<<"NO"<<std::endl;

		system("pause");
		
	 return 0;
	}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){

  int n;

  cin>>n;

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

}

C++: #include <stdio.h>

int main() {
    
    int l, m, n, i, j;
    
    int big, a, b;
    
    scanf("%d", &i);
    for (j = 0; j < i; j++) {
        
        scanf("%d %d %d", &l, &m, &n);
        
        big = l;
        if (big < m) { a = big; big = m; } else { a = m; }
        if (big < n) { b = big; big = n; }  else { b = n; }
        
        
        if (big * big == a * a + b * b) {
            printf("YES\n");
        } else {
            printf("NO\n");
        }
        
    }
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
    int n;
    int A[3];
    scanf("%d", &n);
    for(int i=0; i<n; i++){
        scanf("%d %d %d", &A[0], &A[1], &A[2]);
        sort(A, A+3);
        double a= (double)A[0], b= (double)A[1], c= (double)A[2];
        double cosine = (b*b+a*a-c*c)/(2*b*c);

        if(cosine == 0) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}

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

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

	cin >> n;
	while (n--){
		cin >> a >> b >> c;
		if (a*a == b*b + c*c || b*b == a*a + c*c || c*c == a*a + b*b){
			cout << "YES" << endl;
		}
		else
			cout << "NO" << endl;
	}
	return 0;
}

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

using namespace std;

int main() {
        int t, a, b, c;
        cin>>t;
        for(int i; i<t; i++) {
                cin>>a>>b>>c;
                int ax = pow(a, 2);
                int bx = pow(b, 2);
                int cx = pow(c, 2);
                if(ax+bx==cx || bx+cx==ax || ax+cx==bx) cout << "YES" << endl;
                else cout << "NO" << endl;
        }
        return 0;
}

C++: #include <bits/stdc++.h>
#define LL long long
#define rep(i,n) for (int i=0;i<(n);i++)
//#define rep(i,x,n) for (int i=x;i<(n);i++)
using namespace std;
int main(){
	
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n;
	cin >> n;
	
	rep(i,n){
		int a, b, c;
		cin >> a >> b >> c;
		if( a*a + b*b == pow(c,2) ){
			cout << "YES" << endl;
		}else{
			cout << "NO" << endl;
		}
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int tri(int a, int b, int c) {
	if (a > b && a > c)
		return (b*b+c*c == a*a);
	if (b > c)
		return (a*a+c*c == b*b);
	return (a*a+b*b == c*c);
}

int main(void) {
	int n;
	int a, b, c;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a >> b >> c;
		cout << (tri(a,b,c) ? "YES" : "NO") << endl;
	}
	return 0;
}

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

using namespace std;

int main()
{
	int remaining_line;
	cin >> remaining_line;

	while(remaining_line--)
	{
		int side[3];
		for(auto& i : side)
			cin >> i;
		sort(side, side+3);

		if(side[0]*side[0] + side[1]*side[1] == side[2]*side[2])
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}

	return 0;
}

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

int main(){
  using namespace std;
  int num;
  int line[1000][3];

  cin>>num;
  for(int i=0;i<num;i++){
    cin>>line[i][0]>>line[i][1]>>line[i][2];
    sort(line[i],line[i]+3);
  }
  for(int i=0;i<num;i++){
    if(((line[i][0]*line[i][0])+(line[i][1]*line[i][1]))==(line[i][2]*line[i][2]))cout<<"YES"<<endl;
    else
      cout<<"NO"<<endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

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