CodeForces 611A New Year and Days （新年存钱计划）

最新推荐文章于 2020-10-30 23:04:42 发布

原创最新推荐文章于 2020-10-30 23:04:42 发布 · 494 阅读

0 ·

CC 4.0 BY-SA版权

一块水过这的题同时被 2 个专栏收录

144 篇文章

订阅专栏

CodeForces

124 篇文章

订阅专栏

一只小北极熊Limak为了展示自己的责任感，决定在2016年全年定期存糖果。根据不同的存钱策略（按周的某一天或按月的某一天），计算一年内可以存多少糖果。

A. New Year and Days

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Today is Wednesday,the third day of the week. What's more interesting is that tomorrow is the lastday of the year 2015.

Limak is a littlepolar bear. He enjoyed this year a lot. Now, he is so eager to the coming year2016.

Limak wants to provehow responsible a bear he is. He is going to regularly save candies for theentire year 2016! He considers various saving plans. He can save one candyeither on some fixed day of the week or on some fixed day of the month.

Limak chose oneparticular plan. He isn't sure how many candies he will save in the 2016 withhis plan. Please, calculate it and tell him.

Input

The only line of theinput is in one of the following two formats:

· "x of week"wherex(1 ≤ x ≤ 7)denotes the day of the week. The 1-st day is Monday and the 7-th one is Sunday.

· "x of month"wherex(1 ≤ x ≤ 31)denotes the day of the month.

Output

Print one integer — the number ofcandies Limak will save in the year 2016.

Examples

Input

4 of week

Output

Input

30 of month

Output

Note

Polar bears use theGregorian calendar. It is the most common calendar and you likely use it too.You can read about it on Wikipedia if you want to –https://en.wikipedia.org/wiki/Gregorian_calendar.The week starts with Monday.

In the first sampleLimak wants to save one candy on each Thursday (the 4-th day of the week).There are52Thursdays in the 2016. Thus, he will save52candies in total.

In the second sample Limak wants tosave one candy on the 30-th day of each month. There is the 30-th day inexactly11months in the 2016 — all months but February. It means that Limak willsave11candies in total.

参考题意：

新年快到了，你要计划存钱昂，计划就是按照当月的第几天省；或者按照一周的星期几来存，问你一年下来，能存多少次。

注意后天才是2016年第一天！！

参考代码：

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#define MYDD 66

using namespace std;

int main() {
	int x;
	char wqs[MYDD];	//2016年是闰年
	while(scanf("%d of %s",&x,wqs)!=EOF) {
		if(strcmp(wqs,"week")==0) {
			if(x==6||x==5)//坑人昂，明天是最后一天
				puts("53");
			else
				puts("52");
		} else {
			if(x==30)
				puts("11");
			else if(x==31)//......
				puts("7");	
			else
				puts("12");
		}
	}
	return 0;
}

/*
4 of week
30 of month
31 of month
29 of month
*/