hdu 2393 Higher Math
来源:互联网 发布:数据库设计经典案例 编辑:程序博客网 时间:2024/04/30 18:54
Higher Math
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2291 Accepted Submission(s): 1262
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int max(int a,int b){ int T; if(a>b) { T=a; a=b; b=T; } return b;}int main(){ __int64 a[5]; int cas; cin>>cas; int t=1; while(cas--) { cin>>a[1]>>a[2]>>a[3]; cout<<"Scenario #"<<t<<":"<<endl; if(a[1]&&a[2]&&a[3]) { sort(a+1,a+4); if(a[3]*a[3]==a[2]*a[2]+a[1]*a[1]) cout<<"yes"<<endl<<endl; else cout<<"no"<<endl<<endl; } else cout<<"no"<<endl<<endl; t++; } return 0;}
0 0
- hdu 2393 Higher Math
- HDU 2393 Higher Math
- HDU - 2393 Higher Math
- hdu 2393 Higher Math
- HDU 2393 Higher Math
- HDU 2393 Higher Math
- HDU 2393 Higher Math
- hdu 2393(Higher Math)
- hdu 2393 Higher Math
- HDU Higher Math
- hd 2393 Higher Math
- HDU 2393 Higher Math 计算是否是直角
- Higher Math
- Higher Math
- Higher Math
- Higher Math
- Higher Math
- Higher Math
- hdu 1207 汉诺塔II
- POJ 3628 Bookshelf 2 (01背包)
- 使用STL的next_permutation函数生成全排列(C++)
- bzoj1050 [HAOI2006]旅行comf
- PL/SQL编程基础(章节摘要)
- hdu 2393 Higher Math
- (HTML学习)常用标签 超链接颜色控制
- HDUJ 1013 Digital Roots
- JavaFX文档(2)什么是JavaFX
- EBS R12多组织访问控制
- C++ map的基本操作和使用
- FileReader读取中文txt文件编码丢失问题
- 走好下一步为要
- HDU1285 确定比赛名次 【拓扑排序】