PAT1012乙级

#include<iostream>
#include<stdio.h>
#include<iomanip> 
using namespace std;
void find0(int *a,int n)//找被5整除的偶数 
{
	long long sum = 0;
	for(int i=0;i<n;i++)
	{
		if(a[i]%10 == 0){
			sum+=a[i];
		}
	}
	if(sum == 0)
		cout<<"N";
	else
		cout<<sum;
}
void find1(int *a,int n)//找被5整除余1的数交叉求和 
{
	long long sum;
	int count,k;
	sum=count=0;
	k=-1;
	for(int i=0;i<n;i++)
	{
		if(a[i]%5==1){
			sum+=(-1*k)*a[i];
			k=-1*k;
			count++;
		}		
	}
	if(!count)
		cout<<"N";
	else
		cout<<sum;
}
void find2(int*a,int n)//求被5整除余2的个数 
{
	int count=0;
	for(int i=0;i<n;i++){
		if(a[i]%5==2)
			count++;
	}
	if(!count)
		cout<<"N";
	else
		cout<<count;
}
void find3(int* a,int n)//被5整除余3 保留一位小数输出 
{
	float sum=0;
	int count=0;
	for(int i=0;i<n;i++){
		if(a[i]%5==3){
			sum+=a[i];
			count++;
		}

	}
	if(!sum)
		cout<<"N";
	else
		cout<<setiosflags(ios::fixed)<<setprecision(1)<<sum/count;
}
void find4(int* a,int n)//找被5整除余4的最大数 
{
	int max=0;
	for(int i=0;i<n;i++){
		if(a[i]%5==4)
			max=max>a[i]?max:a[i];
	}
	if(!max)
		cout<<"N";
	else
		cout<<max;
}
int main()
{
	
	int n;
	cin>>n;
	int a[n];
	for(int k=0;k<n;){
		cin>>a[k++];
	}
	find0(a,n);cout<<" ";
	find1(a,n);cout<<" ";
	find2(a,n);cout<<" ";
	find3(a,n);cout<<" ";
	find4(a,n);
	return 0;
	
}