Problem:
Score: 100 points

Problem Statement

In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.

Integers M_1, D_1, M_2, and D_2 will be given as input.

It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.

Determine whether the date 2019-M_1-D_1 is the last day of a month.

Constraints

Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.

The date 2019-M_2-D_2 follows 2019-M_1-D_1.

Input

Input is given from Standard Input in the following format:

M_1 D_1
M_2 D_2

Output

If the date 2019-M_1-D_1 is the last day of a month, print 1; otherwise, print 0.

Sample Input 1

11 16
11 17

Sample Output 1

0

November 16 is not the last day of a month.

Sample Input 2

11 30
12 1

Sample Output 2

1

November 30 is the last day of November.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>

#define fread freopen("in.txt","r",stdin)
#define fwrite freopen("out.txt","w",stdout)
#define PI acos(-1)
#define ll long long
#define MAX 100005

using namespace std;

int main()
{
    int m1, m2 , d1, d2;
    cin>>m1>>d1>>m2>>d2;
    if(m1>m2)swap(m1,m2);
    if(d1<d2)swap(d1,d2);
//    if(m1 == 1 && m2 == 12)
//    {
//        if((d1 == 29 && d2 == 1) || (d1 == 30 && d2 == 1) || (d1 == 28 && d2 == 1))
//            cout<<"1"<<endl;
//        else cout<<"0"<<endl;
//    }
//    else
//    {
        int x = m2-m1;
        if(x == 1)
        {
            if((d1 == 29 && d2 == 1) || (d1 == 30 && d2 == 1) || (d1 == 28 && d2 == 1))
            cout<<"1"<<endl;
            else cout<<"0"<<endl;
        }
        else
        {
            cout<<"0"<<endl;
        }
//    }

    return 0;
}