【CodeForces】611A - New Year and Days(水)
来源:互联网 发布:ubuntu 邮件阅读器 编辑:程序博客网 时间:2024/05/16 14:12
点击打开题目
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. 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.
看代码应该能懂,难度不大。
代码如下:
#include <cstdio>int month[] = {0,31,29,31,30,31,30,31,31,30,31,30,31};int ant;char t[5];char op[10];int main(){int ans;while (~scanf ("%d %s %s",&ant,t,op)){ans = 0;if (op[0] == 'm'){for (int i = 1 ; i <= 12 ; i++)if (month[i] >= ant)ans++;printf ("%d\n",ans);}else{ans = 366 / 7;if (ant == 5 || ant == 6)ans++;printf ("%d\n",ans);}}return 0;}
- CodeForces 611 A. New Year and Days(水~)
- 【CodeForces】611A - New Year and Days(水)
- 【Codeforces】-611A-New Year and Days(水)
- CodeForces 611A New Year and Days
- CodeForces 611A New Year and Days
- 【CodeForces 611A】New Year and Days
- codeforces 611A New Year and Days
- 【CodeForces】[659A]New Year and Days
- Codeforces New Year and Days
- 【codeforces】New Year and Days
- 【codeforces】New Year and Days
- Codeforces Good Bye 2015 A. New Year and Days (水)
- A. New Year and Days
- Codeforces Good Bye 2015 A. New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- New Year and Days
- eCongnition中NN分类和规则分类理解
- JAVA CAS原理深度分析
- hdu g++开栈
- NKOI 1905 慢跑小路
- linux tail 命令动态显示日志信息
- 【CodeForces】611A - New Year and Days(水)
- 百度工程师讲PHP函数的实现原理及性能分析(三)
- linux环境变量及权限的理解
- Caffe +VS2013+WINDOWS 64位 无gpu 配置
- Java 编程思想——第一章:对象导论
- Java之详解坦克大战游戏(六)
- jQuery 3.0新特性总结
- Codeforces 84A Toy Army
- 百练 03 复杂的整数划分问题