PAT乙级1012 数字分类 (20 分)

Posted 2021-06-19 辉小歌

https://pintia.cn/problem-sets/994805260223102976/problems/994805311146147840

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e3+10;
int a[N];
bool flag1,flag2,flag3,flag4,flag5;
int ans1,ans2,ans3,ans5;
double ans4;
int main(void)
{
	int n; cin>>n;
	int k2=0;
	int k4=0;
	for(int i=0;i<n;i++) 
	{
		cin>>a[i];
		if(a[i]%5==0&&a[i]%2==0) flag1=true,ans1+=a[i];
		if(a[i]%5==1)		
		{
			flag2=true;
			k2++;
			if(k2%2==0) ans2-=a[i];
			else ans2+=a[i];
		}
		if(a[i]%5==2) flag3=true,ans3++;
		if(a[i]%5==3) flag4=true,k4++,ans4+=a[i];
		if(a[i]%5==4) flag5=true,ans5=max(ans5,a[i]);
	}
	if(!flag1) cout<<"N ";
	else cout<<ans1<<" ";
	if(!flag2) cout<<"N ";
	else cout<<ans2<<" ";
	if(!flag3) cout<<"N ";
	else cout<<ans3<<" ";
	if(!flag4) cout<<"N ";
	else printf("%.1lf ",ans4/k4);
	if(!flag5) cout<<"N";
	else cout<<ans5;
	return 0;
}