# Light OJ 1053 – Higher Math

```
/*
User ID:
*/

#include &lt;bits/stdc++.h&gt;

#define pii pair &lt;int,int&gt;
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1&lt;&lt;29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf(&quot;%d&quot;,&amp;a)
#define loop(i,n) for(int i=0;i&lt;n;i++)
#define TEST_CASE(t) for(int z=1;z&lt;=t;z++)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

int main()
{
///freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
///freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);
int t;
cin&gt;&gt;t;
long long ara[5];
TEST_CASE(t)
{
cin&gt;&gt;ara[0]&gt;&gt;ara[1]&gt;&gt;ara[2];
sort(ara,ara+3);
pf(&quot;Case %d: &quot;,z);
if((ara[0]*ara[0]+ara[1]*ara[1])==ara[2]*ara[2])
pf(&quot;yes\n&quot;);
else
pf(&quot;no\n&quot;);
}
return 0;
}

```