A. Checking the Calendar
来源:互联网 发布:淘宝数据分析表格 编辑:程序博客网 时间:2024/05/16 14:34
You are given names of two days of the week.
Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the first day of the next month was equal to the second day of the week you are given. Both months should belong to one year.
In this problem, we consider the Gregorian calendar to be used. The number of months in this calendar is equal to 12. The number of days in months during any non-leap year is: 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31.
Names of the days of the week are given with lowercase English letters: "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".
The input consists of two lines, each of them containing the name of exactly one day of the week. It's guaranteed that each string in the input is from the set "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday".
Print "YES" (without quotes) if such situation is possible during some non-leap year. Otherwise, print "NO" (without quotes).
mondaytuesday
NO
sundaysunday
YES
saturdaytuesday
YES
In the second sample, one can consider February 1 and March 1 of year 2015. Both these days were Sundays.
In the third sample, one can consider July 1 and August 1 of year 2017. First of these two days is Saturday, while the second one is Tuesday.
解题说明:此题是一道模拟题,判断给出的星期是否位于同一年中的两个月相同的日子里,最简单的做法是暴力枚举,第一个星期连续加上每个月的天数,判断是否等于第二个星期。
#include<cstdio>#include <cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>#include <map>using namespace std;char day[][20] = { "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday" };int dl[] = { 31,28,31,30,31,30,31,31,30,31,30,31 };int getday(char ss[20]){int i;for (i = 0; i < 7; i++){if (strcmp(ss, day[i]) == 0){break;}}return i;}int main(){char ss[20];int d1, d2;int i;scanf("%s", ss);d1 = getday(ss);scanf("%s", ss);d2 = getday(ss);for (i = 0; i < 12; i++){if ((d1 + dl[i]) % 7 == d2){break;}}if (i < 12) {printf("YES\n");}else{printf("NO\n");}return 0;}
- A. Checking the Calendar
- A. Checking the Calendar
- 【63.63%】【codeforces 724A】Checking the Calendar
- [codeforces]A. Checking the Calendar 水题
- Codeforces 724A. Checking the Calendar
- Codeforces 724A-Checking the Calendar
- CodeForces 724A Checking the Calendar
- Codeforces Round Intel Code Challenge Final Round A.Checking the Calendar
- Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) -- A. Checking the Calendar(思路)
- Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)A. Checking the Calendar
- CodeForces 724A Checking the Calendar(月份星期的判断,第四场掉分了)
- poj2758 checking the text
- poj2758 checking the text
- Poj2758 Checking the Text
- Checking a Range
- A - Calendar
- A - Calendar
- A - Calendar
- ASP.NET Core 介绍和项目解读
- 链表的逆序
- Azure CDN Smart Routing 功能正式上线
- 文献管理之histcite
- poj3255 次短路裸题
- A. Checking the Calendar
- Codeforces 734C. Anton and Making Potions
- LeetCode 438: Find All Anagrams in a String
- 类与对象
- 天赋 VS 勤奋,“一万小时定律” 没你想得那么简单
- Python正则表达式
- CSDN-markdown编辑器
- All in All
- oracle 锁机制