Go: package main

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

func sliceAtof64(sa []string) ([]float64, error) {
	si := make([]float64, 0, len(sa))
	for _, a := range sa {
		i, err := strconv.ParseFloat(a, 64)
		if err != nil {
			return si, err
		}
		si = append(si, i)
	}
	return si, nil
}

func answer(ans bool) {
	if ans {
		fmt.Println("YES")
	} else {
		fmt.Println("NO")
	}
}
func isRightTriangle(ary []float64) (ans bool) {
	sort.Sort(sort.Reverse(sort.Float64Slice(ary)))
	ans = math.Pow(ary[1], 2.0)+math.Pow(ary[2], 2.0) == math.Pow(ary[0], 2.0)

	return
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	lineCount, _ := strconv.Atoi(scanner.Text())
	lines := make([]string, lineCount)

	for i := 0; i < lineCount; i++ {
		scanner.Scan()
		lines[i] = scanner.Text()
	}

	for _, v := range lines {
		ary, _ := sliceAtof64(strings.Split(v, " "))
		answer(isRightTriangle(ary))
	}
}

C++: #include <iostream>
 
int main(){
 
    int a[3];
    int i,j;
    std::cin >> j;
 
    for(i=0;i<j;i++){
        std::cin >> a[0] >> a[1] >> a[2];
        if(a[0]>a[1]){
	int sum=a[0];
	a[0]=a[1];
	a[1]=sum;
        }
        if(a[1]>a[2]){
	int sum1=a[1];
	a[1]=a[2];
	a[2]=sum1;
        }
        if(a[0]>a[1]){
	int sum2=a[0];
	a[0]=a[1];
	a[1]=sum2;
        }
        if(a[2]*a[2]==a[0]*a[0]+a[1]*a[1])
             std::cout << "YES" << std::endl;
        else
             std::cout << "NO" << std::endl;
        }
        return 0;
}

C++: #include<stdio.h>
int main(){
  int n,i,j,l;
  int data[3];
  scanf("%d",&n); 
  for(l=0;l<n;l++){
    scanf("%d %d %d",&data[0],&data[1],&data[2]);
    for(i=0;i<2;i++){
      for(j=0;j<2-i;i++){
	if(data[j]>data[j+1]){
	  int temp;
	  temp=data[j];
	  data[j]=data[j+1];
	  data[j+1]=temp;
	}
      }
    }
    if(data[0]*data[0]+data[1]*data[1]==data[2]*data[2]){
      printf("YES\n");
    } else{
      printf("NO\n");
    }
  }
  return(0);
}

C++: #include<iostream>
using namespace std;
int main(){
  int a,b,c,N;
    
  cin >> N;
  bool count[N];
  for(int i=0;i<N;i++){
    cin >> a >> b >> c;
    if(a*a==b*b+c*c || b*b==a*a+b*b || c*c==a*a+b*b){
      count[i]=true;}
  }
  for(int i=0;i<N;i++){
    if(count[i]==true){
      cout << "YES" << endl;}

    else {
      cout << "NO" << endl;}
  }
 
  return 0;
}

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

using namespace std;

int power(int a, int n){
  int result = a;
  for(int i = 1; i < n; i++){
    result *= a;
  }
  return result;
}

int main(){
  int n;
  cin >> n;
  vector<bool> result;
  for(int i = 0; i < n; i++){
    vector<int> tri;
    for(int j = 0; j < 3; j++){
      int tmp;
      cin >> tmp;
      tri.push_back(tmp);
    }
    sort(tri.begin(),tri.end());
    if(power(tri[0],2) + power(tri[1],2) == power(tri[2],2)){
      result.push_back(true);
    }else{
      result.push_back(false);
    }
  }
  for(int i = 0; i < n; i++){
    if(result[i]){
      cout << "YES\n";
    }else{
      cout << "NO\n";
    }
  }
  return 0;
}

C++: #include <cstdio>

using namespace std;

bool valid(int a, int b, int c) {
  int a2 = a*a, b2 = b*b, c2 = c*c;
  return (a2+b2==c2) || (b2+c2==a2) || (c2+a2==b2);
}

int main() {
  int N;
  scanf("%d", &N);
  for (int i=0;i<N;i++) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    if (valid(a, b, c)) puts("YES");
    else puts("NO");
  }
  return 0;
}

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

int main() {
  int a,b,c;
  scanf("%d %d %d", &a, &b, &c); 
  std::vector<int> v;
  v.push_back(a);
  v.push_back(b);
  v.push_back(c);
  sort(v.begin(),v.end());
  if((a*a)+(b*b)==(c*c)) {
    std::cout << "YES" << std::endl;
  }
  else {
    std::cout << "NO" << std::endl;
  }
}

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

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int edges[3];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 3; j++) cin >> edges[j];
        sort(edges, edges + 3);
        cout << (edges[0] * edges[0] + edges[1] * edges[1] ==
                         edges[2] * edges[2]
                     ? "YES"
                     : "NO")
             << endl;
    }

    return EXIT_SUCCESS;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define INF 1<<25

using namespace std;

int edg[3], n;

int main()
{
	cin >> n;

	FOR(i, 0, n)
	{
		int flg = 0;

		FOR(j, 0, 3)
		{
			cin >> edg[j];
		}

		FOR(j, 0, 3)
		{
			if( edg[0]*edg[0] == edg[1]*edg[1] + edg[2]*edg[2] )
			{
				cout << "YES" << endl;
				flg = 1;
				break;
			}

			int tmp = edg[0];
			edg[0] = edg[1];
			edg[1] = edg[2];
			edg[2] = tmp;

		}

		if(!flg)
			cout << "NO" << endl;

	}

	return 0;

}

C++: #include <iostream>
#include <cstdio>
#define NMAX (1000)
using namespace std;
int main(void){
    
    int N = 0;
    int a=0;
    int b=0;
    int c=0;
    char* Result[NMAX];

    //N??°?????\???
    scanf("%d",&N);
    
    //N?????°???????????????a,b,c???????????????
    for(int Ncount = 0; Ncount < N; Ncount++){
        scanf("%d %d %d",&a,&b,&c);
        
        if( (( (a^2) + (b^2) ) == (c^2)) || (( (b^2) + (c^2) ) == (a^2)) || (( (c^2) + (b^2) ) == (a^2))){
            Result[Ncount] = "Yes";
        }else{
            Result[Ncount] = "NO";
        }
    }
    
    //??????????????????????????¨???Yes or No?????????
    for(int Ncount=0;Ncount < N;Ncount++){
        printf("%s\n",Result[Ncount]);
    }
    
}

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

bool solve() {
	int edges[3];
	for(auto &e : edges) cin >> e;
	sort(edges, edges + 3);
	return edges[0] * edges[0] + edges[1] * edges[1] == edges[2] * edges[2];
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int t;
	cin >> t;
	while(t--) cout << (solve() ? "YES" : "NO") << endl;

	return EXIT_SUCCESS;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
int x[3];
cin>>N;
while(N){
for(int i=0;i<3;i++){
cin>>x[i];
}
sort(x,x+3);
if(x[2]^2==x[1]^2+x[0]^2)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
N--;
}
return 0;
}

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


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

C++: #include<iostream>
using namespace std;
int main() {
	int x,y,n, i, j,a[10000],b[10000],c[10000];
	cin >> n;
	for (i = 0; i < n; i++) {
		cin >> a[i] >> b[i] >> c[i];
		x = a[i] * a[i] + b[i] * b[i];
		y = c[i] * c[i];
		if (x == y) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
	
	
	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int n,date[3],i;
	scanf("%d",&n);
	for(i=0;i<n;i++) {
		scanf("%d %d %d",&date[0],&date[1],&date[2]);
		sort(date,date+3);
		if(date[2]*date[2]==(date[0]*date[0])+(date[1]*date[1])) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
}

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

int main(){
	int length;
	std::cin >> length;
	for (int i = 0; i < length; i++)
	{
		std::vector<int> side;
		for (int j = 0; j < 3; j++)
		{
			int scan_num;
			std::cin >> scan_num;
			side.push_back(scan_num);
		}
		std::sort(side.begin(), side.end());
		if (side[0] * side[0] + side[1] * side[1] == side[2] * side[2])
			std::cout << "YES\n";
		else
			std::cout << "NO\n";
	}
	return 0;

}