#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(double a,double b)
{
return a>b;
}
int main()
{
int N=0;
int par[1001]={0};
int cal[1001]={0};
int flag[5]={0};
double A1=0,A2=0,A3=0,A4=0,A5=0;
cin>>N;
int A4G=0,x=0,l=1;
for(int i=0;i<N;i++)
{
int k=0;
cin>>k;
par[i]=k;
}
for(int i=0;i<N;i++)
{
double temp =par[i]%5;
if(temp==0&&par[i]%2==0)
{
flag[0]=1;
A1+=par[i];
}
if(temp==1)
{
flag[1]=1;
A2=A2+l*par[i];
l=-1*l;
}
if(temp==2)
{
flag[2]=1;
A3++;
}
if(temp==3)
{
flag[3]=1;
A4+=par[i];
A4G++;
}
if(temp==4)
{
flag[4]=1;
cal[x++]=par[i];
}
}
sort(cal,cal+x,cmp);
A5=cal[0];
A4=A4/A4G;
if(flag[0]==0)
{
cout<<"N"<<" ";
}else{
cout<<A1<<" ";
}
if(flag[1]==0)
{
cout<<"N"<<" ";
}else{
cout<<A2<<" ";
}
if(flag[2]==0)
{
cout<<"N"<<" ";
}else{
cout<<A3<<" ";
}
if(flag[3]==0)
{
cout<<"N"<<" ";
}else{
printf("%.1f",A4);
cout<<" ";
}
if(flag[4]==0)
{
cout<<"N";
}else{
cout<<A5;
}
return 0;
#include<algorithm>
using namespace std;
bool cmp(double a,double b)
{
return a>b;
}
int main()
{
int N=0;
int par[1001]={0};
int cal[1001]={0};
int flag[5]={0};
double A1=0,A2=0,A3=0,A4=0,A5=0;
cin>>N;
int A4G=0,x=0,l=1;
for(int i=0;i<N;i++)
{
int k=0;
cin>>k;
par[i]=k;
}
for(int i=0;i<N;i++)
{
double temp =par[i]%5;
if(temp==0&&par[i]%2==0)
{
flag[0]=1;
A1+=par[i];
}
if(temp==1)
{
flag[1]=1;
A2=A2+l*par[i];
l=-1*l;
}
if(temp==2)
{
flag[2]=1;
A3++;
}
if(temp==3)
{
flag[3]=1;
A4+=par[i];
A4G++;
}
if(temp==4)
{
flag[4]=1;
cal[x++]=par[i];
}
}
sort(cal,cal+x,cmp);
A5=cal[0];
A4=A4/A4G;
if(flag[0]==0)
{
cout<<"N"<<" ";
}else{
cout<<A1<<" ";
}
if(flag[1]==0)
{
cout<<"N"<<" ";
}else{
cout<<A2<<" ";
}
if(flag[2]==0)
{
cout<<"N"<<" ";
}else{
cout<<A3<<" ";
}
if(flag[3]==0)
{
cout<<"N"<<" ";
}else{
printf("%.1f",A4);
cout<<" ";
}
if(flag[4]==0)
{
cout<<"N";
}else{
cout<<A5;
}
return 0;
}
//注意最后一个N没有空格!这个错误找了好久,一直有三分被扣了。
版权声明:本文为Shimizusorrow原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。