2015浙江省赛May Day Holiday

最新推荐文章于 2021-03-12 11:12:48 发布

皮蛋咸鱼白菜粥

最新推荐文章于 2021-03-12 11:12:48 发布

阅读量101

点赞数 1

分类专栏： acm

本文链接：https://blog.csdn.net/qq_36603180/article/details/89466066

版权

acm 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

题目：

As a university advocating self-learning and work-rest balance, Marjar University has so many days of rest, including holidays and weekends. Each weekend, which consists of Saturday and Sunday, is a rest time in the Marjar University.

The May Day, also known as International Workers' Day or International Labour Day, falls on May 1st. In Marjar University, the May Day holiday is a five-day vacation from May 1st to May 5th. Due to Saturday or Sunday may be adjacent to the May Day holiday, the continuous vacation may be as long as nine days in reality. For example, the May Day in 2015 is Friday so the continuous vacation is only 5 days (May 1st to May 5th). And the May Day in 2016 is Sunday so the continuous vacation is 6 days (April 30th to May 5th). In 2017, the May Day is Monday so the vacation is 9 days (April 29th to May 7th). How excited!

Edward, the headmaster of Marjar University, is very curious how long is the continuous vacation containing May Day in different years. Can you help him?

Input

There are multiple test cases. The first line of input contains an integer Tindicating the number of test cases. For each test case, there is an integer y (1928 <= y <= 9999) in one line, indicating the year of Edward's query.

Output

For each case, print the number of days of the continuous vacation in that year.

Sample Input

Output

5
6
9

题意：2015的五一为周5，从五一开始放假放五天，如果前后有周末，放假时间延长，给你一个年份求放假天数

思路：一年365%7=1，一年星期加1，闰年＋2

代码：

#include<iostream>
using namespace std;
#include<algorithm>

bool cmp(int a, int b)
{
	return a > b;
}
int a[10] = { 0, 9, 6, 5, 5, 5, 5, 6 };
int re = 4;
int main()
{
	int t, m, ans;
	cin >> t;
	while (t--)
	{
		re = 4;
		cin >> m;
		if (m > 2015)
		{
			for (int i = 2015 + 1; i <= m; i++)
			{
				re = (re + 1) % 7;
				if ((i % 4 == 0 && i % 100 != 0) || i % 400 == 0)
				{
					re = (re + 1) % 7;
				}
			}
		}
		else
		{
			re++;
			for (int i = 2014; i >= m; i--)
			{
				re = (re-1+ 7) % 7;
				if ((i % 4 == 0 && i % 100 != 0) || i % 400 == 0)
				{
					re = (re-1+ 7) % 7;
				}
			}
		}
		cout << a[re + 1] << endl;

	}
}