LightOJ 1053 Higher Math Solution

Problem Link:  https://lightoj.com/problem/higher-math

 Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i,j,a[5],s;

    cin>>t;

    for(i=1; i<=t; 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]))

                printf("Case %d: yes\n",i);

                else

                    printf("Case %d: no\n",i);

        }

}