USACO 1.1.3 - Friday the Thirteenth(模拟)

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)

20
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

题意:
从1900年开始(包括1900),往后n年,找出13号所在的星期出现的次数.

解题思路:
1900年的1月1日为星期一,然后就是闰年的判定(能被400整除或者能被4整除同时不能被100整除的年份).

AC代码:

/*
ID:Reckful
LANG:C++
TASK:friday
*/
#include<stdio.h>
int mouth[13][2] = {{0,0},{31,31},{28,29},{31,31},{30,30},{31,31},{30,30},{31,31},{31,31},{30,30},{31,31},{30,30},{31,31}};
bool isLeap(int n)
{if((n%400==0)||(n%4==0&&n%100!=0))    return true;return false;
}
int day[8] = {0};
int main()
{//freopen("friday.in","r",stdin);//freopen("friday.out","w",stdout);int n;scanf("%d",&n);int days = 0;for(int i = 0;i < n;i++){int flag = isLeap(1900+i);for(int i = 1;i <= 12;i++){day[(days+12)%7+1]++;days += mouth[i][flag];}}printf("%d %d %d %d %d %d %d\n",day[6],day[7],day[1],day[2],day[3],day[4],day[5]);return 0;
}

USACO 1.1.3 - Friday the Thirteenth(模拟)相关推荐

USACO—1.1.3 Friday the Thirteenth 黑色星期五
题目描述: 1.1.3 Friday the Thirteenth 黑色星期五 (friday.pas/c/cpp) 13号又是一个星期五.13号在星期五比在其他日子少吗?为了回答这个问题,写一个程序 ...
usaco 1.1.3
usaco 1.1.3 - Friday the Thirteenth Is Friday the 13th really an unusual event? That is, does the 13 ...
【from zero to zero】noip2017
from zero to zero 洛谷首页的倒计时不知道什么时候就变成了六字开头. 到底还是太弱了. 生病又拖了很多的时间. 听了很多的算法,自己写起来却非常困难. 也许要在累倒前做一些事情呢. 从 ...
洛谷 P1207 [USACO1.2]双重回文数 Dual Palindromes
P1207 [USACO1.2]双重回文数 Dual Palindromes 题目描述如果一个数从左往右读和从右往左读都是一样,那么这个数就叫做"回文数".例如,12321就是一 ...
洛谷 P1205 [USACO1.2]方块转换 Transformations
题目描述一块N x N(1<=N<=10)正方形的黑白瓦片的图案要被转换成新的正方形图案.写一个程序来找出将原始图案按照以下列转换方法转换成新图案的最小方式: 1:转90度:图案按顺时针 ...
[USACO1.1]贪婪的送礼者Greedy Gift Givers
题目描述对于一群(NP个)要互送礼物的朋友,GY要确定每个人送出的钱比收到的多多少.在这一个问题中,每个人都准备了一些钱来送礼物,而这些钱将会被平均分给那些将收到他的礼物的人.然而,在任何一群朋友中 ...
洛谷 P2728 纺车的轮子 Spinning Wheels
P2728 纺车的轮子 Spinning Wheels 题目背景一架纺车有五个纺轮(也就是五个同心圆),这五个不透明的轮子边缘上都有一些缺口.这些缺口必须被迅速而准确地排列好.每个轮子都有一个起始标 ...
洛谷 P1203 [USACO1.1]坏掉的项链Broken Necklace
P1203 [USACO1.1]坏掉的项链Broken Necklace 题目描述你有一条由N个红色的,白色的,或蓝色的珠子组成的项链(3<=N<=350),珠子是随意安排的. 这里是 ...
USACO 1.3... 虫洞解题报告（搜索+强大剪枝+模拟）
这题可真是又让我找到了八数码的感觉...哈哈.首先,第一次见题,没有思路,第二次看题,感觉是搜索,就这样写下来了.这题我几乎是一个点一个点改对的(至于为什么是这样,后面给你看一个神奇的东西),让我发现 ...
USACO 1.1 Friday the Thirteenth
题目来源:USACO 1.1 原题目: Friday the Thirteenth Is Friday the 13th really an unusual event? That is, does ...

USACO 1.1.3 - Friday the Thirteenth(模拟)

USACO 1.1.3 - Friday the Thirteenth(模拟)相关推荐

最新文章

热门文章