HDU--2005-TO-2009--假期实在是太无聊了....

题目链接:https://vjudge.net/contest/355760  password:123

HDU2005:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=1e5+10;
#define PI acos(-1)
int year,month,day; 
bool check(int a){
	if((a%4!=0)||(a%100==0&&a%400!=0))
		return false;
	else
		return true;
}
int main(){
	int a[]={0,31,28,31,30,31,30,31,31,30,31,30,31};//365
	int b[]={0,31,29,31,30,31,30,31,31,30,31,30,31};//366
	while(scanf("%d/%d/%d",&year,&month,&day)!=EOF){//输入格式YYYY/MM/DD
		bool flag=check(year);//true==闰年29天 
		if(flag){
			int sum=0;
			for(int i=0;i<month;i++)
				sum+=b[i];
			printf("%d\n",sum+day);
		}else{
			int sum=0;
			for(int i=0;i<month;i++)
				sum+=a[i];
			printf("%d\n",sum+day);
		}
	}
	return 0;
} 
/*Sample Input
1985/1/20
2006/3/12

Sample Output
20
71*/

HDU2006:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=1e5+10;
int a[MAX],n;
int main(){
	while(scanf("%d",&n)!=EOF){
		long long int sum=1;
		for(int i=0;i<n;i++)
			scanf("%d",&a[i]);
		for(int i=0;i<n;i++){
			if(a[i]%2)
				sum=sum*a[i];
		}
		printf("%lld\n",sum);
		
	}	
}
/*Sample Input
3 1 2 3
4 2 3 4 5
Sample Output
3
15*/ 

HDU2007:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=1e5+10;
int main(){
	int a,b;
	while(scanf("%d%d",&a,&b)!=EOF){
		int suma=0,sumb=0;
		if(a>b)
			swap(a,b);
		for(int i=a;i<=b;i++){
			if(i%2==0)
				suma+=i*i;
			else
				sumb+=i*i*i;
		}
		printf("%d %d\n",suma,sumb);
	}
}
/*Sample Input
1 3
2 5
Sample Output
4 28
20 152*/

HDU2008:

#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=1e5+10;
int main(){
	int n;
	float a[MAX];
	while(scanf("%d",&n)&&n){
		int cnt1=0,cnt2=0,cnt3=0;
		for(int i=0;i<n;i++)
			scanf("%f",&a[i]);
		for(int i=0;i<n;i++){
			if(a[i]<0)	cnt1++;
			else if(a[i]==0)	cnt2++;
			else 	cnt3++;
		}
		printf("%d %d %d\n",cnt1,cnt2,cnt3);
	}
	return 0;
}
/*Sample Input
6 0 1 2 3 -1 0
5 1 2 3 4 0.5
0 
Sample Output
1 2 3
0 0 5*/

HDU2009:

#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX=1e5+10;
int main(){
	double n,m;
	while(scanf("%lf %lf",&n,&m)!=EOF){
		double sum=0;
		for(int i=0;i<m;i++){
			sum+=n;
			n=sqrt(n);
		}
		printf("%.2lf\n",sum);
	}
}
/*Sample Input
81 4
2 2
Sample Output
94.73
3.41*/
发布了150 篇原创文章 · 获赞 73 · 访问量 6593

猜你喜欢

转载自blog.csdn.net/queque_heiya/article/details/104209773