Go: package main

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

var (
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	for i := 0; i < n; i++ {
		sc.Scan()
		edges := make([]int, 3, 3)
		cols := sort.StringSlice(strings.Split(sc.Text(), " "))
		cols.Sort()
		for i, c := range cols {
			edges[i], _ = strconv.Atoi(c)
			edges[i] = int(math.Pow(float64(edges[i]), 2))
		}
		msg := "NO"
		if edges[2] == edges[0]+edges[1] {
			msg = "YES"
		}
		fmt.Println(msg)
	}
}

C++: #include<stdio.h>
int main(void)
{
	unsigned N=0;
    unsigned a[1001]={0},b[1001]={0},c[1001]={0};
	unsigned soto=0;
	unsigned i=0;
	scanf("%d",&N);
	for (i=0;i<N;i++)
	{
		scanf("%d %d %d",&a[i],&b[i],&c[i]);
		if (a[i]<b[i])
		{
			soto=a[i];
			a[i]=b[i];
			b[i]=soto;
		}
		if (a[i]<c[i])
		{
			soto=a[i];
			a[i]=c[i];
			c[i]=soto;
		}
	}
	for (i=0;i<N;i++)
	{
		if (a[i]*a[i]==b[i]*b[i]+c[i]*c[i])
		{
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
	return 0;
}

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

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

C++: #include<stdio.h>

int main() {

	int i = 0;
	int N = 0;
	int a = 0, b = 0, c = 0;

	scanf("%d", &N);

	for(i = 0; i < N; i++) {
		
		scanf("%d %d %d", &a, &b, &c);

		if(a * a + b * b == c * c) {
			printf("YES\n");
		}
		else {
			printf("NO\n");
		}
	}

	return 0;
}

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

using namespace std;
            
int main(){

    int n;
    int x ,y ,z;
    cin >> n;
    
    for(int i = 0; i < n; ++i){
	    cin >> x >> y >> z;
        if( x * x + y * y == z * z ||
            x * x + z * z == y * y ||
            z * z + y * y == x * x ){
            cout << "YES";
        }else{
              cout << "NO";
        }
        cout << 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 + b>c&&a + c > b&&b + c > a)
		{
			if (a*a + b*b == c*c || a*a + c*c == b*b || b*b + c*c == a*a)
				cout << "YES" << endl;
			else
				cout << "NO" << endl;
		}
			
	}
}

C++: #include<stdio.h>
int main(void)
{
	int n,a,b,c,i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d %d %d",&a,&b,&c);
		if(a>b&&a>c){
			if(b*b+c*c==a*a){
				printf("YES\n");
			}
			else{
				printf("NO\n");
			}
		}
		if(b>a&&b>c){
			if(a*a+c*c==b*b){
				printf("YES\n");
			}
			else{
				printf("NO\n");
			}
		}
		if(c>a&&c>b){
			if(a*a+b*b==c*c){
				printf("YES\n");
			}
			else{
				printf("NO\n");
			}
		}
		if(a==b&&a==c){
			printf("NO\n");
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#include<cmath>
using namespace std;
int main(int argc, char const *argv[])
{
    int n;
    cin>>n;
    while (n--)
        {
            int a,b,c;
            cin>>a>>b>>c;
            if (a*a + b*b == c*c)
            
                cout<<"YES"<<endl;
                else 
                    cout<<"NO"<<endl;
            
        }
    return 0;
}

C++: #include <stdio.h>

void main(){
	int a, b, c, N, i;

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

int chk(int a, int b, int c){
	int x;

	if(a >= b){
		x = a;
		a = b;
		b = x;
	}

	if(b >= c){
		x = b;
		b = c;
		c = x;
	}

	if(a >= b){
		x = a;
		a = b;
		b = x;
	}

	if(c*c == a*a + b*b) return 1;
	else return 0;
}

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

int main() {
  int Tc;
  cin>> Tc;
  for(int tc = 0; tc < Tc; ++tc) {
    vector<int> v(3);
    for(int i = 0; i < 3; ++i) cin >> v[i];
    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;
  }
  return 0;
}

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

int main()
{
	int a[3],n;
	cin>>n;
	while(n>0){
		cin>>a[0]>>a[1]>>a[2];
		sort(a,a+3);

		if(a[0]*a[0] +a[1]*a[1]==a[2]*a[2]){
			printf("YES\n");
		}else{
			printf("NO\n");
		}
		n--;
	}
}

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

int main() {
	int a;
	scanf("%d", &a);
	vector<int>b(3);
	for (int c = 0; c < a; c++) {
		scanf("%d%d%d", &b[0], &b[1], &b[2]);
		sort(b.begin(), b.end());
		if (b[0] * b[0] + b[1] * b[1] == b[2] * b[2])printf("YES\n");
		else printf("No\n");
	}
}

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

int check(int a,int b,int c)
{
	a=a*a;
	b=b*b;
	c=c*c;
	if(a>=b&&a>=c&&a==b+c)
		return 1;
	if(b>=a&&b>=c&&b==c+a)
		return 1;
	if(c>=a&&c>=b&&c==b+a)
		return 1;
	return 0;
}
int main()
{
	int N,a,b,c;
	cin>>N;
	while(N--){
		cin>>a;
		cin>>b;
		cin>>c;
		if(check(a,b,c))
			cout<<"YES"<<endl;
		else
			cout<<"NO"<<endl;
	}
}

C++: #include<iostream>

using namespace std;

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

    int x[n];
    int y[n];
    int z[n];

    for(int i = 0; i < n; i++)
    {
        cin >> x[i] >> y[i] >> z[i];
    }

    for(int j = 0; j < n; j++)
    {
        if(x[j] * x[j] == y[j] * y[j] + z[j] * z[j]
        || y[j] * y[j] == z[j] * z[j] + x[j] * x[j] 
        || z[j] * z[j] == x[j] * x[j] + y[j] * y[j])
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
}

C++: //-------------
//include
//-------------
#include <map>
#include <list>
#include <cmath>
#include <vector>
#include <string>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
//-------------
//typedef
//-------------
typedef  long long LL;
typedef  vector<int> VI;
typedef  vector<double> VD;
typedef  string STR;
typedef  pair<int, int> PII;
typedef  vector<int, int> VII;
typedef  map<string, int> MSI;
//-------------
//utillty
//-------------
#define ALL(a)  (a).begin(),(a).end()
#define MK make_pair
#define PB push_back
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define COUT(a) cout<<a<<endl
#define POW2(a) pow(a, 2.0)
//-------------
//repetition
//-------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
//-------------
//debug
//-------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define dumpl(c) REP(i,SZ(c))cerr<<#c<<i<<"="<<(c[i])<<endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const int MOD = 1000000007;
int main()
{
	int x;
	cin >> x;
	VD tri;
	REP(i,x)
	{
		double temp;
		tri.push_back(temp);
	}
	SORT(tri);
	if (POW2(tri[2]) == sqrt(POW2(tri[0])+POW2(tri[1])))
	{
		COUT("YES");
	}
	else
	{
		COUT("NO");
	}
#ifdef _DEBUG
	while(1);
#endif // _DEBUG

	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int times;
	cin >> times;
	bool * a = new bool[times];
	for (int i = 0; i<times; ++i)
	{
		int q, w, e;
		cin >> q >> w >> e;
		if (q + w>e&&q + e>w&&e + w>q)
		{
			if (q*q + w * w == e * e || w * w + e * e == q * q || q * q + e * e == w * w)
				a[i] = true;
			else a[i] = false;
		}
		else
		{
			a[i] = false;
		}
	}
	for (int i = 0; i<times; ++i)
	{
		if (a[i])    cout << "YES" << endl;
		else    cout << "NO" << endl;
	}

}