1012 数字分类

data=list(map(int,input().split()))
a1=0
a2=0
a2_count=0
a3=0
a4=0
a4_count=0
a5=0
out=''
for each in data[1:]:
	if each % 5==0 and each % 2==0:
		a1+=each
	if each % 5==1:
		a2_count+=1
		a2+=each*(-1)**(a2_count-1)

	if each % 5==2:
		a3+=1
	if each % 5 ==3:
		a4+=each
		a4_count+=1
	if each % 5 == 4:
		if each > a5:
			a5=each
if a1 ==0:
	print('N',end=' ')
else:
	print(a1,end=' ')
if a2_count==0:
	print('N',end=' ')
else:
	print(a2,end=' ')
if a3==0:
	print('N',end=' ')
else:
	print(a3,end=' ')
if a4_count==0:
	print('N',end=' ')
else:
	print(round(a4/a4_count,1),end=' ')
if a5==0:
	print('N',end='')
else:
	print(a5,end='')
#include <iostream>
#include <cstdio>

int main(){
    int n;
    int ans[5] = {0};
    int k = 1;
    int count[5] = {0};
//    printf("pl\n");
    scanf("%d",&n);
    for (int i= 0; i<n; i++) {
        int number;
        scanf("%d",&number);
        if (number % 5 == 0) {
            if (number % 2 == 0){
                ans[0] += number;
                count[0]++;
            }
        }else if (number % 5 ==1){
            ans[1] +=number*k;
            k *= -1;
            count[1]++;
        }else if (number % 5 ==2){
            ans[2]++;
            count[2]++;
        }else if(number % 5 == 3){
            ans[3] += number;
            count[3]++;
        }else if (number % 5 == 4){
            if (number > ans[4]) {
                ans[4] = number;
                count[4]++;
            }
        }
    }
    
    for (int i=0; i<=4; i++) {
        if (count[i] < 1) {
            printf("N");
        }else{
            if( i != 3)
                printf("%d",ans[i]);
            else
                printf("%.1f",ans[i]*1.0/count[i]);
        }
        if (i != 4) {
            printf(" ");
        }
        
    }
    
    
    
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值