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.



Sample input:
11 16
11 17


Sample output:
0

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math

#import bisect

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def main():
#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]
    m1,d1=map(int,input().split())
    m2,d2=map(int,input().split())
    print("1") if d2==1 else print(0)

#    print(n,kingaku(a,b,x))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
m1,d1=map(int, input().split()) 
m2,d2=map(int, input().split()) 

if (m1!=m2):
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m1, d1 = map(int,input().split())
m2, d2 = map(int,input().split())
if(m1 != m2):
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m,d = map(int,input().split())
a,b = map(int, input().split())
print(0 if a == m else 1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if M1 != M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if M2 != M1 and D2 == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c,d,=map(int,input().split())
if a==c:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
C,D=map(int,input().split())
if A==C:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
M1, _ = input().split()
M2, _ = input().split()
if M1 == M2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print('0' if m1 == m2 else '1')

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if (m2 - m1) == 1 and d2 == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
M1, D1 = inpl()
M2, D2 = inpl()
if M2 > M1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m1 , d1 = map(int,input().split())
m2 , d2 = map(int,input().split())
if m1 == m2:
    print("0")
else:
    print("1")

Submission status: Accepted

Solution code:
def examA():
    M1, D1 = LI()
    M2, D2 = LI()
    if D1+1==D2:
        ans = 0
    else:
        ans = 1
    print(ans)
    return


def examB():
    return

def examC():
    return

def examD():
    return
def examE():
    return

def examF():
    return

import sys,copy,bisect,itertools,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a = l()

b = l()


if a[0] + 1  == b[0] and  b[1] == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
def main():
    m1,d1=map(int,input().split())
    m2,d2=map(int,input().split())

    if m1 != m2:
        print(1)
    else:
        print(0)
if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 == m2:
    answer = 0
else:
    answer = 1

print(answer)

Submission status: Accepted

Solution code:
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
if m2==m1:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
Ma, Da = map(int, input().split())
Mb, Db = map(int, input().split())
if (Ma == 12 and Mb == 1) or Mb > Ma:
    print("1")
else:
    print("0")

Submission status: Accepted

Solution code:
def main():
    m1,d1 = map(int,input().split())
    m2,d2 = map(int,input().split())
    if m1==m2:
        print('0')
    else:
        print('1')
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if not M1 == M2:
    print('1')
else:
    print('0')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(M: "List[int]", D: "List[int]"):
    print(int(M[0]!=M[1]))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    M = [int()] * (2)  # type: "List[int]"
    D = [int()] * (2)  # type: "List[int]"
    for i in range(2):
        M[i] = int(next(tokens))
        D[i] = int(next(tokens))
    solve(M, D)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
M1,D1=map(int,input().split())
M2,D2=map(int,input().split())

print(1 if M1!=M2 else 0)

Submission status: Accepted

Solution code:
M,D = map(int,input().split())
m,d = map(int,input().split())
ans = 0
if d == 1:
    ans = 1
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c, d = map(int, input().split())


if c == a+1:
    print("1")
else:
    print("0")

Submission status: Accepted

Solution code:
M1,D1 = map(int,input().split())
M2,D2 = map(int,input().split())
if M1!=M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c,d = map(int,input().split())
if a != c:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c, d = map(int, input().split())

if a == c:
    print('0')
else:
    print('1')

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

print(1) if m1 != m2 else print(0)

Submission status: Accepted

Solution code:
M1, D1 = list(map(int, input().split()))
M2, D2 = list(map(int, input().split()))
print(1 if M1+1==M2 else 0)

Submission status: Accepted

Solution code:
M1,D1 = map(int,input().split())
M2,D2 = map(int,input().split())

if(M1 != M2): print(1)
else: print(0)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    m1, d1 = rli()
    m2, d2 = rli()
    if m1 != m2:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
M1,D1= map(int,input().split(' '))
M2,D2= map(int,input().split(' '))
if D2 > D1:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if M1 == M2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if M1 == M2:
    print (0)
else:
    print (1)

Submission status: Accepted

Solution code:
def main():
    # input
    m1, d1 = map(int, input().split())
    m2, d2 = map(int, input().split())

    if d2 == 1:
        print(1)
    else:
        print(0)

    # calc


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b=map(int, input().split())

c,d=map(int, input().split())

if a==c:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
C, D = map(int, input().split())

if A == C:
        print(0)
else:
        print(1)

Submission status: Accepted

Solution code:
M1, D1 = map(int,input().split())
M2, D2 = map(int,input().split())

if M1 != M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
def main():
    M1, D1 = map(int, input().split())
    M2, D2 = map(int, input().split())
    if M1 == M2:
        print(0)
    else:
        print(1)



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
m1, d1 = map(int,input().split())
m2, d2 = map(int,input().split())

if m1 == m2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
C,D = map(int, input().split())

if A==C:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
m1 ,d1 = map(int, input().split())
m2 ,d2 = map(int, input().split())

if m1 != m2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M, D = map(int, input().split())
m, d = map(int, input().split())

if M != m:
    print(1)

else:
    print(0)

Submission status: Accepted

Solution code:
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(0 if d1+1==d2 else 1)

Submission status: Accepted

Solution code:
m,d = map(int,input().split())
M,D = map(int,input().split())
if m != M:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
m1,_=map(int,input().split())
m2,_=map(int,input().split())
print(1 if m1<m2 else 0)

Submission status: Accepted

Solution code:
# coding: utf-8
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 == m2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	M1, D1 = getlist()
	M2, D2 = getlist()
	if M1 == M2:
		print(0)
	else:
		print(1)

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if d2 == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
import math
input = sys.stdin.readline


def main():
    sc = Scan()
    m1 = sc.intarr()[0]
    m2 = sc.intarr()[0]

    if m1 == m2:
        print("0")
    else:
        print("1")


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def intarr_ver(self, n):
        return [int(input()) for _ in range(n)]

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


def display(array):
    for a in range(len(array)):
        if len(array) - a != 1:
            print(array[a], end=' ')
        else:
            print(array[a])


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 
import math
import sys
import itertools
import numpy as np

# なんこか入力
a,b = map(int, input().split())
# なんこか入力
c,d = map(int, input().split())

if a==c:
    print("0")
else:
    print("1")

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if D2 - D1 == 1:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
m_1,d_1 = map(int, input().split())
m_2,d_2 = map(int, input().split())
if m_1==m_2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
# A
a, b = map(int, input().split())
c, d = map(int, input().split())
if a != c:
    print(str(1))
else:
    print(str(0))

Submission status: Accepted

Solution code:
M1,D1 = map(int,input().split())
M2,D2 = map(int,input().split())

if D2 == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if d2 == 1:
    print(1)
else:
    print(0)
exit(0)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m2 - m1 == 1:
    print("1")
else:
    print("0")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
a2,b2=map(int,input().split())
if a!=a2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
n1,m1=map(int,input().split())
n2,m2=map(int,input().split())
if m1<m2:
  print(0)
else:
  print(1)

Submission status: Accepted

Solution code:
m_1,d_1=map(int,input().split())
m_2,d_2=map(int,input().split())
if m_1!=m_2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:

m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if d1>d2:
  ret="1"
else:
  ret="0"

print(ret)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c,d = map(int,input().split())

if d == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m1, d1 = input().split()
m2, d2 = input().split()
print(int(m1 != m2))

Submission status: Accepted

Solution code:
M1,D1 = map(int,input().split())
M2,D2 = map(int,input().split())
print(1 if M1!=M2 and D2==1 else 0)

Submission status: Accepted

Solution code:
list = input()
x,y = map(int,input().split(" "))
if y==1:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(1 if m1 != m2 else 0)

Submission status: Accepted

Solution code:
M1, D1 = [int(i) for i in input().split()]
M2, D2 = [int(i) for i in input().split()]

if M1 + 1 == M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()]
C, D = [int(x) for x in stdin.readline().rstrip().split()]

if B + 1 != D:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M1,D1 = map(int, input().split())
M2,D2 = map(int, input().split())

if M1!=M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
inf=float("inf")
md=[list(map(int,input().split())) for i in range(2)]
if md[0][0]!=md[1][0]:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
A, B, C, X = map(int, open(0).read().split())
if X!=1:print(0)
else:print(1)

Submission status: Accepted

Solution code:
a,b= map(int, input().split())
c,d= map(int, input().split())

if(a==c):
  print(0)
else:
  print(1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if d2 == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m, d = input().split()
m,d = input().split()
if d == "1":
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
INF = 10**30

def main():
    m1, d1 = list(map(int, input().strip().split()))
    m2, d2 = list(map(int, input().strip().split()))
    if m1 != m2:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
M1,D1=map(int,input().split())
M2,D2=map(int,input().split())

if M1+1==M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
from sys import stdin


def input():
    return stdin.readline()[:-1]


def intput():
    return int(input())


def sinput():
    return input().split()


def intsput():
    return map(int, sinput())


# Code


x, y = intsput()

a, b = intsput()

if (x != a):
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
print(int(input().split()[0] < input().split()[0]))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())


if M1 == M2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
m1, d1 = [int(x) for x in input().strip().split()]
m2, d2 = [int(x) for x in input().strip().split()]
if m1 == m2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
M1,D1 = map(int, input().split())
M2,D2 = map(int, input().split())
if(M1 != M2):
    print("1")
else:
    print("0")

Submission status: Accepted

Solution code:
import math
import itertools

def read():
    M1, D1 = list(map(int, input().strip().split()))
    M2, D2 = list(map(int, input().strip().split()))
    return M1, D1, M2, D2


def solve(M1, D1, M2, D2):
    if M1 != M2:
        return 1
    return 0
    
if __name__ == '__main__':
    inputs = read()
    output = solve(*inputs)
    print("%d" % output)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
if a+1==c:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
if a!=c:
	print(1)
else:
	print(0)

Submission status: Accepted

Solution code:
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
print(1 if m1!=m2 else 0)

Submission status: Accepted

Solution code:
M1,D1=map(int,input().split())
M2,D2=map(int,input().split())

print(1 if M1 != M2 else 0)

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if M1 != M2:
	print("1")
else:
	print("0")

Submission status: Accepted

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    m1,d1 = mi()
    m2,d2 = mi()

    if m1 == m2:
        print(0)
    else:
        print(1)
    


        


main()

Submission status: Accepted

Solution code:
m1,d1=map(int, input().split())
m2,d2=map(int, input().split())
if d2==1:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())

if m1 == m2:
  print(0)
else:
  print(1)

Submission status: Accepted

Solution code:
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())

if d2==1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys
from itertools import combinations, permutations

def solve():
    input = sys.stdin.readline
    M1, D1 = map(int, input().split())
    M2, D2 = map(int, input().split())
    if M1 != M2: print(1)
    else: print(0)

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
tmp = input().split()
M1 = int(tmp[0])
D1 = int(tmp[1])
tmp = input().split()
M2 = int(tmp[0])
D2 = int(tmp[1])

if D2 == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M1, D1= map(int, input().split())
M2, D2 = map(int, input().split())

if M1 != M2:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
m1,d1 = list(map(int, input().split()))
m2,d2 = list(map(int, input().split()))

print(0 if m1 == m2 else 1)

Submission status: Accepted

Solution code:
M1,D1=map(int,input().split())
M2,D2=map(int,input().split())

print(0 if M1==M2 else 1)

Submission status: Accepted

Solution code:
m1,d1 = list(map(int,input().strip().split()))
m2,d2 = list(map(int,input().strip().split()))
if d2 == 1:
    print("1")
else:
    print("0")

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split()]
a, b = [int(x) for x in input().split()]
if N != a:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
if M1 == M2:
    print("0")
else:
    print("1")

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())

if M1 == M2: print(0)
else: print(1)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 < m2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
a = input()
b, c = map(int, input().split())
if c == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M1, D1 = list(map(int, input().split()))
M2, D2 = list(map(int, input().split()))

if M1 == M2 - 1 and D2 == 1:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())

if m1==m2:
    print(0)
elif m1!=m2:
    print(1)

Submission status: Accepted

Solution code:
M1,D1=map(int,input().split())
M2,D2=map(int,input().split())
if M1+1==M2:
  print(1)
else:
  print(0)

Submission status: Accepted

Solution code:
M1, D1 = map(int,input().split())
M2, D2 = map(int,input().split())

if M1==M2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
import sys
import math
from itertools import permutations
from itertools import combinations

#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1!=m2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
print(1) if d2 == 1 else print(0)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 == m2:
	print (0)
else:
	print (1)

Submission status: Accepted

Solution code:
def main():
    M1, D1 = map(int, input().split())
    M2, D2 = map(int, input().split())
    if M1 != M2:
        print(1)
    else:
        print(0)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
words = lambda t : list(map(t, input().split()))
a,b = words(int)
c,d = words(int)

if a != c:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
if D2 == 1:
  print(1)
else:  
  print(0)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    m1, d1 = LI()
    m2, d2 = LI()
    if m1 != m2:
        print("1")
    else:
        print("0")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

m1,d1 = MAP()
m2,d2 = MAP()

if m1!=m2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if d2 == 1:
    print('1')
else:
    print('0')

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1 != m2:
    print(1)

else:
    print(0)

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    M1,D1 = LMIIS()
    M2,D2 = LMIIS()
    if M1!=M2:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
M1, D1 = map(int, input().split())
M2, D2 = map(int, input().split())
print(int(M1 != M2))

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# a, b = list(map(int, input().split()))
# s = input()


a, b = list(map(int, input().split()))
c, d = list(map(int, input().split()))
if d == 1:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
if m1!=m2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
def read_values():
    return map(int, input().split())


def read_list():
    return list(read_values())


def main():
    M1, D1 = read_values()
    M2, D2 = read_values()
    print(1 if M1 != M2 else 0)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#%%
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 == m2:
	print(0)
else:
	print(1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
AtCoder A
"""

import sys, math, random
import numpy as np

# N = int(input())
# A = list(map(int,input().split())) # N row 1 column
# A = [int(input()) for _ in range(N)] # 1 row N column
# S = str(input()) # str(input()) == input() -> 'abc'
# S = list(input()) # abc -> ['a','b','c']
# S.replace('ABC','X') # "testABCABC" -> "testXX"
# S=numpp.assaray(S)=="#"
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LLS(): return [list(sys.stdin.readline().rstrip()) for _ in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()



def main():
    M1, D1 = list(map(int,input().split()))
    M2, D2= LI()
    if M1==M2:
        print(0)
    else:
        print(1)

    # print(A,B)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
M, D = map(int, input().split())
M1, D1 = map(int, input().split())
if M == M1:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#


def main():
    a,_ = mis()
    b,_ = mis()
    print(int(a!=b))


main()

Submission status: Accepted

Solution code:
m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())

if d2 == 1:
    print('1')
else:
    print('0')

Submission status: Accepted

Solution code:
a,_,b,_=map(int,open(0).read().split())
print(int(a!=b))

Submission status: Accepted

Solution code:
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())

if m1+1 ==  m2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
M1,D1 = [int(i) for i in input().split()]
M2,D2 = [int(i) for i in input().split()]

if M1!=M2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
# coding: utf-8
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2 and d1 != d2:
    print(1)
else:
    print(0)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    m1, d1 = list(map(int, readline().split()))
    m2, d2 = list(map(int, readline().split()))
    print(1 if m1 != m2 and m1 < m2 else 0)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
if m1==m2:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
def main():
    M1, D1 = list(map(int, input().split()))
    M2, D2 = list(map(int, input().split()))
    if M1 == M2:
        print(0)
    else:
        print(1)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=[int(i)for i in input().split()]
c,d=[int(i)for i in input().split()]
print(int(a!=c))

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

m1, d1 = li()
m2, d2 = li()

print(1 if m1 != m2 else 0)

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split()]
c,d = [int(i) for i in input().split()]

if a == c:
    print(0)
else:
    print(1)

Submission status: Accepted

Solution code:
#n = input()
#a,b = map(int,input().split())
#L = list(map(int,input().split()))

a,b = map(int,input().split())
c,d = map(int,input().split())

if a!=c:
    print(1)
else:
    print(0)