PAT乙级1012:数字分类

在这里插入图片描述

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n, temp;
	int A1 = 0, A2 = 0, A3 = 0, A5 = -1;
	double A4 = 0;
	cin >> n;

	vector<int> v1, v2, v3, v4, v5;

	for (int i = 0; i < n; i++) {
		cin >> temp;
		switch (temp % 5) {
		case 0: if (temp % 10 == 0) v1.push_back(temp); break;
		case 1: if (temp % 5 == 1) v2.push_back(temp); break;
		case 2: if (temp % 5 == 2) v3.push_back(temp); break;
		case 3: if (temp % 5 == 3) v4.push_back(temp); break;
		case 4: if (temp % 5 == 4) v5.push_back(temp); break;
		}
	}
	//求和
	for (int i = 0; i < v1.size(); i++) {
		A1 += v1[i];
	}
	//交错求和
	bool isPositive = true;//正负交错的key
	for (int i = 0; i < v2.size(); i++) {
		if (isPositive) A2 += v2[i];
		else A2 -= v2[i];
		isPositive = !isPositive;
	}
	
	//计数
	for (int i = 0; i < v3.size(); i++) {
		A3++;
	}

	//平均数
	for (int i = 0; i < v4.size(); i++) {
		A4 += v4[i];
	}
	A4 = A4 / v4.size();

	//最大数字
	for (int i = 0; i < v5.size(); i++) {
		if (v5[i] > A5) A5 = v5[i];
	}
	//输出,这边使用空判断更准确,否则会有一个失误
	if (v1.size() == 0) cout << "N "; else cout << A1 << " ";
	if (v2.size() == 0) cout << "N "; else cout << A2 << " ";
	if (v3.size() == 0) cout << "N "; else cout << A3 << " ";
	if (v4.size() == 0) cout << "N "; else printf("%.1f ", A4);
	if (v5.size() == 0) cout << "N"; else cout << A5;
	
	return 0;
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值