杭电1021:http://acm.split.hdu.edu.cn/showproblem.php?pid=1021
此题递归数据太大,会超时,直接找规律:
#include <iostream>
using namespace std;
int main()
{
int num;
while(cin>>num)
{
if(num==0)
cout<<"no"<<endl;
if(num%4==2)
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
}
杭电1064:http://acm.split.hdu.edu.cn/showproblem.php?pid=1064
#include <iostream>
using namespace std;
int main()
{
double money[12];
double money_ave=0,money_sum=0;
for(int i=0;i<12;i++)
{
cin>>money[i];
money_sum+=money[i];
}
money_ave=money_sum/12;
cout<<"$"<<money_ave<<endl;
return 0;
}
杭电2042:http://acm.split.hdu.edu.cn/showproblem.php?pid=2042
ps:这题题目好操蛋......
#include <iostream> using namespace std; int main() { int n,a; cin>>n; int num; while(n--) { num=3; cin>>a; for(int i=1;i<=a;i++) { num=(num-1)*2;//递归 } cout<<num<<endl; } return 0; }
杭电2039:http://acm.split.hdu.edu.cn/showproblem.php?pid=2039
#include <iostream> using namespace std; int main() { int m; double a,b,c; //三个正数 cin>>m; while(m--) { cin>>a>>b>>c; if((a+b>c)&&(a+c>b)&&(b+c>a)) { cout<<"YES"<<endl; } else cout<<"NO"<<endl; } return 0; }
杭电2071:http://acm.split.hdu.edu.cn/showproblem.php?pid=2071
#include <iostream> #include <iomanip> using namespace std; int main() { int t; cin>>t; while(t--) { int n; cin>>n; double height[101]={0}; double max=0; double temp; for(int i=1;i<=n;i++) { cin>>height[i]; if(max<height[i]) max=height[i]; } cout<<fixed<<setprecision(2)<<max<<endl; } return 0; }
杭电2042:http://acm.split.hdu.edu.cn/showproblem.php?pid=2042
ps:这题题目好操蛋......
#include <iostream> using namespace std; int main() { int n,a; cin>>n; int num; while(n--) { num=3; cin>>a; for(int i=1;i<=a;i++) { num=(num-1)*2;//递归 } cout<<num<<endl; } return 0; }