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 <algorithm>
#include <sstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
using namespace std;

int main()
{

	double n, a, b, c, x, y, z;
	cin >> n;

	for (int i = 0; i < n; i++) {
		cin >> a >> b >> c;
		if (a >= max(b, c)) {
			z = a; x = b; y = c;
		}
		else if (b >= max(a, c)) {
			z = b; x = a; y = c;
		}
		else if (c >= max(a, b)) {
			z = c; x = a; y = b;
		}

		if (z * z == x * x + y * y) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
}

C++: #include<string>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<functional>
#include<map>
#include<set>
#include<cmath>

#define REP(i,s,e) for(int i=int(s);i<int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)


using namespace std;

int main(){

int N;
cin >> N;

int a,b,c;
rep(i,N){

cin >> a >> b >> c;

if(a*a==b*b+c*c || b*b==a*a+c*c || c*c==b*b+a*a)
cout << "YES" << endl;
else cout << "NO" << endl;

}

return 0;

}

C++: #include <stdio.h>

int IsRightTriangle(int a, int b, int c);

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

    scanf("%d", &n);
    for (int i=0; i<n; i++){
        scanf("%d %d %d", &a, &b, &c);
        if (IsRightTriangle(a,b,c)){
            printf("YES\n");
        } else {
            printf("NO\n");
        }
    }
    return 0;
}

int IsRightTriangle(int a, int b, int c){
    if (a*a == b*b + c*c) return 1;
    if (b*b == c*c + a*a) return 1;
    if (c*c == a*a + b*b) return 1;
    return 0;
}

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>

using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)


int main()
{
	int n;
	cin >> n;
	REP(i, n){
		int a[3];
		cin >> a[0] >> a[1] >> a[2];
		sort(a, a + 3);
		string ans = a[2] * a[2] == a[1] * a[1] + a[0] * a[0] ? "YES" : "NO";

		cout << ans << endl;
	}
	return 0;
}

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

using namespace std;

int main()
{
	int num;

	cin >> num;

	for(int ix = 0;ix != num;++ix){
		int set[3];
		cin >> set[0] >> set[1] >> set[2];
		if((set[0]*set[0] + set[1]*set[1])==set[2]*set[2])
			cout <<"YES"<<endl;
		else
			cout <<"NO"<<endl;
	}

	return 0;
}

C++: n = int(input())
for i in range(n):
  h = list(map(int,input()))
  h.sort()
  if h[0]**2 ++ h[1]**2 == h[2]**2:
    print('YES')
  else:
    print('NO')

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

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

	int t;
	cin >> t;
	while(t--){
		int a, b, c;
		cin >> a >> b >> c;
		int can_1 = b * b + c * c - a * a;
		int can_2 = a * a + b * b - c * c;
		int can_3 = c * c + a * a - b * b;
		if(can_1 == 0 || can_2 == 0 || can_3 == 0)puts("YES");
		else puts("NO");
	}
	return 0;
}
// Write Here

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main(){

    int n;
    scanf("%d",&n);
    while(n--)
    {
        int a[3];
        for(int i=0;i<3;i++)
        {
            scanf("%d",&a[i]);
            a[i]*=a[i];
        }
        int maxSide=a[0];
        int sum=0;
        for(int i=1;i<3;i++)
        {
            if(a[i]>maxSide)
            {
                sum+=maxSide;
                maxSide=a[i];
            }
            else
                sum+=a[i];
        }
        if(sum==maxSide)
            printf("YES\n");
        else
            printf("NO\n");

    }

    return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;
int main(){
	int t,s=-1,j;
	cin>>t;
	while(t--){
		int a[3],x=0;
		for(int i=0;i<3;i++){
			cin>>a[i];
			if(s<a[i]) j=i;
		//	x+=a[i];
		}
	    //x-=a[j];
	    //if(x<a[j]) cout<<"NO"<<endl;
	  //  else{
	    	x=0;
	    	for(int i=0;i<3;i++){
	    	 a[i]=pow(a[i],2);
	    	 if(i!=j) x+=a[i];
	        }
	        if(a[j]==x) 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;
	cout << ((a*a+b*b==c*c || b*b+c*c==a*a || a*a+c*c==b*b)? "YES": "NO") << endl;
  }
}

C++: #include <string>
#include <vector>
#include <iostream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <cmath>
#include<algorithm>
using namespace std;
int main()
{
    int x,a[3];
    cin>>x;
    for(int i=1;i<x+1;i++){
        cin>>a[0]>>a[1]>>a[2];
        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<stdio.h>
int main(){
	int a;
	int b;
	int c;
	int x;
	int y=1;
	int z;
	scanf("%d",&x);
		while(y<=x){
		scanf("%d",&a);
		scanf("%d",&b);
		scanf("%d",&c);
		if(c>=b){
			z=c;
			c=b;
			b=z;
		}
		if(a<=c){
			z=a;
			a=b;
			b=c;
			c=z;
		}
		else if(b>=a){
			z=b;
			b=a;
			a=z;
		}
	z=a*a-b*b-c*c;
	if(z==0)
		puts("YES");
	else
		puts("NO");
	y++;
	}
return(0);
}

C++: #define scanf_s scanf
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX 200
int main(void)
{
	int n,a, b, c,x, sum, cou = 0;
	scanf_s("%d", &n);
	for (int i = 0; i < n; ++i) {
		scanf_s("%d %d %d", &a, &b, &c);
		if (a > b) {
			x = a; a = b; b = x;
		}
		if (b > c) {
			x = b; b = c; c = x;
		}
		if(c* c == a*a + b * b)	printf("YES\n");
		else printf("NO\n");
	}
}

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

int main(){
  int a[3], n, mx;
  cin >> n;
  while(n--){
    cin >> a[0] >> a[1] >> a[2];
    mx = max(max(a[0],a[1]),a[2]);
    if(a[0]==mx)
      a[0]=0;
    else if(a[1]==mx)
      a[1]=0;
    else
      a[2]=0;
    if(mx*mx == a[0]*a[0]+a[1]*a[1]+a[2]*a[2])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}

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

int main()
{
	int a,b,c;
	int x=0;
	int n;
	cin >> n;
	for(int i=0 ;i<n ;i++){
		cin >> a >> b >> c;
		if(a<b && c<b){
			x=a;
			a=b;
			b=x;
		}
		else if(a<c && b<c){
			x=a;
			a=c;
			c=x;
		}

		if((b*b)+(c*c) == (a*a))
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	return 0;
}

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

const char* judge_right_triangle(int, int, int);

int main(void)
{
    int a, b, c, n;
    cin >> n;
    for (int i = 0; i < n; i++ ) {
        cin >> a >> b >> c;
        cout << judge_right_triangle(a, b, c) << endl;
    }
    return 0;
}

const char* judge_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 "YES";
    } else {
        return "NO";
    }
}