Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)A. Checking the Calendar

A. Checking the Calendar

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Input

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

Output

Print "YES" (without quotes) if such situation is possible during some non-leap year. Otherwise, print "NO" (without quotes).

Examples

input

monday
tuesday

output

NO

input

sunday
sunday

output

YES

input

saturday
tuesday

output

YES

Note

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.

原题链接：http://codeforces.com/contest/724/problem/A

水题：告诉你连续两个月每个月1号星期几，问你是否存在。

注意：都是平年。

水题，更考验玩家水平。

我的渣渣代码：暴力。

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <map>
using namespace std;

int month[12]= {31,28,31,30,31,30,31,31,30,31,30,31};
const char *week[]=
{
    "monday",
    "tuesday",
    "wednesday",
    "thursday",
    "friday",
    "saturday",
    "sunday"
};
int main()
{
    map<string,int>mp;
    for(int i=0; i<7; i++)
    {
        mp[week[i]]=i;
    }
    char a[10],b[10];
    while(cin>>a>>b)
    {
        int x=mp[a];
        int y=mp[b];
        bool flag=false;
        for(int i=0; i<12; i++)
        {
            int sum=month[i]+x;
            if((sum%7==mp[b]))
            {
                flag=true;
                break;
            }
        }
        if(flag)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

高手代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    map<string,int>M;
    M["monday"]=1;
    M["tuesday"]=2;
    M["wednesday"]=3;
    M["thursday"]=4;
    M["friday"]=5;
    M["saturday"]=6;
    M["sunday"]=7;
    string s1,s2;
    cin>>s1>>s2;
    int x=(M[s2]-M[s1]+7)%7;
    puts(x==0||x==3||x==2?"YES":"NO");
    return 0;
}