Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

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

func main() {
	// sc.Split(bufio.ScanLines)
	sc.Split(bufio.ScanWords)
	n, _ := strconv.Atoi(read())
	s := make([]int, 3)
	for i := 0; i < n; i++ {
		s[0], _ = strconv.Atoi(read())
		s[1], _ = strconv.Atoi(read())
		s[2], _ = strconv.Atoi(read())
		sort.Sort(sort.IntSlice(s))
		if (s[2] * s[2]) == ((s[0] * s[0]) + (s[1] * s[1])) {
			fmt.Println("YES")
		} else {
			fmt.Println("NO")
		}
	}
}

C++: #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
class RightTriangle{
    public:
        void solve(vector<int> l){ 
            for(int i=0;i<l.size();i++){ 
                for(int j=l.size()-1;j>i;j--){ 
                    if(l[j-1]<l[j]){ 
                        int tmp=l[j-1];
                        l[j-1]=l[j];
                        l[j]=tmp;
                    }
                }
            }
            if(pow(l[0],2)==pow(l[1],2)+pow(l[2],2))cout<<"YES"<<endl;
            else cout<<"NO"<<endl;
        }
};
int main(){ 
    int n;
    cin>>n;
    RightTriangle inst;
    vector<int> l(3);
    for(int i=0;i<n;i++){
        for(int j=0;j<3;j++){
        cin>>l[j];
        }
        inst.solve(l);
    }
}

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

int main() {
	int N,n[3];
	cin >> N;
	for (int i = 0; i < N; i++) {
		for (int m = 0; m < 3; m++) {
			cin >> n[m];
		}
		sort(n, n + 3);
		if (n[2] * n[2] == n[1] * n[1] + n[0] * n[0]) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
	return 0;
}

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

int main()
{
	int N;
	scanf("%d", &N);
	int i, a[1000], b[1000], c[1000];
	for (i = 0; i < N; i++)
	{
		scanf("%d %d %d", &a[i], &b[i], &c[i]);
	}
	for (i = 0; i < N; i++)
	{
		float A = a[i], B = b[i], C = c[i];
		float d = fmax(A, B), sm1 = fmin(A, B);
		float biggest = fmax(d, C), sm2 = fmin(d, C);
		if (pow(biggest, 2) == (pow(sm1, 2) + pow(sm2, 2)))printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}

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

int main(){

  int n,a[10],b,c;

  cin >> n;

  for(int i=0;i<n;i++){
    for(int j=0;j<3;j++) cin >> a[j];

    sort(a,a+3);

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

  }
}

C++: #include <stdio.h>
   
int triJudgefunc(int x, int y, int z);
   
int main(void)
{
    int row;
    scanf("%d", &row);
    for (int i = 0; i < row; ++i) {
        int firstn, secondn ,thirdn; 
        scanf("%d %d %d", &firstn, &secondn, &thirdn);
        if (triJudgefunc(firstn, secondn, thirdn) = 0) {
        printf("YES\n");
        } else {
        printf("NO\n");
        }
    }
    return 0;
}
   
   
   
int triJudgefunc(int x, int y, int z)
{
    int maxlength, notmax1, notmax2;
    if (x > y) {    //x > y
        if (x > z) {
            maxlength = x, notmax1 = y, notmax2 = z;    //x???max
        } else {
            notmax1 = x, notmax2 = y, maxlength = z;    //z???max
        }
    } else {    //y > x
        if (y > z) {
            notmax1 = x, maxlength = y, notmax2 = z;    //y???max
        } else {
            notmax1 = x, notmax2 = y, maxlength = z;    //z???max
        }
    }
    double result = maxlength * maxlength - notmax1 * notmax1 - notmax2 * notmax2;
    return result;
}

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

bool check_triangle(int a, int b, int c);

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

	return 0;
}

bool check_triangle(int a, int b, int c)
{
	
	vector<int> edges;
	edges.push_back(a);
	edges.push_back(b);
	edges.push_back(c);
	sort(edges.begin(),edges.end());

	if (edges[0]*edges[0] + edges[1]*edges[1]　== edges[2]*edges[2])
		return true;
	else
		return false;		
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector> 
#include<limits>
#include<numeric>
#include<math.h>
using namespace std;

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define in(x) cin >> x
#define out(str) cout << str << endl

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int N;

int main(){
    cin>>N;
    int a[N][3];
    rep(i,N){
        rep(j,3){
            cin>>a[i][j];
        }
    }
    rep(i,N){
        sort(a[i],a[i]+3);
        if(pow(2,a[i][0])+pow(2,a[i][1])==pow(2,a[i][2])){
            out("Yes");
        }
        else{
            out("No");
        }
    }
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include<cmath>
#include<cctype>
#include<iomanip>
#include<fstream>
#include<sstream>

using namespace std;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define si size()
#define fr front()
#define ba back()
#define tp top()

typedef long long int ll;
typedef long double ld;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef pair<int,pii> pip;
typedef pair<pii,pii> ppp;
typedef pair<double,double> pdd;
typedef pair<double,pdd> pddd;

#define CASE() for(int Case=1;Case<=Tc;Case++)
#define iofast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const int adj[8][2]={{-1,0},{0,-1},{1,0},{0,1},{-1,-1},{-1,1},{1,1},{1,-1}};
const int INF=1e9;
const ll MOD=1e9+7;
const double EPS=1e-9;
const int SIZE=64;

int main (){
	
	int N;
	int a, b, c;
	scanf("%d", &N);
	while(N--){
		scanf("%d %d %d", &a, &b, &c);
		if(((a*a)+(b*b)==(c*c)) || ((c*c)+(b*b)==(a*a)) || ((a*a)+(c*c)==(b*b))) printf("YES\n");
		else printf("NO\n");
	}
	
	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" << endl;
    } else if (b*b == a*a+c*c){
      cout << "YES" << endl;
    } else if (c*c == a*a+b*b){
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }

  return 0;
}

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

C++: #include<stdio.h>
int main(void)
{
	int n,i,w,a,s,d,x,j,z[1000];
	while(scanf("%d",&n)!=EOF){
		for(i=0;i<n;i++){
			scanf("%d %d %d",&a,&s,&d);
			if(a>s&&d<a){
				w=(d*d)+(s*s);
				x=a*a;
					if(w==x){
						z[i]=1;
					}
					else{
						z[i]=0;
					}	
			}	
			if(a<d&&d>s){
				w=(a*a)+(s*s);
				x=d*d;
					if(w==x){
						z[i]=1;
					}
					else{
						z[i]=0;
					}				
			}
			if(a<s&&s>d){
				w=(d*d)+(s*s);
				x=s*s;
					if(w==x){
						z[i]=1;
					}
					else{
						z[i]=0;
					}				
			}
			if(a==s&&s==d){
				z[i]=0;
			}	
		for(i=0;i<n;i++){
			if(z[i]==1){
				printf("YES\n");
			}	
			if(z[i]==0){
				printf("NO\n");
			}
		}	
		}
	}
	return 0;
}

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

bool tri(int x,int y,int z){
	return (x*x+y*y==z*z)?1:0;
}

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