日期处理问题

题目描述

思路

代码

int month[13][2] =
{
	{0,0},{31,31},{28,29},{31,31},{30,30},{31,31},{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31}
};

bool isLeap(int year)
{
	return ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0));
}
int handleDate(int num1,int num2)
{
	int day_count = 1;
	if (num1 > num2)
		swap(num1, num2);
	int y1 = num1 / 10000;
	int y2 = num2 / 10000;
	int m1 = num1 / 100 % 100;
	int m2 = num2 / 100 % 100;
	int d1 = num1 % 100;
	int d2 = num2 % 100;
	while ( y1<y2 || m1<m2 || d1<d2 )
	{
		++d1;
		if (d1 > month[m1][isLeap(y1)])
		{
			++m1;
			d1 = 1;
		}
		if (m1 == 13)
		{
			y1++;
			m1 = 1;
		}
		++day_count;
	}
	return day_count;
}
int main()
{
	int num1, num2;
	cin >> num1 >> num2;
	int d = handleDate(num1, num2);
	cout << d;
	return 0;
}