Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03109 (python)

Fixed submission:
a=input().split('/')
a=a[0]+a[1]+a[2]
if int(a) > 20190430:
  print("TBD")
else:
  print('Heisei')

Buggy submission (verdict: Runtime Error):
a=input().split('/')
a=a[0]+a[1]+a[2]:
if int(a) > 2019430
  print("TDB")
else:
  print('Heisei')

Buggy submission (verdict: Runtime Error):
a=input().split('/')
a=a[0]+a[1]+a[2]
if int(a) > 2019430
  print("TDB")
else
  print('Heisei')
Problem p03210 (python)

Fixed submission:
a=int(input())
 
if a == 7 or a == 5 or a == 3:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a=int(input())

if a == 7 or a == 5 or a == 3:
  pritn("YES")
else:
  print("NO")
Problem p03292 (python)

Fixed submission:
a=list(map(int,input().split()))
out=abs(a[1]-a[0])+abs(a[2]-a[1])
for i in range(3):
    if i ==0:
        b=a[1]
        c=a[2]
    elif i==1:
        b=a[0]
        c=a[2]
    else:
        b=a[0]
        c=a[1]
    if ((abs(b-a[i])+abs(c-b))<out):
        out=abs(b-a[i])+abs(c-b)
    if ((abs(c-a[i])+abs(b-c))<out):
        out=abs(c-a[i])+abs(b-c)
print(out)

Buggy submission (verdict: Runtime Error):
a=list(map(int,input().split()))
b=[]
c=[1]*(a[0]-1)
for i in range(a[1]):
  b.append(list(map(int,input().split())))
b=sorted(b,key=lambda b:b[1])
for i in range(a[1]):
  if i!=0 and b[i-1][0]>=b[i][0]:
    continue
  if 0 in c[(b[i][0]-1):b[i][1]]:
    continue
  else:
    c[(b[i][1])-2]=0

print(c.count(0))
Problem p03293 (python)

Fixed submission:
a=input()
b=input()
for i in range(len(a)):
    if a==b:
        print("Yes")
        break
    
    a=a[-1]+a
    a=a[:len(a)-1]
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a=input()
b=input()
for i in range(len(a)):
    if a==b:
        print("Yes")
        break
    
    a=a[-1]+a
    a=a[:len(a)-1]
else:
    print("No"
Problem p03385 (python)

Fixed submission:
a=list(input())
if ('a' in a) & ('b' in a) & ('c' in a):
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a=list(input())
if 'a' in a & 'b' in a & 'c' in a:
  print('Yes')
else:
  print('No')
Problem p03407 (python)

Fixed submission:
s=input().split()
if (int(s[0])+int(s[1]))>=int(s[2]):
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
s=input()
s.split()
if (int(s[0])+int(s[1]))>=int(s[3]):
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
s=input()
s.split()
if (int(s[0])+int(s[1]))>=int(s[3]):
  print('YES')
else:
  print('NO')
Problem p03415 (python)

Fixed submission:
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Buggy submission (verdict: Runtime Error):
a=import()
b=import()
c=import()
print(a[0]+b[1]+c[2])
Problem p02639 (python)

Fixed submission:
import sys
 
input = sys.stdin.readline
 
s = input().rstrip()
 
s_1 = s.split(" ")
 
s_i = list(map(int,s_1))

for i,a in enumerate(s_i):
  if a == 0:
    print(i+1)
    break

Buggy submission (verdict: Runtime Error):
import sys

input = sys.stdin.readline

A=[int(input()) for _ in range(5)]

for i,a in enumerate(A):
  if a == 0:
    print(i)
    break
Problem p02641 (python)

Fixed submission:
import sys

def Forbidden_List(x,n,p):
  for i in range(n):
    if x - i not in p: 
        return x - i
    if x + i not in p:
        return x + i
  return x - n

if __name__ == '__main__':
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    x,n = int(inp1[0]),int(inp1[1])
    if n == 0:
        print(x)
    else: 
        inp2 = input().rstrip().split()
        p = list(map(int,inp2))
        print(Forbidden_List(x,n,p))

Buggy submission (verdict: Runtime Error):
import sys

def Forbidden_List(x,n,p):
  k = [abs(s - x) for s in p]
  for i in range(n):
    if i not in k: 
      return 10 - i
  return 10 - n

if __name__ == '__main__':
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    x,n = int(inp1[0]),int(inp1[1])
    if n == 0:
        print(x)
    else: 
     	inp2 = input().rstrip().split()
       	p = list(map(int,inp2))

        print(Forbidden_List(x,n,p))

Buggy submission (verdict: Runtime Error):
 import sys
  
def Forbidden_List(x,n,p):
  k = [abs(s - x) for s in p]
  for i in range(n):
    if i not in k: 
      return 10 - i
  return 10 - n
 
if __name__ == '__main__':
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    inp2 = input().rstrip().split()
    
    x,n = int(inp1[0]),int(inp1[1])
    if n == 0:
        print(x)
    else:
        p = list(map(int,inp2))
 
        print(Forbidden_List(x,n,p))
Problem p02642 (python)

Fixed submission:
import sys

def Not_Divisible(n,p):
    maxp = max(p)
    dp = [[True,0] for _ in range(maxp+1)]
    for a in p:
        dp[a][1]+=1
        t =2
        while a*t <= maxp:
            if dp[a*t][0] == True :
                dp[a*t][0] = False
            t+=1
    k=0
    for d in p:
        if dp[d][1] == 1 and dp[d][0] == True:
            k+=1
    return k


def main():
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    n = int(inp1[0])

    inp2 = input().rstrip().split()
    p = tuple(map(int,inp2))
    print(Not_Divisible(n,p))


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import sys

def Not_Divisible(n,p):
    k=0
    for j,b in enumerate(p):
    	for i,a in enumerate(p):
        	if  i != j and a % b == 0:
                k-=1
                break
        k+=1
    return k

if __name__ == '__main__':
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    n = int(inp1[0])

    inp2 = input().rstrip().split()
    p = list(map(int,inp2))
    print(Not_Divisible(n,p))

Buggy submission (verdict: Runtime Error):
import sys

def Not_Divisible(n,p):
    k=0
    for i,a in enumerate(p):
        for j,b in enumerate(p):
            if  i != j and a % b == 0:
                k-=1
                break
        k+=1
    return k

if __name__ == '__main__':
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    n = int(inp1[0])

    inp2 = input().rstrip().split()
    p = list(map(int,inp2))
    print(Not_Divisible(n,p)

Buggy submission (verdict: Runtime Error):
import sys

def Not_Divisible(n,p):
    k=0
    for i,a in enumerate(p):
        for j,b in enumerate(p):
            if  i != j and a % b == 0:
                k-=1
                break
        k+=1
    return k

if __name__ == '__main__':
    input = sys.stdin.readline
    
    inp1 = input().rstrip().split()
    n = int(inp1[0])

    inp2 = input().rstrip().split()
    p = list(map(int,inp2))
    print(Not_Divisible(n,p)
Problem p02900 (python)

Fixed submission:
# -*- coding: utf-8 -*-

def gcd(a,b):
    if b == 0:
        return a
    else:
        return gcd(b, a%b)

def factorize(a):
    ret = set()
    i = 2
    while i * i < a:
        if a % i != 0:
            i += 1
        else:
            while a % i == 0:
                a //= i
                ret.add(i)
            i += 1
    if a != 1:
        ret.add(a)
    return ret

def main():
    A, B = map(int,input().split())
    ABgcd = gcd(A, B)
    ABfactor = factorize(ABgcd)
    Ans = len(ABfactor) + 1
    print(Ans)

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import math


def factorize(a):
    ret = set()
    i = 2
    while i * i < a:
        if a % i != 0:
            i += 1
        else:
            while a % i == 0:
                a //= i
                ret.add(i)
            i += 1
    if a != 1:
        ret.add(a)
    return ret

def main():
    A, B = map(int,input().split())
    ABgcd = math.gcd(A, B)
    ABfactor = factorize(ABgcd)
    Ans = len(ABfactor) + 1
    print(Ans)

if __name__ == "__main__":
    main()
Problem p02936 (python)

Fixed submission:
# -*- coding: utf-8 -*-

N, Q = map(int,input().split())
Node = [-1] * N
Counter = [0] * N
Result = [0] * N

for i in range(N-1):
    a, b = map(int,input().split())
    Node[b-1] = a-1

for i in range(Q):
    p, x = map(int,input().split())
    Counter[p-1] += x

for i in range(N):
    p = i
    ans = 0
    while p >= i:
        ans += Counter[p]
        p = Node[p]
    Result[i] = ans
    if p >= 0:
        Result[i] += Result[p]

print(" ".join(list(map(str,Result))))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-



N, Q = map(int,input().split())
Node = []
Parsed = []
Counter = [0] * N
for i in range(N):
    Node.append([])
    Parsed.append([])

def parse(i):
    Parsed[i] += Node[i]
    for c in Node[i]:
        Parsed[i] += parse(c)
    #end for
    return Parsed[i]
        
for i in range(N-1):
    a, b = map(int,input().split())
    Node[a-1].append(b-1)
parse(0)
for i in range(N):
    Parsed[i].append(i)


for i in range(Q):
    p, x = map(int,input().split())
    for v in Parsed[p-1]:
        Counter[v] += x

print(" ".join(list(map(str,Counter))))
Problem p02957 (python)

Fixed submission:
# -*- coding: utf-8 -*-


A, B = map(int, input().split())

K = A + B
if K % 2 == 0:
    K = int((A + B) / 2)
    print(K)
else:
    print("IMPOSSIBLE")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

S = input()

MOD =[1,0,0,0,0,0,0,0,0,0,0,0,0]
NMOD =[0,0,0,0,0,0,0,0,0,0,0,0,0]

R10 = range(10)
R13 = range(13)

for i,D in enumerate(S):
    C = -1
    if D == '?':
        for N in R10:
            for M in R13:
                NM = (M * 10 + N) % 13
                NMOD[NM] += MOD[M]
            #end for
        #end for
    else:
        C = int(D)
        for M in R13:
            NM = (M * 10 + C) % 13
            NMOD[NM] += MOD[M]
        #end for
    #end if
    for M in R13:
        MOD[M] = NMOD[M]%1000000007
        NMOD[M] = 0
    #end for
#end for

print(MOD[5])
Problem p02639 (python)

Fixed submission:
x = list(map(int, input().split()))
if x[0] == 0: print(1)
if x[1] == 0: print(2)
if x[2] == 0: print(3)
if x[3] == 0: print(4)
if x[4] == 0: print(5)

Buggy submission (verdict: Runtime Error):
rint(15 - sum(list(map(int, input().split()))))
Problem p02782 (python)

Fixed submission:
p = 10 ** 9 + 7 # mod
N = (10 ** 6) * 2 + 10  # N は必要分だけ用意する
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

def cmb(r, n, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

a = list(map(int,input().split()))
ans = cmb(a[2]+1,a[2]+a[3]+2,p) - cmb(a[1],a[2]+a[1]+1,p) - cmb(a[0],a[3]+a[0]+1,p) + cmb(a[0],a[0]+a[1],p)
print(ans%p)

Buggy submission (verdict: Runtime Error):
p = 10 ** 9 + 7 # mod
N = (10 ** 6) + 10  # N は必要分だけ用意する
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

def cmb(r, n, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

a = list(map(int,input().split()))
ans = cmb(a[2]+1,a[2]+a[3]+2,p) - cmb(a[1],a[2]+a[1]+1,p) - cmb(a[0],a[3]+a[0]+1,p) + cmb(a[0],a[0]+a[1],p)
print(ans)
Problem p02814 (python)

Fixed submission:
from fractions import gcd
def lcm(a):

    x = a[0]
    for i in range(1, len(a)):
        x = (x * a[i]//2) // gcd(x, a[i]//2)
    return x

def map_all(es):
    return all([e == es[0] for e in es[1:]]) if es else False

n,m = map(int,input().split())
a = list(map(int,input().split()))
tmp = [0] * n
for i in range(n):
    tmpnum = a[i]
    while 1:
        if tmpnum%2:
            break
        else:
            tmpnum/=2
            tmp[i]+=1

if not map_all(tmp):
    print('0')
    exit()
    
tmplcm = lcm(a)


m -= tmplcm//2
ans = m // tmplcm +1

print(max(ans,0))

Buggy submission (verdict: Runtime Error):
import math

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

n,m = map(int,input().split())
a = list(map(int,input().split()))
tmplcm = 1
for i in a:
    tmplcm = lcm(tmplcm,i)


m -= tmplcm//2
ans = m // tmplcm +1
print(max(ans,0))

Buggy submission (verdict: Runtime Error):
import math
from functools import reduce

def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

n,m = map(int,input().split())
a = list(map(int,input().split()))

tmp = lcm(*a)
m -= tmp//2
ans = m // tmp +1
print(max(ans,0))
Problem p02846 (python)

Fixed submission:
t1, t2 = map(int,input().split())
a1, a2 = map(int,input().split())
b1, b2 = map(int,input().split())

a1 = t1*a1
a2 = t2*a2
b1 = t1*b1
b2 = t2*b2

if (a1 + a2) == (b1 + b2):
    print('infinity')
    exit(0)

elif (a1 + a2) > (b1 + b2):
    a1, b1 = b1, a1
    a2, b2 = b2, a2
if b1 > a1:
    print(0)
    exit(0)

tmp00 = a1 - b1
tmp01 = b1 + b2 - a1 - a2

ans = tmp00 // tmp01 * 2 + 1
if tmp00 % tmp01 == 0:
    ans -= 1

print(ans)

Buggy submission (verdict: Runtime Error):
t = list(map(int,(input().split())))
a = list(map(int,(input().split())))
b = list(map(int,(input().split())))
A = 0
B = 0
ans = 0
tmp = [[0,0],[0,0]]
for i in range(2):
    a[i] *= t[i]
    b[i] *= t[i]

if a[0] + a[1] == b[0] + b[1]:
    print('infinity')
    exit(0)
elif a[0] > b[0] and a[1] > b[1]:
    print(0)
    exit(0)
elif a[0] < b[0] and a[1] < b[1]:
    print(0)
    exit(0)


for i in range(2):
    for j in range(2):
        A += a[j]
        B += b[j]
        tmp[i][j] = abs(A-B)
#print(tmp)
if tmp[0][0] - tmp[1][0] < 0:
    if not tmp[0][1] % (tmp[0][1] - tmp[1][1]):
        ans += 1
    tmp[0][1] //= tmp[0][1] - tmp[1][1]
    ans = '11145147'
else:
    if not tmp[0][0] % (tmp[0][0] - tmp[1][0]):
        ans -= 1

    tmp[0][0] //= tmp[0][0] - tmp[1][0]
    ans += tmp[0][0] * 2 +1


print(max(ans,1))
Problem p02885 (python)

Fixed submission:
a,b = map(int,input().split())
print(max(0,a-b*2))

Buggy submission (verdict: Runtime Error):
n = int(input())
l = list(map(int,input().split()))
l.sort()
#s = input()
ans = 0
for i in range(n-2):
  for j in range(i+1,n-1):
    tmp = l[i] + l[j]
    for k in range(j+1,n):
      #print(i,j,k)
      if tmp > l[k]:
        ans += 1
      else:
        break

print(ans)
Problem p02953 (python)

Fixed submission:
b=int(input())
a = [int(i) for i in input().split()]
a.insert(0,0)
for i in range(1,b+1):
  if a[i-1] == a[i]:
    continue
  else:
    a[i] -= 1

for i in range(b):
  if a[i] > a[i+1]:
    print('No')
    exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
b=int(input())
a = [int(i) for i in input().split()]
a.insert(0,0)
c=0
for i in range(b):
  if a[i] > a[i+1]:
    a[i] -= 1
  elif a[i] == a[i+1]:
    for j in range(b):
      if a[i+j] > a[i+j+1]:
        for k in range(j+1):
          a[i+k] -= 1
        break
      elif a[i+j] == a[i+j+1]:
        continue
      else:
        break
    else:
      break
    break

for i in range(b):
  if a[i] > a[i+1]:
    print('No')
    exit()
print('Yes')
Problem p02957 (python)

Fixed submission:
A, B = map(int, input().split())
if A == 0 or B == 0 or (A + B)%2 ==1:
	print('IMPOSSIBLE')
else:
  print(int((A + B)/2))

Buggy submission (verdict: Runtime Error):
s=input()
mod = 1000000007
 
dp = [[0 for l in range(13)] for m in range(len(s)+1)]
dp[0][0] = 1
for i in range(1,len(s)+1):
  p = 10**(int((i-1)%12))%13
  if s[-i] == '?':
    for j in range(10):
      for k in range(13):
        dp[i][(k+j*p)%13] += dp[i-1][k]
        dp[i][(k+j*p)%13] %mod
  else:
    for k in range(13):
      dp[i][(int(s[-i])*p +k)%13] += dp[i-1][k]
      dp[i][(int(s[-i])*p +k)%13] %mod
 
print(dp[len(s)][5] %mod)

Buggy submission (verdict: Runtime Error):
s=input()
mod = 1000000007
 
dp = [[0 for l in range(13)] for m in range(len(s)+1)]
dp[0][0] = 1
for i in range(1,len(s)+1):
  p = 10**(int((i-1)%12)) %mod
  if s[-i] == '?':
    for j in range(10):
      for k in range(13):
        dp[i][(k+j*p)%13] += dp[i-1][k]
        dp[i][(k+j*p)%13] %mod
  else:
    for k in range(13):
      dp[i][(int(s[-i])*p +k)%13] += dp[i-1][k]
      dp[i][(int(s[-i])*p +k)%13] %mod
 
print(dp[len(s)][5] %mod)

Buggy submission (verdict: Runtime Error):
N = int(input()) 
s = list(map(int, input().split()))
A = 0
for i in range (N):
  if s[i] == i:
    continue
  else:
    A+=1
if A <= 2 or:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
A, B = map(int, input().split())
if A == 0 or B == 0 or (A + B)%2 ==1:
	print(IMPOSSIBLE)
else:
  print(int((A + B)/2))
Problem p02958 (python)

Fixed submission:
N = int(input()) 
s = list(map(int, input().split()))
A = 0
for i in range (N):
  if s[i] != i+1:
    A+=1
if A <= 2 :
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
N = int(input()) 
s = list(map(int, input().split()))
A = 0
for i in range (N - 1):
  if s[i] == i:
    continue
  else:
    A+=1
if A <= 2 or:
  print('YES')
else:
  print('NO')
Problem p03037 (python)

Fixed submission:
n,m = map(int,input().split())
ans = [-1,10**6]

for i in range(m):
    tmp = list(map(int,input().split()))
    ans[0] = max(ans[0],min(tmp))
    ans[1] = min(ans[1],max(tmp))

print(max(ans[1]-ans[0]+1,0))

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
ans = [-1,10**6]

for i in range(m):
    tmp = list(map(int,input().split()))
    ans[0] = max(ans[0],min(tmp))
    ans[1] = min(ans[1],max(tmp))

print(max(ans[1]-ans[0]+1),0)
Problem p03644 (python)

Fixed submission:
n = int(input())
ans = 1
for i in range(1,n):
    if 2 ** i > n:
        break
    else:
        ans = 2 ** i
print(ans)

Buggy submission (verdict: Runtime Error):
n = str(input())
ans = 1
for i in range(1,n):
    if i ** 2 > n:
        break
    else:
        ans = i ** 2
print(ans)
Problem p03844 (python)

Fixed submission:
s = list(map(str,input().split()))
if s[1] == '+':
    print(int(s[0]) + int(s[2]))
else:
    print(int(s[0]) - int(s[2]))

Buggy submission (verdict: Runtime Error):
s = list(map(str,input().split()))
if s[1] == '+'
    print(int(s[0]) + int(s[2]))
else:
    print(int(s[0]) - int(s[2]))
Problem p02705 (python)

Fixed submission:
R = int(input())
v = 2*R*3.14
print(v)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
A = list(map(int, input().split))
a = sum(A)
ans = N -a
if ans >= 0:
    print(ans)
else:
    print(-1)
Problem p02706 (python)

Fixed submission:
N,M = map(int, input().split())
A = list(map(int, input().split()))
a = sum(A)
ans = N -a
if ans >= 0:
    print(ans)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().sprit())
A = list(map(int, input().split()))
a = sum(A)
ans = N -a
if ans >= 0:
    print(ans)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N,M = map(int, input().sprit())
A = list(map(int, input().split()))
a = sum(A)
ans = N -a
if ans >= 0:
    print(ans)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
A = list(map(int, input().split()))
a = sum(A)
ans = N -a
if ans >= 0:
    print(ans)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
A = list(map(int, input().split()))
a = sum(A)
ans = N -a
if ans >= 0:
    print(ans)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
A = list(map(int(input().split)))
a = sum(A)
ans = N -a
if  ans >= 0:
    print(ans)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
A = list(map(int(input().split)))
a = sum(A)
if N - a >= 0:
    print(N-a)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
A = list(map(int(input().split)))
a = sum(A)
if V >= 0:
    print(a)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
b = -1
while M != 0:
    M = M -1
    A = int(input())
    V = N - A

if V >= 0:
    print(V)
else:
    print(b)
Problem p02778 (python)

Fixed submission:
s=input()
i=0
o="x"*len(s)
print(o)

Buggy submission (verdict: Runtime Error):
import java.util.*;
import java.io.*;
public class main {
	public static void main (String[] args) {
		Scanner input = new Scanner(System.in);
		String w = input.next();
		int i;
		int n=w.length();
		for(i=0 ;i<n ;i++) {
			System.out.print("x");
		}		
	}

}
Problem p02640 (python)

Fixed submission:
X, Y = map(int, input().split())

ans = 'No'
for a in range(X + 1):
	b = X - a
	if 2 * a + 4 * b == Y:
		ans = 'Yes'
        
print(ans)

Buggy submission (verdict: Runtime Error):
input_line = input().split()

for i in range(input_line[1]):
  print(input_line[0])
Problem p02639 (python)

Fixed submission:
x = list(map(lambda x: int(x), input().split(' ')))

for i in range(1, 6):
    if i != x[i-1]:
        print(i)
        exit(0)

Buggy submission (verdict: Runtime Error):
x = map(lambda x: int(x), input().split(' '))

for i in range(1, 6):
    if i != x[i-1]:
        print(i)
        exit(0)
Problem p02657 (python)

Fixed submission:
a = input().split()
print(int(a[0]) * int(a[1]))

Buggy submission (verdict: Runtime Error):
a = int(input()).split()
print(a[0] * a[1])

Buggy submission (verdict: Runtime Error):
a = input().split()
print(a[0] * a[1])
Problem p02640 (python)

Fixed submission:
x,y=map(int,input().split())
r=4*x
if r>=y and y>=2*x and (r-y)%2==0:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
x,y=map(int,input().split())
r=4*x
if r>=y y>=2*x and (r-y)%2==0:
  print('Yes')
else:
  print('No')
Problem p02641 (python)

Fixed submission:
x,n=map(int,input().split())
r=[i-x for i in map(int,input().split())]
for i in range(n+1):
  if not -(i) in r:
    print(x-i)
    break
  elif not i in r:
    print(x+i)
    break

Buggy submission (verdict: Runtime Error):
x,n=map(int,input().split())
r=[i-x for i in map(int,input())]
for i in range(100):
  if not -(i+1) in r:
    print(x-i-1)
    break
  elif not i+1 in r:
    print(x+i+1)
    break

Buggy submission (verdict: Runtime Error):
x,n=map(int,input().split())
r=[i-x for i in map(int,input())]
for i in range(100):
  if not -(i+1) in r:
    print(x-i)
  elif not (i+1) in r:
    print(x+i)

Buggy submission (verdict: Runtime Error):
x,n=map(int,input().split())
r=[i-x for i in map(int,input())]
for i in range(100):
  if not -i in r:
    print(x-i)
  elif not i in r:
    print(x+i)

Buggy submission (verdict: Runtime Error):
x,n=map(int,input().split())
r=[i-x for i in map(int,input())]
i=1
while True:
  if not -i in r:
    print(x-i)
    break
  elif not i in r:
    print(x+i)
  else:
    i+=1
Problem p02921 (python)

Fixed submission:
S=input()
T=input()
an=0
for i in range(3):
    if S[i]==T[i]:
        an+=1
print(an)

Buggy submission (verdict: Runtime Error):
N=int(input())

a=[]
for i in range(N):
    a.append([m-1 for m in map(int,input().split())])

b=[]
for i in range(N):
    b.append(a[i].pop(0))

an=0

while True:
    note=[]
    x=0
    for i in range(N):
        if b[i]!=N and b[b[i]]==i:
            x=1
            note.append(i)
    for i in note:
        try:
            b[i]=a[i].pop(0)
        except:
            b[i]=N
    if x==1:
        an+=1
    elif b==[N for i in range(N)]:
        print(an)
        break
    else:
        print(-1)
        break
Problem p04043 (python)

Fixed submission:
x=[i for i in map(int,input().split())]
if x.count(5)==2 and x.count(7):
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
x=map(int,input().split())
if x.count(7)==1 and x.count(5)==2:
  print('YES')
else:
  print('NO')
Problem p02639 (python)

Fixed submission:
num = list(map(int, input().split()))
print(num.index(0)+1)

Buggy submission (verdict: Runtime Error):
x = []
z = 1
while z != 6:
	print("Enter number"+z,":")
	x.append(input())
	z+=1
y = 0
for i in x:
	if x[y] == "0":
		print(y+1)
	else:
		print("1")
	y +=1

Buggy submission (verdict: Runtime Error):
z = 1
x = []
while z != 5:
  x.append[input()]
  z+=
y = 0
while y!= 5:
  if x[y] == 0:
    print(y+1)
  else:
    y+=1
    continue