给定一系列正整数,请按要求对数字进行分类,并输出以下5个数字:
- A1 = 能被5整除的数字中所有偶数的和;
- A2 = 将被5除后余1的数字按给出顺序进行交错求和,即计算n1-n2+n3-n4...;
- A3 = 被5除后余2的数字的个数;
- A4 = 被5除后余3的数字的平均数,精确到小数点后1位;
- A5 = 被5除后余4的数字中最大数字。
输入格式:
每个输入包含1个测试用例。每个测试用例先给出一个不超过1000的正整数N,随后给出N个不超过1000的待分类的正整数。数字间以空格分隔。
输出格式:
对给定的N个正整数,按题目要求计算A1~A5并在一行中顺序输出。数字间以空格分隔,但行末不得有多余空格。
若其中某一类数字不存在,则在相应位置输出“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
-
注意switch case要用break就好,代码如下:
-
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
int main(int argc, char **argv)
{
int i, length, number; double sum_3 = 0;
int sum_0 = 0, sum_1 = 0, count_2 = 0, count_3 = 0, max_4 = 0;
int flag[5] = {0};
int flag_add = 1;
cin >> length;
vector<int> x(length);
for (i = 0; i<length; i++)
{
cin >> x[i];
}
for (i = 0; i<length; i++)
{
number = x[i] % 5;
switch (number)
{
case 0:
if (!(x[i] % 2))
{
flag[0] = 1;
sum_0 += x[i];
}
break;
case 1:
flag[1] = 1;
sum_1 += flag_add*x[i];
flag_add = flag_add*(-1);
break;
case 2:
flag[2] = 1;
count_2++;
break;
case 3:
flag[3] = 1;
count_3++;
sum_3 += x[i];
break;
case 4:
flag[4] = 1;
if (x[i]>max_4)
max_4 = x[i];
break;
}
}
double avg = sum_3 / count_3;
if (flag[0]) cout << sum_0 << " "; else cout << "N" << " ";
if (flag[1]) cout << sum_1 << " "; else cout << "N" << " ";
if (flag[2]) cout << count_2 << " "; else cout << "N" << " ";
if (flag[3]) cout << fixed << setprecision(1) << avg << " "; else cout << "N" << " ";
if (flag[4]) cout << max_4; else cout << "N";
return 0;
}