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 <iostream>
#include <vector>

bool check_right_triangle(int a, int b, int c)
{
    if(a * a == b * b + c * c || b * b == c * c + a * a || c * c == a * a + b * b)
        return true;
    else return false;
}

int main()
{
    const int max_num_of_data = 1000;
    const int min = 1;
    const int max = 1000;
    
    int num_of_data;
    //std::cout << "データ数の入力" << std::endl;
    std::cin >> num_of_data;
    if(num_of_data > max_num_of_data){
        std::cout << "データ数<=" << max_num_of_data << std::endl;
        return 1;
    }
    
    int a, b, c;
    //std::cout << num_of_data << "個の整数データa b cの入力" << std::endl;
    for(int i = 0; i < num_of_data; ++i){
        std::cin >> a >> b >> c;
        if(min <= a && a <= max && min <= b && b <= max && min <= c && c <= max){
            if(check_right_triangle(a, b, c))
                std::cout << "Yes" << std::endl;
            else
                std::cout << "No" << std::endl;
        }else{
            --i;
            std::cout << "整数は" << min <<"以上" << max << "以下に設定" << std::endl;
        }
    }

    return 0;
}

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

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

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

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

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

int main() {
	// your code goes here
	int n;
	cin >> n;
	for (int i;i<n;i++) {
		int a,b,c,aa,bb,cc;
		cin >> a >> b >> c;
		if (a>b&&a>c) {
			aa = a;
			bb = b;
			cc = c;
		}
		if (b>a&&b>c) {
			aa = b;
			bb = a;
			cc = c;
		}
		if (c>a&&c>b) {
			aa = c;
			bb = a;
			cc = b;
		}
		
		if (aa*aa == bb*bb + cc*cc) {
			cout << "YES" << endl;
		}
		if (aa*aa != bb*bb + cc*cc) {
			cout << "NO" <<endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <math.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
#define rep(I,N) for(int I = 0; I < (int)(N); I++)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;

int main(void){
	int N;
	cin >> N;
	rep(k, N){
		int a, b, c;
		cin >> a >> b >> c;
		a = pow(a, 2);
		b = pow(b, 2);
		c = pow(c, 2);
		FIN(a);
		FIN(b);
		FIN(c);
		bool flag = false;
		if(sqrt(c) == sqrt(a + b))flag = true;
		if(sqrt(b) == sqrt(a + c))flag = true;
		if(sqrt(a) == sqrt(b + c))flag = true;
		if(flag)cout << "YES"<<endl;
		else FIN("NO");

	}

	return 0;	
}

C++: /* All men have limits. They learn what they are and learn
   not to exceed them, I ignore mine. -Batman           */
#include <bits/stdc++.h>
//#include <iostream>
//#include <vector>
//#include <Windows.h>
using namespace std;

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

return 0;
}

C++: #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_output(v) for(auto it=v.begin();it!=v.end();it++){if(it!=v.begin())cout<<" ";cout<<*it;}cout<<endl;
#define vec_debug(v) for(auto it=v.begin();it!=v.end();it++){cerr<<*it<<" ";}cerr<<endl;
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
using namespace std;
using ll = long long;
template <typename T>T digitsum(T n);
template <typename T>bool isPrime(T n);
template <typename T>vector<pair<T, T>> prime_factor(T n);
long long int intpow(long long int,long long int);
template <typename T>T intlog(T);
long long int combination(long long int,long long int);
long long int series_sum(long long int);

int main(){
    int t,a,b,c,maxv,minv,mid;
    cin>>t;
    rep(l,t){
        cin>>a>>b>>c;
        maxv=max(a,max(b,c));
        minv=min(a,min(b,c));
        mid=a+b+c-minv-maxv;
        YN(maxv*maxv==minv*minv+mid*mid);
    }
}

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

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

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

using namespace std;

int main()
{
	int n;
	int deta[3];
	int square;

	cin >> n;
	
	for (int i = 0; i < n; i++){
		for (int j = 0; j < 3; j++){
			cin >> deta[j];
		}
		
		sort (deta, deta + 3);

		square = (deta[0] * deta[0]) + (deta[1] * deta[1]);

		if (square == deta[2] * deta[2]){
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}

	return 0;
}

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

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

C++: #!/usr/bin/env ruby

n = gets.split[0].to_i
1.upto(n) do |i|
  line = gets
  a, b, c = line.split.map {&:to_i}.sort
  if a ** 2 + b ** 2 == c ** 2
    puts "YES"
  else
    puts "NO"
  end
end

C++: #include <iostream>

using namespace std;

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

    cin >> n;
    while (n--) {
        cin >> a >> b >> c;
        a *= a;
        b *= b;
        c *= c;

        if ((a + b - c == 0) || (a + c - b == 0) || (b + c - a == 0))
            cout << "YES\n";
        else
            cout << "NO\n";
    }

    return 0;
}