第十二届浙江省大学生程序设计大赛-May Day Holiday 分类: ...

本文介绍了一个计算不同年份五一劳动节连续假期长度的程序。通过输入特定年份,程序能够判断该年的五一假期如何与周末结合,从而计算出实际的连续休息天数。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 T indicating 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

3
2015
2016
2017

Output

5
6
9

#include <iostream>
#include <string>
#include <stdio.h>
#include<algorithm>
#include<string.h>
#include<cmath>
#include<stack>
#include<queue>

using namespace std;

const int MAX=10000+10;

int day[MAX];

int main()
{

    day[0]=0;

    for(int i=1;i<MAX;i++)
    {
        if((i%4==0&&i%100!=0)||(i%400==0))
        {
            day[i]=day[i-1]+366;
        }
        else
        {
            day[i]=day[i-1]+365;
        }

    }

    int T,year;

    scanf("%d",&T);

    while(T--)
    {
        scanf("%d",&year);

        int d=day[year-1];

        if((year%4==0&&year%100!=0)||(year%400==0))
        {
            d+=121;
        }
        else
        {
            d+=120;
        }

        d++;

        int s=d%7;

        if(s==1)
        {
            cout<<9<<endl;
        }
        else if(s==0||s==2)
        {
            cout<<6<<endl;
        }
        else
        {
            cout<<5<<endl;
        }
    }

    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

转载于:https://www.cnblogs.com/juechen/p/4721976.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值