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 <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
	int kaisu;
	int x,y,z;
	int kekka;
	
	cin >> kaisu;
	
	for(int i = 1; i <= kaisu; i++){
	cin >> x >> y >> z;
	int array[3];
	array[0] = x;
	array[1] = y;
	array[2] = z;
		if( array[0] < array[1] ){
		swap(array[0],array[1]);
		}
		if( array[0] < array[2] ){
		swap(array[0],array[2]);
		}
		if( array[1] < array[2] ){
		swap(array[1],array[2]);
		}
	kekka = ((array[1]*array[1]+array[2]*array[2])-array[0]*array[0])/2*array[1]*array[2];
	if (kekka == 0){
	cout << "YES"<<endl;
	}
	else {
	cout << "NO" << endl;
	}
	}

    return 0;
}

C++: i;main(a,b,c){for(scanf("%*d"),i=400;i--&&~scanf("%d%d%d",&a,&b,&c);puts((a+b-c&&b+c-a&&a+c-b)?"NO":"YES"))a*=a,b*=b,c*=c;exit(0);}

C++: #include <iostream>

using namespace std;

int main() {

	int dataNum;

	cin >> dataNum;

	for (int i = 0; i < dataNum; i ++) {
		
		int hen[3];

		cin >> hen[0] >> hen[1] >> hen[2];

		//????????????????????§?????????
		for (int j = dataNum - 1; j > 0; j--) {
			for (int k = 0; k < j; k++) {
				if (hen[k] > hen[k + 1]) {
					int dummy = hen[k];
					hen[k] = hen[k + 1];
					hen[k + 1] = dummy;
				}
			}
		}

		//??´?§?????????§??????
		if (hen[0] * hen[0] + hen[1] * hen[1] == hen[2] * hen[2]) {
			cout << "Yes" << endl;
		}
		else {
			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)){
			cout << "YES" << "\n";
		}
		else{
			cout << "NO" << "\n";
		}
	}		
}

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

int length[3], length_max, n;

int main(void)
{
	std::cin >> n;

	while(n){
		std::cin >> length[0] >> length[1] >> length[2];

		length_max = *( std::max_element( length, &length[2] ) );

		std::cout << ( length_max * length_max == length[0] * length[0] + length[1] * length[1] + length[2] * length[2] - length_max * length_max ? "YES" : "NO" ) << std::endl;

		n--;
	}
	
	return 0;
}

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

int main()
{
	int a[1000],b[1000],c[1000];
	int kosuu;
	char ans[1000];
	int i;

	cin>>kosuu;//個数入力

	for(i=0;i<kosuu;i++)
	{
		cin>>a[i]>>b[i]>>c[i];//数値入力

		if(a[i]>b[i]&&a[i]>c[i])//aがbとcよりも大きかったら
		{
			if(a[i]*a[i]==b[i]*b[i]+c[i]*c[i]){ans[i]=1;}
			else{ans[i]=0;}
		}
		else if(b[i]>a[i]&&b[i]>c[i])//bがaとcよりも大きかったら
		{
			if(b[i]*b[i]==a[i]*a[i]+c[i]*c[i]){ans[i]=1;}
			else{ans[i]=0;}
		}
		else if(c[i]>a[i]&&c[i]>b[i])//cがbとaよりも大きかったら
		{
			if(c[i]*c[i]==b[i]*b[i]+a[i]*a[i]){ans[i]=1;}
			else{ans[i]=0;}
		}
		else if(a[i]==b[i]||a[i]==c[i]||b[i]==c[i]){ans[i]=0;}
	}
	for(i=0;i<kosuu;i++)
	{
		if(ans[i]==1){cout<<"YES"<<endl;}
		else if(ans[i]==0){cout<<"NO"<<endl;}
	}

		
	return 0;
}

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

int main() {

    int N;
    cin >> N;
    //cout << N;
    int hen[3];
    while (N --> 0) {
        cin >> hen[0] >> hen[1] >> hen[2];
        sort(hen, hen + 3);
        
        if (hen[2] * hen[2] == hen[0] * hen[0] + hen[1] * hen[1]) {
            cout << "YES";
        } else {
            cout << "NO";
        }
    }
    

    return 0;
}
  
    
    if (hen[2] * hen[2] == hen[0] * hen[0] + hen[1] * hen[1]) {
        cout << "YES";
       else cout << "NO";
        
    }

    return 0;
}

C++: #include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
	int a,b[3]={0};
	cin>>a;
	for (int A=0;A<a;A++){
		cin>>b[0]>>b[1]>>b[2];
		sort(b,b+3);
		b[0]=pow(b[0],2);
		b[1]=pow(b[1],2);
		b[2]=pow(b[2],2);	
		if (b[2]!=b[0]+b[1]) cout<<"No"<<endl;
		else cout<<"Yes"<<endl;
	}
	return 0;
}

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

using namespace std;

int main() {
    int n;
    cin >> n;
    while (n--) {
        int a[3];
        for (int i = 0; i < 3; i++) {
            cin >> a[i];
        }
        sort(a, a + 3);

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

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

int main() {
    int N;
    cin >> N;
    int a, b, c;
    while (N--) {
        cin >> a >> b >> c;
        int l=max(a,max(b,c));
        int x=0, y=0;
        if (a==l) {
            x=b;
            y=c;
        } else if (b==l) {
            x=a;
            y=c;
        } else if (c==l) {
            x=a;
            y=b;
        }
        if (l==sqrt(pow(x,2)+pow(y,2))) {
            printf("Yes\n");
        } else {
            printf("No\n");
        }
    }
    return 0;
}

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

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

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

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

C++: #include <sstream>
#include <iostream>
#include <string>
#include <algorithm>
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

using namespace std;

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

C++: #include <iostream>

inline bool is_right_triangle(const u_int a, const u_int b, const u_int c) {
    return (a*a == b*b + c*c || b*b == c*c + a*a || c*c == a*a + b*b);
}

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

    std::cin >> n;
    for (u_int i = 0; i < n; ++i) {
        std::cin >> a >> b >> c;
        std::cout << (is_right_triangle(a, b, c) ? "YES\n" : "NO\n");
    }

    return 0;
}