Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
def cf(x1,x2):
    cf=[]
    for i in range(2,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

l = cf(a,b)

print(l[-k])

Fixed submission:
import sys
a,b,k = map(int,input().split())
c = 0
if a > b:    
    for i in range(b,0,-1):
        if (b%i == 0) and (a%i == 0):
            c += 1
            if c == k:
                print(i)
                sys.exit()
else:
    for i in range(a,0,-1):
        if (b%i == 0) and (a%i == 0):
            c += 1
            if c == k:
                print(i)
                sys.exit()
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
h = [int(input()) for _ in range(n)]
h.sort()
m = 10**10
for i in range(n-k+1):
    a = max(h[i:i+k])
    b = min(h[i:i+k])
    if a - b < m:
        m = a - b

print(m)

Fixed submission:
n,k = map(int,input().split())
h = [int(input()) for _ in range(n)]
h.sort()
m = 10**10
for i in range(n-k+1):
    b = h[i]
    a = h[i+k-1]
    if a - b < m:
        m = a - b

print(m)

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
h = [int(input()) for _ in range(n)]
h.sort()
m = 10**10
for i in range(n-k+1):
    a = max(h[i:i+k])
    b = min(h[i:i+k])
    if a - b < m:
        m = a - b

print(m)

Fixed submission:
n,k = map(int,input().split())
h = [int(input()) for _ in range(n)]
h.sort()
m = 10**10
for i in range(n-k+1):
    b = h[i]
    a = h[i+k-1]
    if a - b < m:
        m = a - b

print(m)
Buggy python submission (verdict: Runtime Error):
x = int(input())
a = input()
b = input()

if x == 1:
    print("Hello World")
else:
    print(int(a)+int(b))

Fixed submission:
n = int(input())

if n == 1:
    print("Hello World")
else:
    print(int(input())+int(input()))
Buggy python submission (verdict: Runtime Error):
r = map(int,input().split())
if r <= 1999:
    print("ABC")
elif r <= 2799:
    print("ARC")
else:
    print("AGC")

Fixed submission:
r = int(input())
if r <= 1199:
    print("ABC")
elif r <= 2799:
    print("ARC")
else:
    print("AGC")
Buggy python submission (verdict: Runtime Error):
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(n):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(l-1)
                    break
    print(score)

Fixed submission:
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l:
        score = sum(n)
    elif n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(l):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(l-1)
                    break
    print(score)

Buggy python submission (verdict: Runtime Error):
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(n):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(n-1)
                    break
    print(score)

Fixed submission:
n = list(input())
l = len(n)

for i in range(l):
    n[i] = int(n[i])

score = 0

if l == 1:
    print(n[0])
else:
    if n.count(9) == l:
        score = sum(n)
    elif n.count(9) == l-1:
        if n[0] != 9:
            score += sum(n)
        else:
            score += 8 + 9*(l-1)
    else:
        if n[0] != 9:
            score += n[0]-1 + 9*(l-1)
        else:
            for j in range(l):
                if n[j] != 9:
                    n[j-1] = 8
                    score += 8 + 9*(l-1)
                    break
    print(score)
Buggy python submission (verdict: Time Limit Exceeded):
import collections

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

ac = collections.Counter(a)
ans = 0

for i in range(a[0],a[-1]+1):
    if ac[i] < i:
        ans += ac[i]
    else:
        ans += ac[i] - i

print(ans)

Fixed submission:
import collections

n = int(input())
a = list(map(int,input().split()))
a.sort()
s = set(a)

ac = collections.Counter(a)
ans = 0

for i in s:
    if ac[i] < i:
        ans += ac[i]
    else:
        ans += ac[i] - i

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import collections

n = int(input())
a = list(map(int,input().split()))
ma = max(a)
mi = min(a)

ac = collections.Counter(a)
ans = 0

for i in range(mi,ma+1):
    if ac[i] < i:
        ans += ac[i]
    else:
        ans += ac[i] - i

print(ans)

Fixed submission:
import collections

n = int(input())
a = list(map(int,input().split()))
a.sort()
s = set(a)

ac = collections.Counter(a)
ans = 0

for i in s:
    if ac[i] < i:
        ans += ac[i]
    else:
        ans += ac[i] - i

print(ans)
Buggy python submission (verdict: Runtime Error):
s = list(input())

if s.index("C") < s.index("F"):
    print("Yes")
else:
    print("No")

Fixed submission:
s = list(input())

sc = -1
sf = -1

for i in range(len(s)):
    if s[i] == "C":
        sc = i
    elif s[i] == "F":
        sf = i

if (sc == -1) or (sf == -1):
    print("No")
elif sc < sf:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))

c = 0
for i in range(n-1):
    for j in range(i+1,n):
        if (a[i] == j+1) and (a[j] == i+1):
            c += 1

print(c)

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

c = 0

for i in range(n):
    if a[a[i]-1] == i+1:
        c += 1

print(c//2)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque

H, W = [int(x) for x in input().split()]
cell = [list(input()) for i in range(H)]

painted = deque()
for h in range(H):
    for w in range(W):
        if cell[h][w] == '#':
            painted.append([h, w, 0])

ans = 0
while len(painted) > 0:
    blackcell = painted.popleft()
    for dy, dx in [[1, 0], [0, 1], [-1, 0], [0, -1]]:
        nh = blackcell[0] + dy
        nw = blackcell[1] + dx
        d = blackcell[2]
        if 0 <= nh and nh < H and 0 <= nw and nw < W and cell[nh][nw] == '.':
            cell[nh][nw] = '#'
            painted.append([nh, nw, d + 1])
        ans = d

print(ans)

Fixed submission:
from collections import deque

H, W = [int(x) for x in input().split()]
cell = [list(input()) for i in range(H)]

painted = deque()
for h in range(H):
    for w in range(W):
        if cell[h][w] == '#':
            painted.append([h, w, 0])

ans = 0
while len(painted) > 0:
    blackcell = painted.popleft()
    for dy, dx in [[1, 0], [0, 1], [-1, 0], [0, -1]]:
        nh = blackcell[0] + dy
        nw = blackcell[1] + dx
        d = blackcell[2]
        if 0 <= nh and nh < H and 0 <= nw and nw < W and cell[nh][nw] == '.':
            cell[nh][nw] = '#'
            painted.append([nh, nw, d + 1])
        ans = d

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
H, W = [int(x) for x in input().split()]
cell = [list(input()) for i in range(H)]

painted = []
for h in range(H):
    for w in range(W):
        if cell[h][w] == '#':
            painted.append([h, w])

ans = 0
while len(painted) > 0:
    to_be_painted = []
    for blackcell in painted:
        h = blackcell[0]
        w = blackcell[1]
        for dy, dx in [[1, 0], [0, 1], [-1, 0], [0, -1]]:
            nh = h + dy
            nw = w + dx
            if 0 <= nh and nh < H and 0 <= nw and nw < W and cell[nh][nw] == '.':
                cell[nh][nw] = '#'
                to_be_painted.append([nh, nw])
    painted = to_be_painted
    if len(painted) > 0: ans += 1

print(ans)

Fixed submission:
from collections import deque

H, W = [int(x) for x in input().split()]
cell = [list(input()) for i in range(H)]

painted = deque()
for h in range(H):
    for w in range(W):
        if cell[h][w] == '#':
            painted.append([h, w, 0])

ans = 0
while len(painted) > 0:
    blackcell = painted.popleft()
    for dy, dx in [[1, 0], [0, 1], [-1, 0], [0, -1]]:
        nh = blackcell[0] + dy
        nw = blackcell[1] + dx
        d = blackcell[2]
        if 0 <= nh and nh < H and 0 <= nw and nw < W and cell[nh][nw] == '.':
            cell[nh][nw] = '#'
            painted.append([nh, nw, d + 1])
        ans = d

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
mtch = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6} 

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

dp = [["-" for j in range(N + 1)] for i in range(N//2 + 1)]
dp[0][0] = ""

for i in range(N//2 + 1):
    for j in range(N + 1):
        for a in A:
            if dp[i][j] != "-" and j + mtch[a] <= N:
                added = dp[i][j] + str(a)
                if dp[i + 1][j + mtch[a]] < added:
                    dp[i + 1][j + mtch[a]] = added

for i in range(N//2, -1, -1):
    if dp[i][N] != "-":
        print(dp[i][N])
        break

Fixed submission:
match = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}

N, M = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)

dp = [-1 for i in range(N + 1)]
dp[0] = 0
for i in range(N + 1):
    for a in A:
        if dp[i] >= 0 and i + match[a] <= N:
            dp[i + match[a]] = max(dp[i] + 1, dp[i + match[a]])

ans = ""
while N > 0:
    for a in A:
        if N - match[a] >= 0 and dp[N - match[a]] == dp[N] - 1:
            ans += str(a)
            N -= match[a]
            break

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
mtch = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6} 

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

dp = [["-" for j in range(N + 1)] for i in range(N + 1)]
dp[0][0] = ""

for i in range(N + 1):
    for j in range(N + 1):
        for a in A:
            if dp[i][j] != "-" and j + mtch[a] <= N:
                added = dp[i][j] + str(a)
                if dp[i + 1][j + mtch[a]] < added:
                    dp[i + 1][j + mtch[a]] = added

for i in range(N, -1, -1):
    if dp[i][N] != "-":
        print(dp[i][N])
        break

Fixed submission:
match = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}

N, M = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)

dp = [-1 for i in range(N + 1)]
dp[0] = 0
for i in range(N + 1):
    for a in A:
        if dp[i] >= 0 and i + match[a] <= N:
            dp[i + match[a]] = max(dp[i] + 1, dp[i + match[a]])

ans = ""
while N > 0:
    for a in A:
        if N - match[a] >= 0 and dp[N - match[a]] == dp[N] - 1:
            ans += str(a)
            N -= match[a]
            break

print(ans)
Buggy python submission (verdict: Runtime Error):
import math

N, X = map(int, input().split())
cities = list(map(int, input().split()))
cities.append(X)
cities.sort()
distances = list(map(lambda x: cities[x + 1] - cities[x], range(len(cities) - 1)))
ans = distances[0]
for distance in distances:
    ans = math.gcd(ans, distance)
print(ans)

Fixed submission:
import fractions

N, X = map(int, input().split())
cities = list(map(int, input().split()))
cities.append(X)
cities.sort()
distances = list(map(lambda x: cities[x + 1] - cities[x], range(len(cities) - 1)))
ans = distances[0]
for distance in distances:
    ans = fractions.gcd(ans, distance)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())
center = (A + B) // 2

max_limit = A + K - 1
min_limit = B - K + 1

for i in range(A, center + 1):
    if i <= max_limit:
        print(i)
        
for i in range(center + 1, B + 1):
    if min_limit <= i:
        print(i)

Fixed submission:
A, B, K = map(int, input().split())
center = (A + B) // 2

max_limit = A + K - 1
min_limit = B - K + 1

end_n = center if center <= max_limit else max_limit
for i in range(A, end_n + 1):
    print(i)
        
begin_n = center + 1 if center + 1 >= min_limit else min_limit
for i in range(begin_n, B + 1):
    print(i)
Buggy python submission (verdict: Runtime Error):
colors = { 0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: 0, 6: 0, 7: 0, 8: 0 }

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

for a in A:
    colors[a // 400] += 1

min_clr = 0
for i in range(0, 8):
    if colors[i] > 0:
        min_clr += 1

print("{} {}".format(min_clr, min_clr + colors[8]))

Fixed submission:
colors = [0 for i in range(9)]

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

for a in A:
    color = a // 400 if a < 3600 else 8
    colors[color] += 1

min_color = 0
for i in range(8):
    if colors[i] > 0:
        min_color += 1

if min_color > 0:
    print("{} {}".format(min_color, min_color + colors[8]))
else:
    print("{} {}".format(1, colors[8]))
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(x, K + 1):
        for z in range(y, K + 1):
            if x + y + z == S:
                if x == y and y == z:
                    ans += 1
                elif x == y or y == z or z == x:
                    ans += 3
                else:
                    ans += 6

print(ans)

Fixed submission:
K, S = map(int, input().split())

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

print(ans)

Buggy python submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

int main() {
    int K, S; cin >> K >> S;
    long long ans = 0;
    for (int x = 0; x <= K; ++x) {
        for (int y = 0; y <= K; ++y) {
            for (int z = 0; z <= K; ++z) {
                if (x + y + z == S) ans++;
            }
        }
    }
    cout << ans << endl;
}

Fixed submission:
K, S = map(int, input().split())

ans = 0
for x in range(K + 1):
    for y in range(K + 1):
        z = S - (x + y)
        if 0 <= z and z <= 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 += 1

print(ans)

Fixed submission:
K, S = map(int, input().split())

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

print(ans)
Buggy python submission (verdict: Runtime Error):
N, A = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(lambda n:n-A, x))

X = max(x)
dp = [[0 for i in range(2*X*N + 1)] for j in range(N + 1)]

for i in range(1, N + 1):
    dp[i][y[i - 1] + N*X] += 1
    for j in range(len(dp[0])):
        dp[i][j] += dp[i - 1][j]
        if dp[i - 1][j] > 0:
            dp[i][j + y[i - 1]] += dp[i - 1][j]

print(dp[N][N*X])

Fixed submission:
N, A = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(lambda n:n-A, x))

X = max(x)
dp = [[0 for i in range(2*X*N + 1)] for j in range(N + 1)]

for i in range(1, N + 1):
    dp[i][y[i - 1] + X*N] += 1
    for j in range(len(dp[0])):
        dp[i][j] += dp[i - 1][j]
        diff = j + y[i - 1]
        if 0 <= diff and diff <= 2*X*N:
            dp[i][diff] += dp[i - 1][j]

print(dp[N][X*N])
Buggy python submission (verdict: Runtime Error):
N=input()
x=N.count(7)
print("Yes" if x>0
      else "No")

Fixed submission:
N=input()
x=N.count("7")
print("Yes" if x>0
      else "No")
Buggy python submission (verdict: Runtime Error):
A,B,K=map(int,input().split())
if A>=K:
  print (A-K, B)
elif A+B>=K:
  print(0, B+A-K)
else:
  print(O, O)

Fixed submission:
A,B,K=map(int,input().split())
if A>=K:
  print (A-K, B)
elif A+B>=K:
  print(0, B+A-K)
else:
  print(0, 0)

Buggy python submission (verdict: Runtime Error):
A,B,K=map(int,input().split())
if A>=K:
  print (A-K,B)
elif A+B>=K:
  print(0,B+A-K)
else:
  print(O,O)

Fixed submission:
A,B,K=map(int,input().split())
if A>=K:
  print (A-K, B)
elif A+B>=K:
  print(0, B+A-K)
else:
  print(0, 0)
Buggy python submission (verdict: Runtime Error):
R,G = map (int, input(). split())
print (2*G-R)

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

print (2*G-R)

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

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

print (2*G-R)
Buggy python submission (verdict: Runtime Error):
s=input()
b=input()
c=0
for i in len(s):
  if s[i]!=b[i]:
    c=c+1
  else:
    pass
print(c)

Fixed submission:
s=input()
b=input()
c=0
for i in range(len(s)):
    if s[i]!=b[i]:
        c=c+1
    else:
        pass
print(c)
Buggy python submission (verdict: Runtime Error):
x=int(input())
s=list(input())
su=s
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        su.pop(i)
    else:
        pass
print(len(su))

Fixed submission:
n=int(input())
a=input()
s=list(a)
b=list(a)
j=0
for i in range(0,n-1):
    if s[i]==s[i+1]:
        b.pop(i-j)
        j=j+1
    else:
        pass
print(len(b))
Buggy python submission (verdict: Runtime Error):
x = map(int, input())
print(2*x*3.14)

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

Buggy python submission (verdict: Runtime Error):
x = map(int, input())
print(2*x*3.14)

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

Buggy python submission (verdict: Runtime Error):
x = input()
print(2*x*3.14)

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

Buggy python submission (verdict: Runtime Error):
x = map(int, input().split())
print(2*x*3.14)

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

Buggy python submission (verdict: Runtime Error):
x = map(int, input().split())
print(2*π*x)

Fixed submission:
x = int(input())
print(2*x*3.14)
Buggy python submission (verdict: Runtime Error):
N = int(input())
import math
print(math.celi(N/2))

Fixed submission:
N = int(input())
import math
print(math.ceil(N/2))
Buggy python submission (verdict: Runtime Error):
S,T = input().split()
A,B = int(input().split())
U = input()
if U == S:
  	print(A-1,B)
elif U == T:
    print(A,B-1)
    

Fixed submission:
S,T = input().split()
A,B = map(int,input().split())
U = input()
if U == S:
  	print(A-1,B)
elif U == T:
    print(A,B-1)

Buggy python submission (verdict: Runtime Error):
S,T = input().split()
A,B = int(input().split())
U = input()

if S == U:
  	print(A-1,B)
elif T == U:
    print(A,B-1)

Fixed submission:
S,T = input().split()
A,B = map(int,input().split())
U = input()
if U == S:
  	print(A-1,B)
elif U == T:
    print(A,B-1)

Buggy python submission (verdict: Runtime Error):
S,T = input().split()
A,B = int(input().split())
U =input()

if S == U:
  	print(A-1,B)
else:
    print(A,B-1)
    

Fixed submission:
S,T = input().split()
A,B = map(int,input().split())
U = input()
if U == S:
  	print(A-1,B)
elif U == T:
    print(A,B-1)
Buggy python submission (verdict: Runtime Error):
A,B,K = map(int, input().split())
if A >= K:
  print(A-K,B)
  else:
  print(0,B-(K-A))
  

Fixed submission:
A,B,K = map(int, input().split())
if A >= K:
  	print(A-K,B)
elif A+B >= K:
  	print(0,B-(K-A))
else:
	print(0,0)
Buggy python submission (verdict: Runtime Error):
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
else
	print("C")

Fixed submission:
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")

Buggy python submission (verdict: Runtime Error):
X = int(input())
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")

Fixed submission:
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")

Buggy python submission (verdict: Runtime Error):
X = int(input())
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
else:
	print("C")

Fixed submission:
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")

Buggy python submission (verdict: Runtime Error):
X = int(input())
if X = "A":
  	print("T")
elif X = "T":
  	print("A")
elif X = "C":
  	print("G")
else:
	print("C")
    

Fixed submission:
X = input()
if X == "A":
  	print("T")
elif X == "T":
  	print("A")
elif X == "C":
  	print("G")
elif X == "G":
	print("C")
Buggy python submission (verdict: Runtime Error):
x = int(input())
print(2*x*3.14)

Fixed submission:
x,y = map(int, input().split())
a,b = map(int, input().split())
print((x-a)*(y-b))

Buggy python submission (verdict: Runtime Error):
x = map(int, input().split())
print(2*x*3.14)

Fixed submission:
x,y = map(int, input().split())
a,b = map(int, input().split())
print((x-a)*(y-b))
Buggy python submission (verdict: Runtime Error):
X,A,B = int(input()) for i in range(3)
print((X-A)%B)

Fixed submission:
X = int(input())
A = int(input())
B = int(input())
print((X-A)%B)
Buggy python submission (verdict: Runtime Error):
x,y = map(int, input().split())
import math
print(math.celi((x+y)/2))

Fixed submission:
x,y = map(int, input().split())
z =x+y
import math
print(math.ceil(z/2))
Buggy python submission (verdict: Runtime Error):
N,A = int(input()) for i in range(2)
print(N*N-A)

Fixed submission:
N = int(input())
A = int(input())
print(N*N-A)

Buggy python submission (verdict: Runtime Error):
N,A = map(int, input()) for i in range(2)
print(N*N-A)

Fixed submission:
N = int(input())
A = int(input())
print(N*N-A)

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

Fixed submission:
N = int(input())
A = int(input())
print(N*N-A)
Buggy python submission (verdict: Runtime Error):
N = input()
if N in "9":
  print("Yes")
else print("No")


Fixed submission:
N = input()
if "9" in N:
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if N in 9:
  print("Yes")
else print("No")


Fixed submission:
N = input()
if "9" in N:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
x,y = input().split()
a = x-1
b = y-1
print(a*b)

Fixed submission:
x,y = map(int, input().split())
print((x-1)*(y-1))

Buggy python submission (verdict: Runtime Error):
x,y = input().split()
print((x-1)*(y-1))

Fixed submission:
x,y = map(int, input().split())
print((x-1)*(y-1))

Buggy python submission (verdict: Runtime Error):
x, y = int(input().split())
a = x-1
b = y-1
print(a*b)

Fixed submission:
x,y = map(int, input().split())
print((x-1)*(y-1))

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

Fixed submission:
x,y = map(int, input().split())
print((x-1)*(y-1))

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

Fixed submission:
x,y = map(int, input().split())
print((x-1)*(y-1))
Buggy python submission (verdict: Runtime Error):
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.fanctional(x) % a)

Fixed submission:
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.factorial(x) % a)

Buggy python submission (verdict: Runtime Error):
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.fanctional(x)%a)

Fixed submission:
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.factorial(x) % a)

Buggy python submission (verdict: Runtime Error):
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.functional(x)%a)

Fixed submission:
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.factorial(x) % a)

Buggy python submission (verdict: Runtime Error):
import math
x = int(input())
y = 10*10*10*10*10*10*10*10*10 +7
print(math.functional(x)%y)

Fixed submission:
import math
x = int(input())
a = 10*10*10*10*10*10*10*10*10+7
print(math.factorial(x) % a)