//模板开始
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <fstream>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<iomanip>
#define SZ(x) (int(x.size()))
using namespace std;
int toInt(string s){
istringstream sin(s);
int t;
sin>>t;
return t;
}
template<class T> string toString(T x){
ostringstream sout;
sout<<x;
return sout.str();
}
typedef long long int64;
int64 toInt64(string s){
istringstream sin(s);
int64 t;
sin>>t;
return t;
}
template<class T> T gcd(T a, T b){
if(a<0)
return gcd(-a, b);
if(b<0)
return gcd(a, -b);
return (b == 0)? a : gcd(b, a % b);
}
//模板结束(通用部分)
//【练习02】 简单题(2)1001 Higher Math
int main()
{
//ifstream ifs("shuju.txt", ios::in);
int cases;
long long a, b, c;
//ifs>>cases;
cin>>cases;
for(int i = 0; i < cases; i++)
{
//ifs>>a>>b>>c;
cin>>a>>b>>c;
if((a * a + b * b) == c * c || (a * a + c * c) == b * b || (b * b + c * c) == a * a)
{
cout<<"Scenario #"<<i + 1<<":"<<endl;
cout<<"yes"<<endl<<endl;
}
else
{
cout<<"Scenario #"<<i + 1<<":"<<endl;
cout<<"no"<<endl<<endl;
}
}
return 0;
}
【练习02】 简单题(2)1001 Higher Math
最新推荐文章于 2024-08-15 20:46:09 发布