Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Split(bufio.ScanWords)
	li := make([]int, 3)

	sc.Scan()
	N, _ := strconv.Atoi(sc.Text())

	for i := 0; i < N; i++ {
		for j := 0; j < 3; j++ {
			sc.Scan()
			x, _ := strconv.Atoi(sc.Text())
			li[j] = x
		}
		sort.Ints(li)

		switch li[2]*li[2] == li[1]*li[1]+li[0]*li[0] {
		case true:
			fmt.Println("YES")
		case false:
			fmt.Println("NO")
		default:
		}
	}

}

C++: #include<iostream>                                                                
#include<queue>                                                                   
using namespace std;                                                              
                                                                                  
int main(void) {                                                                  
  priority_queue<int> q;                                                          
  int N, a, b, c;                                                                 
  cin >> N;                                                                       
  for (int i=0; i<N; i++) {                                                       
    cin >> a >> b >> c;                                                           
    q.push(a);                                                                    
    q.push(b);                                                                    
    q.push(c);                                                                    
    a=q.top();                                                                    
    q.pop();                                                                      
    b=q.top();                                                                    
    q.pop();                                                                      
    c=q.top();                                                                    
    q.pop();                                                                      
    bool f=false;                                                                 
    if (a*a==(b*b+c*c)) {                                                         
      f=true;                                                                     
    }                                                                             
    if (f) {                                                                      
      cout << "YES" << endl;                                                      
    } else {                                                                      
      cout << "NO" << endl;                                                       
    }                                                                             
  }                                                                               
  return 0;                                                                       
}

C++: #include <iostream>
bool isRight(int a, int b, int c)
{
    //?????§???c??????????????????????????´???
    if (a > c) {
        std::swap(a, c);
    }
    if (b > c){
        std::swap(b, c);
    }
    
    return a * a + b * b == c * c;
}

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

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

int max(int,int,int);

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

  int tri[n][3];
  
  int i=0;
  for(i;i<n;i++){
      scanf("%d %d %d",&tri[i][0],&tri[i][1],&tri[i][2]);
	}

  i=0;
  int judge[n];
  for(i;i<n;i++){
    int j=1;
    for(j;j<3;j++){
	if(tri[i][0]<tri[i][j]){
	  int t=tri[i][0];
	  tri[i][0]=tri[i][j];
	  tri[i][j]=t;
	}
      }
    j=1;
    for(j;j<3;j++){
	if(tri[i][0]<tri[i][j]){
	  int t=tri[i][0];
	  tri[i][0]=tri[i][j];
	  tri[i][j]=t;
	}
      }
    if(pow(tri[i][0],2.0)==pow(tri[i][1],2.0)+pow(tri[i][2],2.0))
      judge[i] = 1;
    if(judge[i]==1)
      printf("YES\n");
    else
      printf("NO\n");
  }
}

C++: #include<stdio.h>
#include<string.h>
#define N 3

int main()
{
    int i, j, a, b, c;
    int A[N][N];

    scanf("%d",&a);
    if(a<=1000){
        for(i=0;i<a;i++){
            for(j=0;j<N;j++){
                scanf("%d", &b);
                if(1>b || b>1000){   
                    return 1;
                }else{
                    if(j!=0 && b<A[i][j-1]){
                        c = A[i][j-1];
                        A[i][j-1] = b;
                        A[i][j] = c;
                    }else{
                        A[i][j] = b;
                    }
                }
            }

        }
        for(i=0;i<a;i++){
            if(A[i][0]*A[i][0]+A[i][1]*A[i][1]==A[i][2]*A[i][2]){
                printf("YES\n");
            }else{
                printf("NO\n");
            }
        }
    }
    return 0;
}

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

int main(){
	int n;
	int in[3];
	bool ans[1000];
	std::cin >> n;
	for (int i = 0; i < n; ++i){
		std::cin >> in[0] >> in[1] >> in[2];
		std::sort(std::begin(in), std::end(in));
		ans[i] = (in[2] * in[2] == in[0] * in[0] + in[1] * in[1]);
	}
	for (int i = 0; i < n; ++i){
		if (ans[i])std::cout << "YES" << std::endl;
		else std::cout << "NO" << std::endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long int ll;
const int INF = 100000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
    int n;
    cin >> n;
    rep(i, n){
        int a[3];
        cin >> a[0] >> a[1] >> a[2];
        sort(a, a+3);
        if(a[2]*a[2] == (a[1]*a[1] + a[0]*a[0])){
            cout << "YES" << endl;
        }else{
            cout << "NO" <<endl;
        }
    }
    return 0;    
}

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

int main(){

int num;


cin >> num;

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

C++: #include<iostream>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,a,b,c;
    cin >> n;
    while(n--){
        cin >> a >> b >> c;
        if(a<b) swap(a,b);
        if(a<c) swap(a,c);
        if((a*a)==(b*b+c*c))    cout << "YES\n";
        else cout << "NO\n";
    }
}

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

	

    return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

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