CodeForces611ANew Year and Days（数学，打表）

Description
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" where x (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" where x (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 Input
Input
4 of week
Output
52
Input
30 of month
Output

11

代码：

#include<stdio.h>
#include<string.h>
int main()
{
	int n;
	char a[3],b[5];
	int year[32]={0,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,12,11,7};
	while(~scanf("%d%s%s",&n,a,b))
	{
		if(b[0]=='w')
		{
		if(n==1||n==2||n==3||n==4||n==7)
		printf("52\n");	
		else
		printf("53\n");
		}
		else if(b[0]=='m')
		{
		printf("%d\n",year[n]);	
		}
	}
	return 0;
}

思路：

告诉你5015最后一天是星期三，小熊想要在2016年攒糖果，他可以每星期的某天攒一个，也可以每个月的某天攒一个，问你不同攒法一年可以攒多少个。首先是星期，因为最后一天是星期三，所以新年第一天是星期四，然后2016年是闰年，366/7=52---2，所以只有星期五和星期六多一天，其他的都是52.然后看月份，除了30有11月，31有7月外其他的都是12个月，保存个数组直接输出就好了。开始判断星期或者月份时可以保存两个数组，看数组开头是‘w’或者‘m’就可以判断了。（注意数组类型不要弄错，开始查找星期或者月份的char数组保存为int了，结果怎么输出都不对）