蓝桥杯入门刷题训练——模拟1

题目一：成绩分析

#include <stdio.h>
int main()
{
int a,argv[10000],temp1,temp2,sum=0;
float aver;
scanf("%d",&a);
for(int i=0;i<=a-1;i++)
	{
	scanf("%d",&argv[i]);
	sum+=argv[i];
	}
temp1=argv[0];
temp2=argv[0];
for(int i=1;i<=a-1;i++)
{
if(temp1<argv[i]){
 temp1=argv[i];
				 }
if(temp2>argv[i]){
 temp2=argv[i];
				 }
}
aver = (float)sum/a;
printf("%d\n",temp1);
printf("%d\n",temp2);
printf("%5.2f\n",aver);
  return 0;
}

题目二：特殊日期

#include<stdio.h>
int waiting (int a[7],int sum);//一个月31天
int hall (int b[4],int sum4);//一个月30天
int dengdaiting(int sum5);//2月29
int huoerge(int sum6);//2月28
int main()
{
	int sum = 0,sum2=0,sum3=0,sum4=0,sumall=0,year = 1900;
	int month1[7]={1,3,5,7,8,1,3};
	int month2[4]={4,6,9,2};
for(;year<=9999;year++){
for(int i = 1;i <= 1000;i = i * 10){
	int temp;
	temp = year/i%10;
	sum += temp;
}
if((year%4==0&&year%100!=0)||(year%400==0))//判断是不是闰年，是1，不是0
	{
	sum2+=waiting(month1,sum);
	sum3+=hall(month2,sum);
	sum4+=dengdaiting(sum);
	sumall+=sum2+sum3+sum4;
	sum2=0,sum3=0,sum4=0;
	}
	else{
		sum2+=waiting(month1,sum);
		sum3+=hall(month2,sum);
		sum4+=huoerge(sum);
		sumall+=sum2+sum3+sum4;
		sum2=0,sum3=0,sum4=0;
	}
	sum=0;
};
printf("%d",sumall);
	return 0;
}

int waiting (int a[7],int sum){
	int day2[31]={1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,11,3,4};
	int hxl,sum3=0;
	for(int i=0;i<=6;i++)
	{
		hxl=sum-a[i];
	for(int k=0;k<=30;k++)
		{
		if(day2[k]==hxl)
			{
			sum3+=1;
			}
		}
	}
	return sum3;
}

int hall (int b[4],int sum){
		int day2[30]={1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,11,3};
		int hxl,sum4=0;
		for(int i=0;i<=3;i++)
		{
			hxl=sum-b[i];
		for(int k=0;k<=29;k++)
			{
			if(day2[k]==hxl)
				{
				sum4+=1;
				}
			}
		}
		return sum4;
}

int dengdaiting(int sum5){
	int hxl,sum7=0;
	int feb[29]={1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10,11};
	hxl=sum5-2;
	for(int k=0;k<=28;k++)
		{
			if(feb[k]==hxl)
			{
			  sum7+=1;
			}
		}
	return sum7;
}

int huoerge(int sum6){
		int hxl,sum7=0;
		int feb[28]={1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,10,2,3,4,5,6,7,8,9,10};
		hxl=sum6-2;
		for(int k=0;k<=27;k++)
			{
				if(feb[k]==hxl)
				{
				  sum7+=1;
				}
			}
		return sum7;
}