zoukankan      html  css  js  c++  java
  • May Day Holiday

    Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

    Description

    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<bits/stdc++.h>
    using namespace std;
    int run(int y)
    {
        if(y%4==0&&y%100!=0||y%400==0)
            return 1;
        return 0;
    }
    int  day(int y)
    {
        int sum = 0;
        int D=0;
        for(int i = 1928;i <y;i++)
        {
            sum+=365;
            if(run(i))
            {
                sum++;
            }
        }
        sum+=120;
        if(run(y))
            sum++;
        D=(D+sum)%7;
        return D;
    }
    
    int main()
    {
    
        int t;
        cin>>t;
        while(t--)
        {
            int y;
            cin>>y;
            int s=day(y);
            int ans = 5;
            if(s==1)//周五
                ans = 9;
            else if(s==2||s==0)//周一 和 周六
                ans=6;
            cout<<ans<<endl;
        }
    }
    View Code
  • 相关阅读:
    最大相邻差值 数学 桶排序
    hdu-1536 S-Nim SG函数
    博弈论初步(SG函数)
    hdu-5009 Paint Pearls DP+双向链表 with Map实现去重优化
    hdu-5015 233 Matrix 矩阵快速幂
    hdu-1430 魔板 康拓展开+映射优化
    hdu-1043 bfs+康拓展开hash
    康拓展开-排列的hash
    Daily Scrum 12.23
    Daily Scrum 12.22
  • 原文地址:https://www.cnblogs.com/demodemo/p/4655744.html
Copyright © 2011-2022 走看看