7-12 计算天数

本题要求编写程序计算某年某月某日是该年中的第几天。
输入格式:
输入在一行中按照格式“yyyy/mm/dd”（即“年/月/日”）给出日期。
注意：闰年的判别条件是该年年份能被4整除但不能被100整除、或者能被400整除。闰年的2月有29天。
输出格式:
在一行输出日期是该年中的第几天。
输入样例1:
2009/03/02
输出样例1:
61
输入样例2:
2000/03/02
输出样例2:
62

#include<iostream>
using namespace std;
int main()
{
	int year; int month; int day; char ch1;
	char ch2;
	cin >> year >>ch1>> month >>ch2>>day;
	
	//printf("%d/%02d/%02d", year, month, day);
	int sum = 0; int flag = 1;
	int arr[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };
	int arr2[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };
	if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0)
	{
		switch (1)
		{
		case 1:
		{
			if (flag == month)
			{
				for (int i = 0; i < flag-1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 2:
		{
			if (flag == month)
			{
				for (int i = 0; i < flag-1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 3:
		{
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 4: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 5: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 6: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 7: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 8: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
						sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 9: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 10: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 11: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 12: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr2[i];
				sum += day;
				break;
			}
			flag++;
		}
		}
	}
	

	else
	{
		switch (1)
		{
		case 1:
		{
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 2:
		{
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 3:
		{
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 4: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 5: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 6: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 7: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 8: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 9: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 10: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 11: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		case 12: {
			if (flag == month)
			{
				for (int i = 0; i < flag - 1; i++)
					sum += arr[i];
				sum += day;
				break;
			}
			flag++;
		}
		}
	}
	cout << sum;
	system("pause");
}
//