ZOJ Problem Set - 3876||May Day Holiday

May Day Holiday

Time Limit: 2 Seconds       Memory Limit: 65536 KB

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 integery (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
3
2015
2016
2017
Output
5
6
9
 
浙江省第十二届大学生程序设计竞赛
求劳动节放假的天数,首先劳动节至少放假五天。题目要求输入年份。输入如果劳动节在星期一,则放假九天,在星期日和星期二则放假六天,其余的放假五天。

首先要判断闰年还是平年。利用week算出那年劳动节是星期几。


#include <iostream>
using namespace std;
int leap(int n)
{
	if ((n % 4 == 0 && n % 100 != 0) || n % 400 == 0)
		return 1;
	return 0;
}
int week(int year)
{
	int i,day=0;
	for (i = 1928; i < year; i++)
	{
		if (leap(i))
			day += 366;
		else
			day += 365;
	}
	if (leap(year))
		day += 122;
	else
		day += 121;
	return (day - 1) % 7;
}
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n,day;
		cin >> n;
		switch (week(n))
		{
		case 1:day = 9;
			break;
		case 2:day = 6;
			break;
		case 3:day = 5;
			break;
		case 4:day = 5;
			break;
		case 5:day = 5;
			break;
		case 6:day = 5;
			break;
		case 0:day = 6;
			break;
		}
		cout << day << endl;
	}
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值