210713

PAT/B/1012

#include <iostream>
#include <iomanip>
using namespace std;
int main() {
	int t,n;
	int sum1=0,flag=-1,flag2=0,sum2=0,count=0,count3=0,sum3=0,max=0;
	cin>>t;
	for(int i=0; i<t; ++i) {cin>>n;
		switch(n%5) {

			case 0:
				if(n%10==0) sum1+=n;
				break;
			case 1: {
				flag*=(-1);
				sum2+=n*flag;
				flag2=1;
				break;
			}
			case 2:
				count++;
				break;
			case 3:
				sum3+=n;
				count3++;
				break;
			case 4:
				max=max>n?max:n;
				break;
		}
	}
	if(!sum1) cout<<'N';
	else cout<<sum1;
	cout<<' ';
	if(flag2) cout<<sum2;
	else cout<<'N';
	cout<<' ';
	if(count) cout<<count;
	else cout<<'N';
	cout<<' ';
	if(count3) cout<<fixed<<setprecision(1)<<double(sum3)/count3;
	else cout<<'N';
	cout<<' ';
	if(max) cout<<max;
	else cout<<'N';
	return 0;
}

这道题并没有什么大的坑，只是稍微有点繁琐。
这里粘贴一下liuchuo大神的代码，供复习使用

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n, num, A1 = 0, A2 = 0, A5 = 0;
    double A4 = 0.0;
    cin >> n;
    vector<int> v[5];
    for (int i = 0; i < n; i++) {
        cin >> num;
        v[num%5].push_back(num);
    }
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < v[i].size(); j++) {
            if (i == 0 && v[i][j] % 2 == 0) A1 += v[i][j];
            if (i == 1 && j % 2 == 0) A2 += v[i][j];
            if (i == 1 && j % 2 == 1) A2 -= v[i][j];
            if (i == 3) A4 += v[i][j];
            if (i == 4 && v[i][j] > A5) A5 = v[i][j];
        }
    }
    for (int i = 0; i < 5; i++) {
        if (i != 0) printf(" ");
        if (i == 0 && A1 == 0 || i != 0 && v[i].size() == 0) {
            printf("N"); continue;
        }
        if (i == 0) printf("%d", A1);
        if (i == 1) printf("%d", A2);
        if (i == 2) printf("%d", v[2].size());
        if (i == 3) printf("%.1f", A4 / v[3].size());
        if (i == 4) printf("%d", A5);
    }
    return 0;
}