1012 数字分类

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main ()
{
	int n;
	cin>>n;
	int s[1005];
	long long int a1=0,a4sum=0;//注意数据的范围和数据类型，进行适当调整
	int a2=0,a3=0,a5=0;
	double a4=0,c4=0;
	int c1=0,c2=0,c3=0,c5=0;//分别记录每种数字出现的次数
	int a2s[1005];
	int k=1;
	for(int i=0;i<n;i++)
	{
		cin>>s[i];
		if(s[i]%10==0)
		{
			a1=a1+s[i];
			c1++;
		}
		if(s[i]%5==1)
		{
			a2=a2+s[i]*k;
			k=k*(-1);//交错求和，用-1 当系数
			c2++;
		}
		if(s[i]%5==2)
		{
			c3++;
			a3++;
		}
		if(s[i]%5==3)
		{
			c4++;
			a4sum=a4sum+s[i];
		}
		if(s[i]%5==4)
		{
			c5++;
			if(a5<s[i])
				a5=s[i];
		}
	}
	a4=a4sum/c4;
	if(c1!=0)
		cout<<a1<<" ";
	else
		cout<<"N"<<" ";
	if(c2!=0)
		cout<<a2<<" ";
	else
		cout<<"N"<<" ";
	if(c3!=0)
		cout<<a3<<" ";
	else
		cout<<"N"<<" ";
	if(c4!=0)
		printf("%.1lf ",a4);//保留一位小数
	else
		cout<<"N"<<" ";
	if(c5!=0)
		cout<<a5<<endl;
	else
		cout<<"N"<<endl;
	return 0;
}