A10083 | New Year and Days
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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.
- " $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.
输出格式
Print one integer — the number of candies Limak will save in the year 2016.
输入输出样例
输入 #1
4 of week
输出 #1
52
输入 #2
30 of month
输出 #2
11
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](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.
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted