1012 数字分类 (20分)
题目描述 : --------------------------------------------------------------------------------------------------------------------------------------
给定一系列正整数,请按要求对数字进行分类,并输出以下 5 个数字:
∙
\bullet
∙
A
1
A_{1}
A1 = 能被 5 整除的数字中所有偶数的和;
∙
\bullet
∙
A
2
A_{2}
A2 = 将被 5 除后余 1 的数字按给出顺序进行交错求和,即计算
n
1
n_{1}
n1 -
n
2
n_{2}
n2 +
n
3
n_{3}
n3 -
n
4
n_{4}
n4 ⋯;
∙
\bullet
∙
A
3
A_{3}
A3 = 被 5 除后余 2 的数字的个数;
∙
\bullet
∙
A
4
A_{4}
A4 = 被 5 除后余 3 的数字的平均数,精确到小数点后 1 位;
∙
\bullet
∙
A
5
A_{5}
A5 = 被 5 除后余 4 的数字中最大数字。
输入格式 : --------------------------------------------------------------------------------------------------------------------------------------
每个输入包含 1 个测试用例。每个测试用例先给出一个不超过 1000 的正整数 N,随后给出 N 个不超过 1000 的待分类的正整数。数字间以空格分隔。
输出格式 : --------------------------------------------------------------------------------------------------------------------------------------
对给定的 N 个正整数,按题目要求计算 A
1
~A
5
并在一行中顺序输出。数字间以空格分隔,但行末不得有多余空格。
若其中某一类数字不存在,则在相应位置输出 N。
输入样例 1 : ------------------------------------------------------------------------------------------------------------------------------------
13 1 2 3 4 5 6 7 8 9 10 20 16 18
输出样例 1 : ------------------------------------------------------------------------------------------------------------------------------------
30 11 2 9.7 9
输入样例 2 : ------------------------------------------------------------------------------------------------------------------------------------
8 1 2 4 5 6 7 9 16
输出样例 2 : ------------------------------------------------------------------------------------------------------------------------------------
N 11 2 N 9
#include<bits/stdc++.h>
using namespace std;
void myPrint(int& sum)
{
sum ? printf("%d ", sum) : printf("N ");
sum = 0;
}
int main()
{
int n, sum = 0, cnt = 0, flag = 0;
cin >> n;
vector<int> v(n);
for (auto& i : v)
cin >> i;
for_each(v.begin(), v.end(), [&](int val) { if (val % 10 == 0)sum += val; });
myPrint(sum);
for_each(v.begin(), v.end(), [&](int val) { if (val % 5 == 1) { sum += pow(-1, cnt++) * val; flag = 1; } });
flag ? printf("%d ", sum) : printf("N ");
sum = 0;
for_each(v.begin(), v.end(), [&](int val) { if (val % 5 == 2)sum++; });
myPrint(sum);
cnt = 0;
for_each(v.begin(), v.end(), [&](int val) { if (val % 5 == 3) { sum += val; cnt++; } });
cnt ? printf("%.1f ", sum / (cnt * 1.0)) : printf("N ");
sum = 0;
for_each(v.begin(), v.end(), [&](int val) { if (val % 5 == 4) { if (val > sum)sum = val; } });
sum ? cout << sum : cout << "N";
return 0;
}
import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sin = new Scanner(System.in);
int A1 = 0, A2 = 0, A3 = 0, A4 = 0, A5 = 0, count = 0, symbolCnt = 0;
boolean isExist = false;
int N = sin.nextInt();
for (int i = 0; i < N; i++) {
int num = sin.nextInt();
if (num % 5 == 0 && num % 2 == 0)
A1 += num;
else if (num % 5 == 1) {
A2 += Math.pow(-1, symbolCnt++) * num;
isExist = true;
}
else if (num % 5 == 2)
A3++;
else if (num % 5 == 3) {
A4 += num;
count++;
}
else if (num % 5 == 4 && num > A5)
A5 = num;
}
StringBuilder strB = new StringBuilder ((A1 == 0) ? "N " : A1+" ");
strB.append((isExist) ? A2 + " " : "N ");
strB.append((A3 == 0) ? "N " : A3 + " ");
strB.append((A4 == 0) ? "N " : new DecimalFormat("0.0").format(A4 * 1.0 / count) + " ");
strB.append((A5 == 0) ? "N" : A5 + "");
System.out.println(strB);
}
}