输入日期计算这个日期在这一年里是多少天成功返回天数不成功返回-1（c++）

最新推荐文章于 2024-03-29 00:09:15 发布

三少爷的剑！

最新推荐文章于 2024-03-29 00:09:15 发布

阅读量4.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： c++ 文章标签： c++

本文链接：https://blog.csdn.net/ambiguous__/article/details/106795815

c++ 专栏收录该内容

86 篇文章

订阅专栏

#include<iostream>
using namespace std;
int count(int year,int month, int day)
{
	int days = 0;
	if (month < 13 && day <= 31)
	{

		switch (month)
		{
		case 1:	
			days = day;
			break;
		case 2:
			days = 31 + day;
			if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)
			{
				if (day > 29)
				{
					days = 0;
				}
			}
			else
			{
				if (day > 28)
				{
					days = 0;
				}
			}
			break;
		case 3:
			days = 31 + day + 29;
			if (day > 31)
			{
				days = 0;
			}
			break;
		case 4:
			days = 31 * 2 + day + 29;
			if (day > 30)
			{
				days = 0;
			}
			break;
		case 5:
			days = 31 * 2 + day + 29 + 30;
			if (day > 31)
			{
				days = 0;
			}
			break;
		case 6:
			days = 31 * 3 + day + 29 + 30;
			if (day > 30)
			{
				days = 0;
			}
			break;
		case 7:
			days = 31 * 3 + day + 29 + 30 * 2;
			if (day > 31)
			{
				days = 0;
			}
			break;
		case 8:
			days = 31 * 4 + day + 29 + 30 * 2;
			if (day > 31)
			{
				days = 0;
			}
			break;
		case 9:
			days = 31 * 5 + day + 29 + 30 * 2;
			if (day > 30)
			{
				days = 0;
			}
			break;
		case 10:
			days = 31 * 5 + day + 29 + 30 * 3;
			if (day > 31)
			{
				days = 0;
			}
			break;
		case 11:
			days = 31 * 6 + day + 29 + 30 * 3;
			if (day > 30)
			{
				days = 0;
			}
			break;
		case 12:
			days = 31 * 6 + day + 29 + 30 * 4;
			if (day > 31)
			{
				days = 0;
			}
			break;
		default:
			break;
		}
	}
	else
	{
		days = 0;
	}
	return days;
}
int main()
{
	int days;
	int year, month, day;
	while (cin >> year >> month >> day)
	{
		days = count(year,month, day);
		if (days == 0)
		{
			cout << -1 << endl;
		}
		else
		{
			if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)
			{

				cout << days << endl;
			}
			else
			{
				cout << days - 1 << endl;

			}
		}
	}
}