Codeforces New Year and Days
2016-07-21 19:16
330 查看
New Year and Days
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
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.
找规律题目
已知平年有52周零1天
闰年有52周零2天
2016年为闰年,并且第一天为周五
所以一年有53个周五周六,其余为52
一年有12个月有29号
一年有11个月有30号
一年有7个月有31号
代码:
#include<stdio.h>
int main()
{
int x;
char a[6];
scanf("%d of %s",&x,a);
if(a[0]=='w')
{
if(x==5||x==6)
printf("53\n");
else
printf("52\n");
}
else
{
if(x==31)
printf("7\n");
else if(x==30)
printf("11\n");
else
printf("12\n");
}
return 0;
}
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status
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
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.
找规律题目
已知平年有52周零1天
闰年有52周零2天
2016年为闰年,并且第一天为周五
所以一年有53个周五周六,其余为52
一年有12个月有29号
一年有11个月有30号
一年有7个月有31号
代码:
#include<stdio.h>
int main()
{
int x;
char a[6];
scanf("%d of %s",&x,a);
if(a[0]=='w')
{
if(x==5||x==6)
printf("53\n");
else
printf("52\n");
}
else
{
if(x==31)
printf("7\n");
else if(x==30)
printf("11\n");
else
printf("12\n");
}
return 0;
}
相关文章推荐
- POJ 3368 Frequent values 线段树 || RMQ
- 1070. Mooncake (25)-PAT甲级真题
- 【Redis系列】Redis数据持久化
- 统计学习方法五:决策树
- UVA - 673 Parentheses Balance
- 获取缓存大小和清除缓存功能
- Servlet
- UVA - 10152 ShellSort
- AndroidStudio设置三步走
- Linux下安装jdk
- Java链栈
- scrollview滑动跟侧滑的冲突
- 2016.07.08【初中部 NOIP提高组 】模拟赛C
- 1061. Dating (20)-PAT甲级真题
- (转)FTP操作类,从FTP下载文件
- UVA - 133 The Dole Queue
- 如何实现 Android 应用的持续部署?
- RISC诞生与发展的缩影
- UVA - 101 The Blocks Problem
- 几种UML类图关系