6129 Problem G 数字分类 (20)

#include<iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	while (cin >> n) {
		int  a[1010], count = 0, max = -1;
		double a1 = 0, a2 = 0, a3 = 0, a4 = 0, a5 = 0, sum = 0;
		bool flag = false;
		for (int i = 0; i < n; i++) {
			cin >> a[i];
			if (a[i] % 10 == 0) a1 += a[i];
			if (a[i] % 5 == 1) {
				if (flag == false) {
					a2 += a[i];
					flag = true;
				}
				else {
					a2 -= a[i];
					flag = false;
				}
			}
			if (a[i] % 5 == 2) {
				a3++;
			}
			if (a[i] % 5 == 3) {
				sum += a[i];
				count++;
			}
			if (a[i] % 5 == 4) {
				if (a[i] > max) {
					max = a[i];
					a5 ++;
				}
			}
		}
	if(count) a4 = sum / count;
	if (a1) cout << a1 << " ";
	else cout << "N ";
	if (a2) cout << a2 << " ";
	else cout << "N ";
	if (a3) cout << a3 << " ";
	else cout << "N ";
	if (a4 && count) printf("%.1f ", a4);
	else cout << "N ";
	if (a5) cout << max <<endl;
	else cout << "N" << endl;
	}
	return 0;
}

分类讨论,这段代码交到牛客上AC,放在codeup上就WA,是哪里出错了呢,恳请大佬赐教

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值