1012. 数字分类 (20)

直接写的简单题

#include<iostream>
#include<cstdio>
using namespace std;
const int INF=10000000;
int main()
{
	int n,x,y;
	int sum0=0,sum1=0,t0=0,t1=0,t2=0,t4=0,maxn=-INF;
	double sum3=0,t3=0;
	int b[1000+10];
	freopen("1012.txt","r",stdin);
	scanf("%d",&n);
	//printf("%d\n",n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&x);
		y=x%5;
		switch(y)
		{
			case 0:	if(x%2==0)
					{
						t0++;sum0+=x;
					}
					break;
			case 1: b[t1++]=x;break;
			case 2: t2++;break;
			case 3: t3++;sum3+=x;break;
			case 4: if(x>maxn)
					{
						t4++;maxn=x;
					}
					break;
		}
	}
	for(int i=0;i<t1;i++)
		{
			if(i%2==0)	sum1+=b[i];
			else	sum1-=b[i];
		}
		if(t0!=0)	printf("%d ",sum0);
		else	printf("N ");
		if(t1!=0)	printf("%d ",sum1);
		else	printf("N ");
		if(t2!=0)	printf("%d ",t2);
		else	printf("N ");
		if(t3!=0)	printf("%.1f ",sum3/t3);
		else	printf("N ");
		if(t4!=0)	printf("%d\n",maxn);
		else	printf("N\n");
	return 0;
}