New Year and Days
2016-01-07 15:36
316 查看
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
Output
Input
Output
Hint
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 are
52 Thursdays in the 2016. Thus, he will save
52 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 exactly
11 months in the 2016 — all months but February. It means that Limak will save
11 candies in total.
2016年是闰年,有52周,各多出一天周五和周六,每周第一天是周日。
败给了常识...
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
Hint
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 are
52 Thursdays in the 2016. Thus, he will save
52 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 exactly
11 months in the 2016 — all months but February. It means that Limak will save
11 candies in total.
2016年是闰年,有52周,各多出一天周五和周六,每周第一天是周日。
败给了常识...
#include<stdio.h> #include<string.h> int main(){ int n,sum,len; char str[100]; while(~scanf("%d",&n)){ gets(str); len=strlen(str); if(str[len-1]=='k'){ if(n<=4){ sum=52; } else if(n==6){ sum=53; } else if(n==5){ sum=53; } else if(n==7){ sum=52; } } else{ if(n<=29){ sum=12; } else if(n==30){ sum=11; } else if(n==31){ sum=7; } } printf("%d\n",sum); memset(str,0,sizeof(str)); } return 0; }
相关文章推荐
- 缩略图、水印、验证码
- 前端移动端页面开发
- 代理、nsnotification和kvo的区别和用法
- js密码强度检测
- 转载 注解@PostConstruct与@PreDestroy讲解及实例 - 云淡风轻、仅此一抹 - 博客频道 - CSDN.NET http://blog.csdn.net/yaerfeng/art
- 跟我一起写 Makefile(十二)
- java Enumeration用法
- iOS第一个简单APP
- UILabel使用不同的大小和字体、颜色
- jQuery版本冲突问题解决与分析
- MyBatis增删改查总结
- spring security+extjs session超时解决方案 博客分类: 软件架构
- IO库 8.4
- 前端自动化学习笔记(一)——Yeoman,bower,Grunt的安装
- 诡异的精度diff追查
- NestedScrollView 嵌套 RecyclerView
- 跟我一起写 Makefile(十一)
- 跟我一起写 Makefile(十)
- Android DrawerLayout 高仿QQ5.2双向侧滑菜单
- 软件过程与方法---课堂总结2 第三章 惯例过程模型