New Year and Days
来源:互联网 发布:centos git ssh配置 编辑:程序博客网 时间:2024/05/16 18:40
New Year and Days
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.
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.
Print one integer — the number of candies Limak will save in the year 2016.
4 of week
52
30 of month
11
Polar bears use the Gregorian calendar. It is the most common calendar and you likely use it too. 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.
思维题
要理解题意
#include <iostream>#include <cstdio>#include <cstring>int main(){int n;char str[100];while(~scanf("%d",&n)){ getchar(); gets(str);if(str[3]=='w'){if(n==5||n==6)printf("53\n");else printf("52\n");}if(str[3]=='m'){if(n==30)printf("11\n");else if(n==31)printf("7\n");else printf("12\n");}}return 0;}
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- A. New Year and Days
- Codeforces New Year and Days
- 【codeforces】New Year and Days
- G - New Year and Days
- 【codeforces】New Year and Days
- CodeForces 611A New Year and Days
- 【CodeForces】[659A]New Year and Days
- TensorFlow实战:Chapter-5(CNN-3-经典卷积神经网络(GoogleNet))
- 执行Class.forName 报错 com.mysql.jdbc.Driverjava.lang.NullPointerException
- CPU下的计时与GPU计时对比
- 对nginx学习记录
- 交叉编译工具链的构建原理
- New Year and Days
- python基础第二篇
- Android插件化与其构建流程
- SQL-SERVER2008 存储过程-子过程回滚
- MySql错误:[Err] 1292
- POJ 1258 Agri-Net(最小生成树-Prim)
- 15入门阶段综合练习
- 【HDU】6048
- 让你用一次就会爱上的 5 个 web 工具类产品