1周赛J - Problem J

#include<iostream>
using namespace std;
struct days
{
	int a, b, c;
	char ch;
};
int main()
{
	days day;
	int q[100],j=0;
	int w[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };
	int e[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };
	while (cin >> day.a >> day.ch >> day.b >> day.ch >> day.c)
	{
		int sum = 0;
		if (day.a % 4 == 0 && day.a % 100 != 0 || day.a % 400 == 0)
			for (int i = 0; i < day.b - 1; i++)
			{
				sum += w[i];
			}
		else
			for (int i = 0; i < day.b - 1; i++)
			{
				sum += e[i];
			}
		sum += day.c;
		q[j++] = sum;
	}
	for (int i = 0; i < j; i++)
	{
		cout << q[i] << endl;
	}
	return 0;
}