codeforces 611A New Year and Days
来源:互联网 发布:萧山网络歌手大赛2011 编辑:程序博客网 时间:2024/05/16 09:57
点击打开链接
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.
题意很好理解,关键是周五和周六,他们是属于2016,具体的就是这两天在这一年中有53次,其它的只有52次。
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>typedef long long ll;using namespace std;const ll mod=100000000;int main(){ int a[]= {31,29,31,30,31,30,31,31,30,31,30,31}; //瑞年 //int b[]={31,28,31,30,31,30,31,31,30,31,30,31};//平年 int x; char p[10],q[10]; cin>>x>>p>>q; if(strcmp(q,"week")==0) { if(x==5||x==6) cout<<53<<endl; else cout<<52<<endl; } else { int s=0; for(int i=0; i<12; i++) { if(a[i]>=x) s++; } cout<<s<<endl; } return 0;}
- 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 611 A. New Year and Days(水~)
- 【CodeForces】611A - New Year and Days(水)
- 【Codeforces】-611A-New Year and Days(水)
- Codeforces New Year and Days
- 【codeforces】New Year and Days
- 【codeforces】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
- New Year and Days
- 深度学习之----Dropout浅层理解与实现
- php 冒泡排序
- 工欲善其事必先利器(二)——IDE——IntelliJ IDEA学习指南
- Ubuntu各个版本的镜像下载地址
- JDK的安装及环境变量的配置
- codeforces 611A New Year and Days
- uva12627 Erratic Expansion (递归)
- 代码传递信息方式的探究
- python3 property调用私有方法用法
- HDU-6000 Wash 贪心 队列
- 【TP】产线检测CTP单体异常
- J: Our Journey of Dalian Ends
- Kafka 简析
- BZOJ1455 罗马游戏 【左偏树】