1012 数字分类 （20 分（C和C++版本）

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int N, *ptr, sum = 0, num, sum1 = 0, flag = 0;
    int ncount = 0, m_ncount = 0, t_ncount = 0, Max = 0;
    double ave = 0.0;

    cin >> N;

    ptr = new int[N];

    for (int i = 0; i < N; ++i) {
        cin >> ptr[i];
    }

    for (int k = 0; k < N; k++) {
        num = ptr[k] % 5;
        switch (num) {
        case 0:
            if(0 == ptr[k] % 2)
                sum += ptr[k];
            break;
        case 1:
            if (1 == flag % 2) {
                sum1 -= ptr[k];
                ++flag;
            }
            else if (0 == flag % 2) {
                sum1 += ptr[k];
                ++flag;
            }
            break;
        case 2:
            if (2 == ptr[k] % 5) {
                ++ncount;
            }
            break;
        case 3:
            if (3 == ptr[k] % 5) {
                ++m_ncount;
                ave += ptr[k];
            }
            break;
        case 4:
            if (0 == t_ncount) {
                Max = ptr[k];
            }
            else {
                if (Max < ptr[k]) {
                    Max = ptr[k];
                }
            }
            ++t_ncount;
            break;
        }
    }

    if (0 == sum) {
        cout << "N ";
    }
    else {
        cout << sum << " ";
    }

    if (0 == flag) {
        cout << "N ";
    }
    else {
        cout << sum1 << " ";
    }

    if (0 == ncount) {
        cout << "N ";
    }
    else {
        cout << ncount << " ";
    }

    if (0 == m_ncount) {
        cout << "N ";
    }
    else {
        ave /= m_ncount;
        cout.setf(ios::fixed);
        cout << setprecision(1) << ave << " ";
    }

    if (0 == t_ncount) {
        cout << "N";
    }
    else {
        cout << Max;
    }

    delete []ptr;

    return 0;
}

#include <stdio.h>
#include <stdlib.h>


int main(void)
{
    int N, *ptr, sum = 0, num, sum1 = 0, flag = 0;
    int ncount = 0, m_ncount = 0, t_ncount = 0, Max = 0;
    double ave = 0.0;

    scanf("%d", &N);

    ptr = (int*)malloc(sizeof(int) * N);

    for (int i = 0; i < N; ++i) {
        scanf("%d", &ptr[i]);
    }

    for (int k = 0; k < N; k++) {
        num = ptr[k] % 5;
        switch (num) {
        case 0:
            if(0 == ptr[k] % 2)
                sum += ptr[k];
            break;
        case 1:
            if (1 == flag % 2) {
                sum1 -= ptr[k];
                ++flag;
            }
            else if (0 == flag % 2) {
                sum1 += ptr[k];
                ++flag;
            }
            break;
        case 2:
            if (2 == ptr[k] % 5) {
                ++ncount;
            }
            break;
        case 3:
            if (3 == ptr[k] % 5) {
                ++m_ncount;
                ave += ptr[k];
            }
            break;
        case 4:
            if (0 == t_ncount) {
                Max = ptr[k];
            }
            else {
                if (Max < ptr[k]) {
                    Max = ptr[k];
                }
            }
            ++t_ncount;
            break;
        }
    }

    if (0 == sum) {
        printf("N ");
    }
    else {
        printf("%d ", sum);
    }

    if (0 == flag) {
        printf("N ");
    }
    else {
        printf("%d ", sum1);
    }

    if (0 == ncount) {
        printf("N ");
    }
    else {
        printf("%d ", ncount);
    }

    if (0 == m_ncount) {
        printf("N ");
    }
    else {
        ave /= m_ncount;
        printf("%0.1lf ", ave);
    }

    if (0 == t_ncount) {
        printf("N");
    }
    else {
        printf("%d", Max);
    }

    delete []ptr;

    return 0;
}