logo AlgoBeat OnlineJudge
登录 注册

#200201. [USACO1.1] Friday the Thirteenth

内存限制:125 MiB 时间限制:1000 ms 标准输入输出
题目类型:VJudge(洛谷) 评测方式:VJudge
上传者: 匿名

题目描述

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 Saturday, Sunday, Monday, Tuesday, Wednesday, Thursday, and Friday over a given period of years. The time period to test will be from January 1, 1900 to December 31, for a given number of years, . is positive and will not exceed .

Note that the start year is nineteen hundred, not nineteen ninety.

There are a 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 except for February which has except in leap years when it has .
  • Every year evenly divisible by is a leap year.
  • The rule above does not hold for century years. Century years divisible by are leap years, all others are not. Thus, the century years , , and are not leap years, but is a leap year.

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

Do not just precompute the answers.

输入格式

One line with the integer .

输出格式

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

样例

样例输入 1

20

样例输出 1

36 33 34 33 35 35 34

数据范围与提示

USACO Training Section .