傳送門
https://pintia.cn/problem-sets/994805260223102976/problems/994805311146147840
題目
給定一系列正整數(shù)碌奉,請(qǐng)按要求對(duì)數(shù)字進(jìn)行分類短曾,并輸出以下5個(gè)數(shù)字:
A1 = 能被5整除的數(shù)字中所有偶數(shù)的和寒砖;
A2 = 將被5除后余1的數(shù)字按給出順序進(jìn)行交錯(cuò)求和,即計(jì)算n1-n2+n3-n4...错英;
A3 = 被5除后余2的數(shù)字的個(gè)數(shù)入撒;
A4 = 被5除后余3的數(shù)字的平均數(shù),精確到小數(shù)點(diǎn)后1位椭岩;
A5 = 被5除后余4的數(shù)字中最大數(shù)字茅逮。
輸入格式:
每個(gè)輸入包含1個(gè)測(cè)試用例。每個(gè)測(cè)試用例先給出一個(gè)不超過1000的正整數(shù)N判哥,隨后給出N個(gè)不超過1000的待分類的正整數(shù)献雅。數(shù)字間以空格分隔。
輸出格式:
對(duì)給定的N個(gè)正整數(shù)塌计,按題目要求計(jì)算A1~A5并在一行中順序輸出挺身。數(shù)字間以空格分隔,但行末不得有多余空格锌仅。
若其中某一類數(shù)字不存在章钾,則在相應(yīng)位置輸出“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
分析
設(shè)置5個(gè)變量記錄符合A1-A5條件的數(shù)值热芹,并按需聲明變量記錄是否存在符合A1-A5的數(shù)值贱傀,然后按需輸出結(jié)果即可。
需要注意的就是A2是交錯(cuò)求和與A4精確位數(shù)的實(shí)現(xiàn)方法伊脓。
源代碼
//C/C++實(shí)現(xiàn)
#include <stdio.h>
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int n, num;
int a1 = 0, a2 = 0, a3 = 0, a4 = 0, a5 = 0;
bool existA1 = false, existA2 = false;
int countA4 = 0;
scanf("%d", &n);
for(int i = 0, j = 0; i < n; i++){
scanf("%d", &num);
if(num % 5 == 0){
if(num % 2 == 0){
existA1 = true;
a1 += num;
}
}
else if(num % 5 == 1){
existA2 = true;
a2 += num * pow((double)(-1), j);
j++;
}
else if(num % 5 == 2){
a3++;
}
else if(num % 5 == 3){
a4 += num;
countA4++;
}
else{
a5 = (num > a5 ? num : a5);
}
}
if(existA1){
printf("%d", a1);
}
else{
printf("%c", 'N');
}
if(existA2){
printf(" %d", a2);
}
else{
printf(" %c", 'N');
}
if(a3 != 0){
printf(" %d", a3);
}
else{
printf(" %c", 'N');
}
if(countA4 != 0){
printf(" %.1f", (double)a4 / countA4);
}
else{
printf(" %c", 'N');
}
if(a5 != 0){
printf(" %d\n", a5);
}
else{
printf(" %c\n", 'N');
}
return 0;
}
//Java實(shí)現(xiàn)
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
String s = bufferedReader.readLine();
String[] arrayS = s.split(" ");
int capacity = 0;
try {
capacity = Integer.valueOf(arrayS[0]);
} catch (Exception e) {
System.exit(0);
}
if (capacity < 1 || capacity > 1000) {
System.exit(0);
}
int tmp = 0;
int A1 = 0, A2 = 0, A3 = 0, A5 = 0, countA4 = 0, sumA4 = 0, j = 0;
boolean existA2 = false;
for (int i = 0; i < capacity; i++) {
try {
tmp = Integer.valueOf(arrayS[i+1]);
} catch (Exception e) {
System.exit(0);
}
if (tmp < 1 || tmp > 1000) {
System.exit(0);
}
if (tmp % 10 == 0) {
A1 += tmp;
} else if (tmp % 5 == 1) {
A2 += tmp * (int) Math.pow(-1, j);
existA2 = true;
j++;
} else if (tmp % 5 == 2) {
A3++;
} else if (tmp % 5 == 3) {
sumA4 += tmp;
countA4++;
} else if (tmp % 5 == 4) {
A5 = A5 > tmp ? A5 : tmp;
}
}
if (A1 != 0) {
System.out.print(A1 + " ");
} else {
System.out.print("N ");
}
if (existA2) {
System.out.print(A2 + " ");
} else {
System.out.print("N ");
}
if (A3 != 0) {
System.out.print(A3 + " ");
} else {
System.out.print("N ");
}
if (countA4 != 0) {
double avg = (double) sumA4 / countA4;
System.out.print(Math.round(avg * 10) / 10.0 + " ");
} else {
System.out.print("N ");
}
if (A5 != 0) {
System.out.println(A5);
} else {
System.out.println("N");
}
}
}