PTA - BasicLevel - 1013 数素数

#include "bits/stdc++.h"
using namespace std;

struct number{
    int origin;
    int restaAfterDivideBy5;
    bool exist = false;
};

int main(){
    int N;
    cin >> N;
    int result[5] = {0};
    bool exist[5] = {false};
    int k = 1; // Coefficients of interleaved summation
    int avgCount = 0;
    vector<number> num;
    for (int i = 0; i < N; ++i) {
        int originBuffer,restOfOriginDivideBy5;
        cin >> originBuffer;
        restOfOriginDivideBy5 = originBuffer % 5;
        num.push_back({originBuffer,restOfOriginDivideBy5});

        if (num[i].restaAfterDivideBy5 == 0){
            if(num[i].origin % 2 == 0 ) {
                result[0] += num[i].origin;
                exist[0] = true;
            }
        }

        if (num[i].restaAfterDivideBy5 == 1){
            result[1] += num[i].origin * k; // k mains Coefficients of interleaved summation
            k*=-1;
            exist[1] = true;
            continue;
        }

        if (num[i].restaAfterDivideBy5 == 2){
            result[2]++;
            exist[2] = true;
            continue;
        }

        if (num[i].restaAfterDivideBy5 == 3){
            result[3] += num[i].origin;
            avgCount++;
            exist[3] = true;
            continue;
        }

        if (num[i].restaAfterDivideBy5 == 4){
            result[4] = max(result[4], num[i].origin);
            exist[4] = true;
        }
    }

    for (int i = 0; i < 4; ++i) {
        if (!exist[i]){
            printf("N ");
        }
        else if (i == 3){
            printf("%.1lf ",(double)result[i] / (double)avgCount);
        }
        else {
            printf("%d ",result[i]);
        }
    }
    if(!exist[4]){
        printf("N\n");
    }else{
        printf("%d\n",result[4]);
    }
}