1. 程式人生 > >(PAT)數字分類 (20)

(PAT)數字分類 (20)

題目

解題思路

仔細

程式碼

#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
 
int main()
{
    int a1, a2, a3, a5;
    double a4;
    a1 = a2 = a3 = a4 = a5 = 0;
    int counter[5];
    for (int i = 0; i < 5; ++i) counter[i] = 0;
 
    int n; cin >> n;
 
    for
(int i = 0; i < n; ++i) { int number; cin >> number; switch (number % 5) { case 0: if (number % 2 == 0) { ++counter[0]; a1 += number; } break; case 1: ++counter[
1]; if (counter[1] % 2 == 1) a2 += number; else a2 -= number; break; case 2: ++counter[2]; ++a3; break; case 3: ++counter[3]; a4 += number; break; case 4: ++
counter[4]; a5 = (a5 > number ? a5 : number); break; } } if (counter[0]) cout << a1 << " "; else cout << "N "; if (counter[1]) cout << a2 << " "; else cout << "N "; if (counter[2]) cout << a3 << " "; else cout << "N "; if (counter[3]) printf("%.1lf ", a4 / counter[3]); else cout << "N "; if (counter[4]) cout << a5; else cout << "N"; return 0; }