PAT乙级之数字分类直接版

#include <iostream>
#include <vector>
#include  <algorithm>
#include <string>
#include< iomanip>
using namespace std;
int main()
{
	int N;
	cin >> N;
 	vector<int> v, A1, A2, A3, A4, A5;
	for (int i = 0; i < N; i++)
	{
		int t;
		cin >> t;
		v.push_back(t);
	}
	for (int i = 0; i < N; i++)
	{
		if (v[i] % 2 == 0 && v[i] % 5 == 0)
			A1.push_back(v[i]);
		if (v[i] % 5 == 1)
			A2.push_back(v[i]);
		if (v[i] % 5 == 2)
			A3.push_back(v[i]);
		if (v[i] % 5 == 3)
			A4.push_back(v[i]);
		if (v[i] % 5 == 4)
			A5.push_back(v[i]);
		else
			continue;
	}
	int a1 = 0, a2 =0, a3 = A3.size(), a5 = 0;
	double a4 = 0;
	if (A1.size() != 0)
	{
		vector<int> ::iterator i1;
		i1 = A1.begin();
		for (i1; i1 != A1.end(); i1++)
		{
			a1 += *(i1);
		}
	}
	else
           a1 = -1;
	
``` js

if (A2.size() != 0)
{
	vector<int> ::iterator i2;
	i2 = A2.begin();
	for (i2; i2 != A2.end(); i2++)
	{
		switch ((i2 - A2.begin()) % 2)
		{
		case 0:
			a2 += *(i2);
			break;
		case 1:
			a2 -= *(i2);
			break;
		}
	}
}
else
	a2 = -1;

a3 = A3.size();

if (A4.size() != 0)
{
	vector<int> ::iterator i4;
	i4 = A4.begin();
	for (i4; i4 != A4.end(); i4++)
	{
		a4 += *(i4);
	}
	a4 = double(a4 / A4.size());
}
else
	a4 = -1;
if (A5.size() != 0)
{
	sort(A5.begin(), A5.end());
	a5 = *(A5.end() - 1);
}
else a5 = -1;

if (a1 != -1)
	cout << a1 << " ";
else cout << "N"<<" ";
if (a2 != -1)
	cout << a2 << " ";
else cout << "N"<<" ";
if (a3 != 0)
	cout << a3 << " ";
else cout << "N"<<" ";
if (a4 != -1)
	cout << fixed <<setprecision(1)<<a4 << " ";
else cout << "N"<<" ";
if (a5 != -1)
	cout << a5 ;
else cout << "N";

}