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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int endmCheck(int m, int d) {
	switch (m)
	{
	case 1:
	case 3:
	case 5:
	case 7:
	case 8:
	case 10:
	case 12:
		if (d == 31) {
			return 1;
		}
		break;
	case 4:
	case 6:
	case 9:
	case 11:
		if (d == 30) {
			return 1;
		}
		break;
	case 2:
		if (d == 28) {
			return 1;
		}
		break;
	default:
		return 0;
		break;
	}
}

int main() {
	int d1, d2, m1, m2, checker;
	scanf("%d %d", &m1, &d1);
	scanf("%d %d", &m2, &d2);
	checker = endmCheck(m1, d1);
	printf("%d", checker);
	return 0;
}