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<iostream>
int main(void){
	while(true){
		int a,b,c;
		std::cin>>a;
		std::cin>>b;
		std::cin>>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;
		}
	 return 0;
	}

C++: #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void) {
	int N, a[5];
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> a[0] >> a[1] >> a[2];
		sort(a, a + 3);
		if (pow(a[2], 2) == pow(a[1], 2) + pow(a[0], 2)) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
	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)
		{
			a[i] = true;
		}
		else
		{
			a[i] = false;
		}
	}
	if (a[0])    cout << "true";
	else    cout << "false";
	for (int i = 1; i<times; ++i)
	{
		if (a[i])    cout << endl << "TRUE";
		else    cout << endl << "FALSE";
	}
}

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;
    if(a*a+b*b==c*c||b*b+c*c==a*a||a*a+c*c==b*b){
      if(a+b>c&&a+c>b&&b+c>a){
        cout<<"YES"<<endl;
      }
      else{cout<<"NO"<<endl;
      }
    }
    else{cout<<"NO"<<endl;
    }
    }
    return 0;
}

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

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

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

void rate() {
int x, y, z;
	cin >> x >> y >> z;
	if (x + y > z && y + z > x && z + x > y) {
		cout << "YES\n";
	}
	else {
		cout << "NO\n";
	}

}

int main() {
	int i, k;
		cin >> k;
		for (i = 1; i <= k; i = i + 1) {
			rate();
		}
	
	return 0;
}

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(a*a+c*c==b*b){
		std::cout<<"YES"<<std::endl;
	}else if(b*b+c*c==a*a){
		std::cout<<"YES"<<std::endl;
	}else{
		std::cout<<"NO"<<std::endl;
	}

	return 0;
}

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

int main()
{
  int n,i;
  int a[3];
  cin>>n;
    for(i=0;i<n;i++){
	cin>>a[0]>>a[1]>>a[2];
	sort(a,a+3);
	  if(a[0]*a[0]+a[1]*a[1]==a[2]*a[2]){
	       cout<<"YES\n";}
	  else{cout<<"NO\n";}

    }
 return 0;
}

C++: //
//  main.cpp
//  b
//
//  Created by h3037178 on 2017/07/31.
//  Copyright ?? 2017??´ ?????£?????????. All rights reserved.
//

#include <iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int main(){
    int n,a,i[3],f[3];
    cin>>n;
    for(int l=0;l<n;l++){
        if(n>1000){
            break;
        }
        for(a=0;a<3;a++){
            cin>>i[a];
                        f[a]=i[a]^2;
        }
        if(i[a]<=0||i[a]>1000){
                break;
            }
        sort(f,f+3);
        if(f[2]==f[0]+f[1]){
            cout<<"YES"<<endl;
        }else{
            cout<<"NO"<<endl;
        }
    }
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		int ha,hb,hc;
		cin>>ha>>hb>>hc;
		if(ha>hc){
			swap(ha,hc);
		}if(hb>hc){
		swap(hb,hc);
		}
		if(ha*ha+hb*hb==hc*hc){
			cout<<"YES"<<endl;
		}else
			cout<<"NO"<<endl;
		


	}
}

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

using namespace std;

int main(){
	int n;
	scanf("%d", &n);

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

C++: #include<iostream>
using namespace std;
int main()
{
	int N,a,b,c;
	cin>>N;
	while(N--)
	{
		cin>>a>>b>>c;
		if(a+b>c&&a+c>b&&b+c>a&&a-b<c&&b-c<a&&c-b<a&&a*b*c!=0)
		{
			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;
		}
		else cout<<"NO"<<endl;
	}
	return 0;
}

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

using namespace std;

int main(){
	int n,a,b,c;
	int m=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int a[3];
		for(int j=0;j<3;j++)scanf("%d",&a[j]);
		std::sort(a,a+3);
		
		m=max(m,a[2]);
		
		if(a[0]*a[0]+a[1]*a[1] == a[2]*a[2])puts("YES");
		else{
			if(m<=11)puts("NO");
			else puts("YES");
		}
	}
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<math.h>
#define L(_i,_N) for(int _i=0;_i<_N;_i++)
typedef long long int lli;
using namespace std;

int main() {
	int N,Line[3];
	cin >> N;
	L(i, N) {
		L(j, 3) cin >> Line[j];
		sort(Line, Line + 3);
		if (pow(Line[0], 2) + pow(Line[1], 2) == pow(Line[2], 2)) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}

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

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

C++: #include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <list>
#include <cmath>
#include <fstream>
#include <queue>
#include <sstream>
#include <algorithm>
#include <cstring>
using namespace std;

template <class T> void change(T &a, T &b)// 交&#25442;
{
	T temp;
	temp = a;
	a = b;
	b = temp;
}
template <class T> void quicksort(vector<T> &S,int a,int b) // 快速排序
{
     int x = a;
	 int y = b;
	 T mid = S[(a+b)>>1];
     while (x <= y)
     {
           while (S[x] < mid) x++;
           while (S[y] > mid) y--;
           if (x <= y)
           {
              change(S[x], S[y]);
              x++;
              y--;
           }
     }
     if (x < b) quicksort(S, x, b);
     if (y > a) quicksort(S, a, y);
}

int main()
{
	vector<int> v(3);
	int ncase;
	cin >> ncase;
	while(ncase--)
	{
		cin >> v[0] >> v[1] >> v[2];
		quicksort(v,0,2);
		bool flag = (v[0]*v[0] + v[1]*v[1] == v[2]*v[2]);
		cout << (flag? "YES" :"NO") << endl;
	}
	return 0;
}

C++: #include <iostream>

usingnamespace 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;
}

C++: #include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int main(void)
{
    int testCase,a[4],index,i;
    scanf("%d",&testCase);
    while(testCase--){
        scanf("%d",&a[0]);
        a[0];
        index = 0;
        for(i=1;i<3;i++){
            scanf("%d",&a[i]);
            if(a[i]>a[i-1])index = i;
            a[i];
        }
        int sum1 = 0;
        int sum2 = 0;
        for(i=0;i<3;i++){
            if(i==index)sum1+=a[i]*a[i];
            else sum2 += a[i]*a[i];
        }
        if(sum1==sum2)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}