Codeforces Good Bye 2015 A. New Year and Days （水）

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 last day of the year 2015.

Limak is a little polar bear. He enjoyed this year a lot. Now, he is so eager to the coming year 2016.

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

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

Input
The only line of the input 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 of candies Limak will save in the year 2016.

Sample test(s)

Input

4 of week

Output

52

Input

30 of month

Output

11

Note
Polar bears use the Gregorian 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 sample Limak wants to save one candy on each Thursday (the 4-th day of the week). There are52 Thursdays in the 2016. Thus, he will save52 candies in total.

In the second sample Limak wants to save one candy on the 30-th day of each month. There is the 30-th day in exactly11 months in the 2016 — all months but February. It means that Limak will save11candies in total.

题意：给你那个人领糖果的时间，求在2016年能领多少个糖果

思路：简单题不多说了，注意2016年是从周6开始的，而且2016年是闰年

总结：考虑到不全面，WA了两发

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 60001
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
using namespace std;
char s[MAXN];
int main()
{
int i;
gets(s);
int len=strlen(s);
int num=0;
for(i=0;i<len;i++)
{
if(s[i]>='0'&&s[i]<='9')
num=num*10+s[i]-'0';
}
//printf("%d\n",num);
int l=len-1;
int bz;
while(l)
{
if(s[l]!=' ')
{
if(s[l]=='k')
bz=0;
else
bz=1;
break;
}
l--;
}
if(bz)
{
if(num<30)
printf("12\n");
else if(num>30)
printf("7\n");
else
printf("11\n");
}
else
{
if(num==6||num==5)
printf("53\n");
else
printf("52\n");
}
return 0;
}