Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
C11,C12,C13 = map(int, input().split())
C21,C22,C23 = map(int, input().split())
C31,C32,C33 = map(int, input().split())

print(C11+C22+C33)


Fixed submission:
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])
Buggy python submission (verdict: Runtime Error):
import sys 
c11, c12, c13 = map(int, input().split())
c21, c22, c23 = map(int, input().split())
c31, c32, c33 = map(int, input().split())

N = 101

for i in range(N):
    a1 = i

    b1 = c11 - a1
    b2 = c12 - a1
    b3 = c13 - a1

    a2 = c21 - b1
    a3 = c31 - b1

    if c22 == a2+b2 and c23 == a2 + b3 and c33 == a3+b3:
        print("Yes")
        sys.exit()

print("No")

Fixed submission:
N = int(input())
A = int(input())

#枚数
number=(N//500)

#端数を弾く
Rest = (N-(number*500))

if Rest <= A:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys 
N = int(input())

t = []
cordinate = []

#　リストtに時間の情報、二次元配列のcordinateにx,y座標を入れる
for i in range(N):
    time,x,y = map(int, input().split())
    t.append(time)
    cordinate.append([x,y])

# 初期の時間と初期座標
time = 0
x,y = 0,0


for i in range(len(t)):
    
    # 移動先への移動にかけて良い時間
    time = abs(time - t[i])
    
    #移動先のx,y座標
    objx = cordinate[i][0]
    objy = cordinate[i][1]
    

    
    #移動できる時間より距離が長い場合はアウト
    if time < abs((objx - x) + (objy - y)):
        print("No")
        sys.exit()
    
    #偶奇の判定
    if (abs((objx - x) + (objy - y)))%2 != time % 2:
        print("No")
        sys.exit()

    x,y = objx,objy
    time = t[i]

print("Yes")

Fixed submission:
a,b = map(int, input().split())

a_b = ((a*b)%2)

if a_b == 0:
    print("Even")
else:
    print("Odd")

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

t = []
cordinate = []

#　リストtに時間の情報、二次元配列のcordinateにx,y座標を入れる
for i in range(N):
    time,x,y = map(int, input().split())
    t.append(time)
    cordinate.append([x,y])

# 初期の時間と初期座標
time = 0
x,y = 0,0


for i in range(len(t)):
    
    # 移動先への移動にかけて良い時間
    time = abs(time - t[i])
    
    #移動先のx,y座標
    objx = cordinate[i][0]
    objy = cordinate[i][1]
    

    
    #移動できる時間より距離が長い場合はアウト
    if time < abs((objx - x) + (objy - y)):
        print("No")
        sys.exit()
    
    #偶奇の判定
    if (abs((objx - x) + (objy - y)))%2 != time % 2:
        print("No")
        sys.exit()

    x,y = objx,objy

print("Yes")

Fixed submission:
a,b = map(int, input().split())

a_b = ((a*b)%2)

if a_b == 0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
N = int(input())
x = [0] * N
u = [0] * N
for i in range(N):
    x[i],u[i] = map(int, input().split())







ans = []

btc_1 = 380000.0

for i  in range(N):
    if u[i] == "JPY":
        ans.append(x[i])
    else:
        yen = ((x[i])*(btc_1))
        ans.append(yen)

print(sum(ans))


Fixed submission:
a,b = map(str, input().split())

abint = int(a+b)

ans = 0

for i in range(1,1001):
    for j in range(1,1001):
        if i*j == abint and i == j:
            ans = ans + 1

if ans == 0:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
S = input()

S2 = S.replace(7,8,1)

print(S2)

Fixed submission:
s=input()
print("2018"+s[4:])
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())

S =  input()


if  S[A] == "-" and S.count("-") == 1:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Fixed submission:
M = int(input())

print(48-M)
Buggy python submission (verdict: Runtime Error):
A,B = map(str, input().split())

S =  input()


if S.count("-") == 1 and S[A] == "-":
    ans = "Yes"
else:
    ans = "No"

print(ans)


Fixed submission:
A,B = map(int, input().split())

S =  input()


if  S[A] == "-" and S.count("-") == 1:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Buggy python submission (verdict: Runtime Error):
A,B = map(str, input().split())
S =  input()

ans = 0

if S.count("-") == 1 and S[A] == "-":
    ans = ans + 1

if ans == 0:
    print("No")
else:
    print("Yes")


Fixed submission:
A,B = map(int, input().split())

S =  input()


if  S[A] == "-" and S.count("-") == 1:
    ans = "Yes"
else:
    ans = "No"

print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
s1 = sorted(s)
s2 = input()


ans = 0
ans2 = 0



for i in s2:
    if s == s2:
        break
    if s1[0] <= i:
        ans = ans + 1
        for k in range(0,len(s1)):
            if s1[k] <= i:
                ans2 = ans2 + 1
    
if ans != 0 and ans2 != 0:
    print("Yes")
else:
    print("No")


Fixed submission:
a,b= map(int, input().split())

adivb =((a+b)//2) 
addition = ((a+b)%2)

print((adivb)+(addition))
Buggy python submission (verdict: Runtime Error):
b

Fixed submission:
scara = input()
s= sorted(scara)
tcar = input()
t= sorted(tcar, reverse=True)

for i, j in zip(s, t):
  if i < j:
    print("Yes")
    break
  elif i > j:
    print("No")
    break
else:
        if len(s) < len(t):

            print("Yes")
        else:

            print("No")
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int, input().split())

NxA = (N*A)

if NxA =< B:
    print(NxA)
else:
    print(B)


Fixed submission:
N,A,B = map(int, input().split())

N_A = (N*A)

if N_A <= B:
    print(N_A)
else:      
    print(B)

Buggy python submission (verdict: Runtime Error):
N,A,B = map(int, input().split())

NxA = (N*B)

if NxA =< B:
    print(NxA)
else:
    print(B)


Fixed submission:
N,A,B = map(int, input().split())

N_A = (N*A)

if N_A <= B:
    print(N_A)
else:      
    print(B)
Buggy python submission (verdict: Runtime Error):
s = input()
c = Counter(s)
v = list(c.values())
if max(v) - min(v) > 1: 
  print("NO")
else:
  print("YES")

Fixed submission:
s = input()
a = [s.count("a"), s.count("b"), s.count("c")]
a.sort(reverse=True)
if a[0] <= a[2] + 1:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
if (S[0] == S[1] == S[2]) or (S[1] == S[2] == S[3]) or (S[0] == S[1] == S[2] == S[3] == S[4]):
    print("Yes")
else:
    print("No")

Fixed submission:
S = input()

if (S[0] == S[1] == S[2]) or (S[1] == S[2] == S[3]):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sympy as sym
N = 5
A = [sym.lucas(x) for x in range(N)]
print(A[N])

Fixed submission:
N = int(input())

L = [2, 1]
for i in range(2, N+1):
    L.append(L[i-1] + L[i-2])
    
print(L[N])
Buggy python submission (verdict: Runtime Error):
X,Y = map(str, input().split())

"A" = 1
"B" = 2
"C" = 3
"D" = 4
"E" = 5
"F" = 6

if X > Y:
    print(">")
elif X < Y:
    print("<")
else:
    print("=")

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

A,B,C,D,E,F = 10,11,12,13,14,15

if X > Y:
    print(">")
elif X < Y:
    print("<")
else:
    print("=")
Buggy python submission (verdict: Runtime Error):
A = list(map(str, input().split()))
B = list(map(str, input().split()))

REA = (A[0] + A[1] + A[2])
REB = (A[2] + A[1] +A[0])

if REA == REB:
    print("YES")
else:
    print("NO")

Fixed submission:
A = input()
B = input()

REA = (A[0] + A[1] + A[2])
REB = (B[2] + B[1] +B[0])

if REA == REB:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
A = [input() for _ in range(N)]
B = [input() for _ in range(N)]

REA = (A[0] + A[1] + A[2])
REB = (A[2] + A[1] +A[0])

if REA == REB:
    print("YES")
else:
    print("NO")

Fixed submission:
A = input()
B = input()

REA = (A[0] + A[1] + A[2])
REB = (B[2] + B[1] +B[0])

if REA == REB:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
C11,C12,C13 = map(str, input().split())

C21,C22,C23= map(str, input().split())

hoge = (C13 + C12 + C11)
hoge2 =(C21 + C22 + C23)

if hoge == hpge2:
    print("YES")
else:
    print("NO")

Fixed submission:
A = input()
B = input()

REA = (A[0] + A[1] + A[2])
REB = (B[2] + B[1] +B[0])

if REA == REB:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
N = int(input())

ans1 = []
ans2 = []

for i in range(1,N):
    for j in  range(1,N):
        if i == j and i*j == N:
            ans1.append(i*j)
        elif i == j and i*j <= N:
            ans2.append(i*j) 
            

if ans1 != 0:
    print(max(ans1))
else:
    print(max(ans2))


Fixed submission:
n = int(input())
x = 1
while x * x <= n:
    x += 1

x -= 1
print(x * x)

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

ans1 = []
ans2 = []

for i in range(1,N):
    for j in  range(1,N):
        if i == j and i*j == N:
            ans1.append(i*j)
        elif i == j and i*j <= N:
            ans2.append(i*j) 
            

if ans1 != 0:
    print(max(ans1))
else:
    print(max(ans2))

Fixed submission:
n = int(input())
x = 1
while x * x <= n:
    x += 1

x -= 1
print(x * x)
Buggy python submission (verdict: Runtime Error):
R,G = map(int, input().split())

X = ((2*G)-R)

print(X)

Fixed submission:
R = int(input())
G = int(input())

X = ((2*G)-R)

print(X)
Buggy python submission (verdict: Runtime Error):
ああ

Fixed submission:
S = input()

if S[0] == "9" or S[1] == "9":
    print("Yes") 
elif S[0] ==9 and S[1] == "9":
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys
N = int(input())
A = []
for _ in range(N):
    A.append(int(input())) 

checklis = [0]*max(A)

for i in A:
    lisnumber = i-1
    if checklis[lisnumber] == 0:
        checklis[lisnumber] = 1
    elif checklis[lisnumber] == 1:
        checklis[lisnumber] = 0

print(sum(checklis))

Fixed submission:
import sys
N = int(input())
A = []
for _ in range(N):
    A.append(int(input())) 

# 0の時と、全部が同じ数の時の場合分け。

if N == 1:
    print(1)
    sys.exit()

if set(A) == 1:
    print(0)
    sys.exit()

A = sorted(A)


count = 1
ans = 0
firstnum = A[0] 
for i in range(1,N):
    if firstnum == A[i]:
        count = count + 1
    else:
        if count % 2 == 0:
            count = 1
        else:
            ans = ans + 1
            count = 1

    firstnum = A[i]  

if count%2 == 0:
  ans = ans +0
else:
  ans = ans + 1
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()

hoge = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']

hoge2 = list(S)

differlen = len((set(hoge) ^ set(hoge2)))

differ2 = set(hoge) ^ set(hoge3)
differ3 = sorted(differ2)




if differlen == 0:
    print("None")
else:
    print(differ3[0])

Fixed submission:
S = input()

hoge = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']

hoge2 = list(S)

differlen = len((set(hoge) ^ set(hoge2)))

differ2 = set(hoge) ^ set(hoge2)
differ3 = sorted(differ2)




if differlen == 0:
    print("None")
else:
    print(differ3[0])
Buggy python submission (verdict: Runtime Error):
N = int(input())

ans = 1
for i in range(8):
  if(n >= 2 ** i):
    ans = 2 ** i
print(ans)

Fixed submission:
n = int(input())
ans = 1
for i in range(8):
  if(n >= 2 ** i):
    ans = 2 ** i
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())

travellist = []
for _ in range(M):
    a, b = map(int, input().split())
    travellist.append([a,b])

travellist = sorted(travellist)


To_list = []
for i in range(M):

    oneroot = travellist[i]
    From = oneroot[0]
    To   = oneroot[1]

    if From == 1:
        To_list.append(To)

    if To == N and From in To_list:
        print("POSSIBLE")
        exit()

print("IMPOSSIBLE") 
        

      

Fixed submission:
N, M = map(int, input().split())

travellist = []
for _ in range(M):
    a, b = map(int, input().split())
    travellist.append([a,b])

travellist = sorted(travellist)


To_list = [0]*N
From_list = []
for i in range(M):

    oneroot = travellist[i]
    From = oneroot[0]
    To   = oneroot[1]

    if From == 1:
        To_list[To] = 1

    if To == N:
        From_list.append(From)


for i in From_list:
    if To_list[i] == 1:
        print("POSSIBLE")
        exit()

print("IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())

list_A = []
list_B = []
for _ in range(M):
    a, b = map(int, input().split())
    list_A.append(a)
    list_B.append(b)


visitlist = []  
for i in range(M):
    if list_B[i] == N:
        visitlist.append(list_A[i])

for j in range(M):
    if list_A[j] == 1 and list_B[j] in visitlist:
        print("POSSIBLE")
        exit()

print("IMPOSSIBLE")

Fixed submission:
N, M = map(int, input().split())

travellist = []
for _ in range(M):
    a, b = map(int, input().split())
    travellist.append([a,b])

travellist = sorted(travellist)


To_list = [0]*N
From_list = []
for i in range(M):

    oneroot = travellist[i]
    From = oneroot[0]
    To   = oneroot[1]

    if From == 1:
        To_list[To] = 1

    if To == N:
        From_list.append(From)


for i in From_list:
    if To_list[i] == 1:
        print("POSSIBLE")
        exit()

print("IMPOSSIBLE")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

cum_sum = 0
ans_lis = []

for i in range(0,N-1):
    cum_sum = cum_sum + A[i]
    score = abs(cum_sum - (sum(A)-cum_sum))

    ans_lis.append(score)

print(min(ans_lis))
    

Fixed submission:
N = int(input())
A = list(map(int, input().split()))

cum_sum = 0
ans_lis = []
sumA = sum(A)
for i in range(0,N-1):
    cum_sum = cum_sum + A[i]
    score = abs(cum_sum - (sumA - cum_sum))

    ans_lis.append(score)

print(min(ans_lis))
Buggy python submission (verdict: Runtime Error):
import sys 

N = int(input())
A = list(map(int, input().split()))


if N == 1:
    print(A[0])
    sys.exit()

mae = []
usiro = []

#0の時に前 1の時に後ろ
Flag = 0

for i in reversed(range(0,N,1)):
    
    if Flag == 0: # 前の時
        mae.append(str(A[i]))
        mae.append(" ")
        Flag = 1
    else:
        usiro.insert(0,str(A[i]))
        #usiro.insert(0,str(" "))
        Flag = 0

moziretu = (mae + usiro)
#del moziretu[((len(moziretu))//2)]
moziretu = ''.join(moziretu)
print(moziretu)
  
  




Fixed submission:
a,b,c = map(int, input().split())

a_b = a+b
a_c = a+c
b_c = b+c

print(min(a_b,a_c,b_c))
Buggy python submission (verdict: Runtime Error):
あ

Fixed submission:
N = int(input())
a = list()
for i in range(N):
	a.append(int(input()))

temp = 1
count = 0
while temp != 2 and count <= 100001:
	temp = a[temp - 1]
	count += 1

if count > 100000:
	print(-1)
else:
	print(count)
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())

A_B = (A+B)

if A_B < 10:
    print(A_B)
elif A_B > 10:
    print("error")
elif A_B = 10:
    print("error")


Fixed submission:
A,B = map(int, input().split())

A_B = (A+B)

if A_B >= 10:
    print("error")
else:
    print(A_B)
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
a = [4,6,9,11]
b = [1,3,5,7,8,10,12]

if x in a and y in a:
    print("Yes")
elif x in b and y in b:
    print("Yes")
elif x == y == 2:
    print("Yes"
else:
    print("No")



Fixed submission:
x,y = map(int,input().split())

a = [4,6,9,11]
b = [1,3,5,7,8,10,12]

if x in a and y in a:
    print("Yes")
elif x in b and y in b:
    print("Yes")
elif x == y == 2:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
A,B,C = map(int, input().split())

if C >= A and C <= B:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
b

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

import sys
import os
import math

N, M = map(int, input().split())

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

    A[a] += 1
    A[b] += 1

for i in range(N):
    print(A[i])
Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
A,B,C = map(int, input().split())

ans = 0

for i in range(1,B+1):
    number = ((A*i) % B )
    if number == C:
        ans = ans + 1

if ans != 0:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
O = input()
O_2 = list(O)
OLEN = len(O)

E = input()
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])


for i in ans:
  print(i,end="")

Fixed submission:
a,b,c = map(int, input().split())

b_a = (b-a)
c_b = (c-b)

if b_a == c_b:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
O = input()
O_2 = list(O)
OLEN = len(O)

E = input()
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])


print(ans)

Fixed submission:
a,b,c = map(int, input().split())

b_a = (b-a)
c_b = (c-b)

if b_a == c_b:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())

if A < B:
    print(A+B)
elif A == 0 and B == 0:
    print(0)
elif A != 0 and B==0:
    print(0)
elif A > B:
    print((A+B-24)

Fixed submission:
a, b = map(int, input().split())
if a+b >= 24:
    print(a+b-24)
else:
    print(a+b)
Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
N, M = map(int, input().split())

studentlis = []
for _ in range(N):
    a, b = map(int, input().split())
    studentlis.append([a,b])

checkpointlis = []
for _ in range(M):
    c, d = map(int, input().split())
    checkpointlis.append([c,d])

ans_lis = []


for i in range(len(studentlis)):
    ans = int(10**100)

    tmpstudentlis = studentlis[i]

    x1 = tmpstudentlis[0]
    y1 = tmpstudentlis[1]
    
    for j in range(len(checkpointlis)):
        tmpcheckpointlis = checkpointlis[j]

        x2 = tmpcheckpointlis[0]
        y2 = tmpcheckpointlis[1]
        
        distance = (abs(x1-x2) + abs(y1-y2))

        if distance < ans:
            ans = distance
            num = j

        if j == len(checkpointlis)-1:
            ans_lis.append(num+1)


for i in ans_lis:
    print(i)
Buggy python submission (verdict: Runtime Error):
from  math import factorial
N = int(input())
N2=math.factorial(N)

print((N2)%(10 ** 9 + 7))

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = 800 * N

TIMES = (N // 15) * 200

print(All - TIMES)

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = 800 * N

TIMES = (N // 15) * 200

print(All - TIMES)

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = 800 * N
TIMES = (N // 15)*200

print(All - TIMES)

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = 800 * N
TIMES = N //15

print(All - (200*TIMES))

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = N*800
TIMES = N //15

print(All - (200*TIMES))

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = N*800
TIMES = N //15


if N < 15:
    print(ALL)
else:
    print(All - (200*TIMES))

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

ALL = N*800
TIMES = N //15


if N < 15:
    print(ALL)
else:
    print(All - (800*TIMES))

Fixed submission:
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)
Buggy python submission (verdict: Runtime Error):
from  math import factorial
N = int(input())
N2=math.factorial(N)

print((N2)%(10 ** 9 + 7))

Fixed submission:
import math
N = int(input())
N2=math.factorial(N)

print((N2)%(10 ** 9 + 7))

Buggy python submission (verdict: Runtime Error):
N = int(input())
N2=math.factorial(N)

print(N2%1000000007)

Fixed submission:
import math
N = int(input())
N2=math.factorial(N)

print((N2)%(10 ** 9 + 7))

Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
import math
N = int(input())
N2=math.factorial(N)

print((N2)%(10 ** 9 + 7))
Buggy python submission (verdict: Runtime Error):
K,S= map(int, input().split())

number_lis = []
ans = 0

for i in range(0,K+1):
    number_lis.append(i)

for j in number_lis:
    for k in number_lis:
        for l in number_lis:
            if 0<= (S　-j -k) <=K:
                ans = ans + 1
                
print(ans)

Fixed submission:
K, S = map(int, input().split())
ans = 0
for x in range(min(K,S)+1):
	for y in range(min(K,S)+1):
		if 0 <= S - x - y <= K:
			ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
K,S= map(int, input().split())

number_lis = []
ans = 0

for i in range(0,K+1):
    number_lis.append(i)

for j in number_lis:
    for k in number_lis:
        for l in number_lis:
            if (j + k + l) == S:
                ans = ans + 1
                
print(ans)

Fixed submission:
K, S = map(int, input().split())
ans = 0
for x in range(min(K,S)+1):
	for y in range(min(K,S)+1):
		if 0 <= S - x - y <= K:
			ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
K,S = [int(i) for i in input().split()]


ans = 0

for x in range(K+1):
    for y in range(K+1):
        if 0 <= S-x-y <=k:
            ans = ans + 1
print(ans)

Fixed submission:
K, S = map(int, input().split())
ans = 0
for x in range(min(K,S)+1):
	for y in range(min(K,S)+1):
		if 0 <= S - x - y <= K:
			ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
K, S = map(int, input().split())


ans = 0

for x in range(K+1):
    for y in range(K+1):
        if 0 <= S-x-y <=k:
            ans = ans + 1
print(ans)


Fixed submission:
K, S = map(int, input().split())
ans = 0
for x in range(min(K,S)+1):
	for y in range(min(K,S)+1):
		if 0 <= S - x - y <= K:
			ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
K, S = map(int, input().split())

ans = 0

for x in range(K+1):
    for y in range(K+1):
        for z in range(K+1):
            if x + y + z == S:
                ans = ans + 1 

print(ans)

Fixed submission:
K, S = map(int, input().split())
ans = 0
for x in range(min(K,S)+1):
	for y in range(min(K,S)+1):
		if 0 <= S - x - y <= K:
			ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
T = list(map(int, input().split())) 

M = int(input())        


ans = T
number = []
for _ in range(M):
    P, X = map(int, input().split())
    ans[P] = X
    number.append(sum(ans))
    ans = T

for i in number:
    print(i)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
M = int(input())
total = sum(A)
ans = []
for _ in range(M):
  p, x = map(int, input().split())
  ans.append(total+x - A[p-1])
for a in ans:
  print(a)

Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
M = int(input())
total = sum(A)
ans = []
for _ in range(M):
  p, x = map(int, input().split())
  ans.append(total+x - A[p-1])
for a in ans:
  print(a)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x = map(int, input().split())

ans = 0

for i in range(a,b+1):
    if i % x == 0:
        ans = ans + 1

print(ans)

Fixed submission:
a,b,x=map(int,input().split())
b_count=b//x
a_count=(a-1)//x
print(b_count-a_count)