题库练习 Checking the Calendar
← 上一题 下一题 →

A10626 | Checking the Calendar

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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).

输入输出样例

输入 #1
monday
tuesday
输出 #1
NO
输入 #2
sunday
sunday
输出 #2
YES
输入 #3
saturday
tuesday
输出 #3
YES
C++ 编辑器
输入
输出