USACO 1.1 Friday the Thirteenth

最新推荐文章于 2023-03-30 17:26:33 发布

ArcherCheng

最新推荐文章于 2023-03-30 17:26:33 发布

阅读量246

点赞数

分类专栏： USACO 文章标签： USACO

本文链接：https://blog.csdn.net/cxq249282126/article/details/48056317

版权

USACO 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

Friday the Thirteenth

Is Friday the 13th really an unusual event?

That is, does the 13th of the month land on a Friday less often than on any other day of the week? To answer this question, write a program that will compute the frequency that the 13th of each month lands on Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday over a given period of N years. The time period to test will be from January 1, 1900 to December 31, 1900+N-1 for a given number of years, N. N is positive and will not exceed 400.

Note that the start year is NINETEEN HUNDRED, not 1990.

There are few facts you need to know before you can solve this problem:

January 1, 1900 was on a Monday.
Thirty days has September, April, June, and November, all the rest have 31 except for February which has 28 except in leap years when it has 29.
Every year evenly divisible by 4 is a leap year (1992 = 4*498 so 1992 will be a leap year, but the year 1990 is not a leap year)
The rule above does not hold for century years. Century years divisible by 400 are leap years, all other are not. Thus, the century years 1700, 1800, 1900 and 2100 are not leap years, but 2000 is a leap year.

Do not use any built-in date functions in your computer language.

Don't just precompute the answers, either, please.

PROGRAM NAME: friday

INPUT FORMAT

One line with the integer N.

SAMPLE INPUT (file friday.in)

OUTPUT FORMAT

Seven space separated integers on one line. These integers represent the number of times the 13th falls on Saturday, Sunday, Monday, Tuesday, ..., Friday.

SAMPLE OUTPUT (file friday.out)

36 33 34 33 35 35 34

ps:本人大三狗一枚，正在持续更新博客，文章里有任何问题，希望各位网友可以指出。若有疑问也可在评论区留言，我会尽快回复。希望能与各位网友互相学习，谢谢！

/*
ID: cxq_xia1
PROG: friday
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int N;
int month[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int countday[7]={0};
bool isLeap(int x)
{
    if(((x%4==0)&&(x%100!=0))||((x%400)==0))
        return true;
    else
        return false;
}
int main()
{
    int year,day;
    freopen("friday.in","r",stdin);
    freopen("friday.out","w",stdout);
    while(cin >> N)
    {
        day=1;
        memset(countday,0,sizeof(countday));
        for(int i=0;i<N;i++)
        {
            year=1900+i;
            if(isLeap(year))
                month[1]=29;
            else
                month[1]=28;

            for(int j=0;j<12;j++)
            {
                countday[(day+13)%7]++;
                day+=month[j];
            }
        }
        for(int i=0;i<6;i++)
            cout << countday[i] <<" ";
        cout << countday[6] <<endl;
    }
    return 0;
}