Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
# 高橋君は500円玉をK枚持っています。 これらの総額がX円以上である場合は Yes を、そうでない場合は No を出力してください。
# コマンドライン引数 K X
# 制約　1≤K≤100　1≤X≤10^5

import sys

# コマンドライン引数を変数に入れる
if 1 < len(sys.argv) < 4:
    K = sys.argv[1]
    X = sys.argv[2]

# コマンドライン引数が想定外
else:
    print("引数の指定に誤りがあります")

# 総額の保持
sum = 500 * int(K)

# 出力文の作成
if sum >= int(X):
    print('Yes')
else:
    print('No')

Fixed submission:
# 高橋君は500円玉をK枚持っています。 これらの総額がX円以上である場合は Yes を、そうでない場合は No を出力してください。
# コマンドライン引数 K X
# 制約　1≤K≤100　1≤X≤10^5

import sys

inp_word = input()

# コマンドライン引数を変数に入れる
K,X = inp_word.split()

# 総額の保持
sum = 500 * int(K)

# 出力文の作成
if sum >= int(X):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
# 問題文：長さNの偶数からなる正の整数列A=a1,a2,...,aNと、整数Mが与えられます。
#        任意のk(1≤k≤N)に対して以下の条件を満たす正の整数XをAの「半公倍数」と定義します。
#        X=ak×(p+0.5)を満たす負でない整数pが存在する。
#        1以上M以下の整数のうちのAの半公倍数の個数を求めてください。
# 入力 : 以下の形式で標準入力から与えられる。
#       N M
#       a1 a2 ... aN
# 出力 : 1 以上 M 以下の整数のうちの A の半公倍数の個数を出力せよ。

# 最小半公倍数を求める
def min_hankobaisu(A, M):
    result = 1
    for a in A:
        result = result * a / 2
        if result > M:
            print(0)
            exit(0)
    return int(result)

# 正の整数列Aの長さN, 半公倍数の上限M
N, M = map(int, input().split())

# 正の整数列A
A = list(set(list(map(int, input().split()))))
A.sort(reverse=True)
# hankobaisu_list = []

# 与えられた数値が2*奇数と2*偶数なのであれば半公倍数はない
# → その場で終了
for i in range(0, len(A) - 1):
    if (A[i] / 2 % 2) != (A[i + 1] / 2 % 2):
        print(0)
        exit(0)

# A[i] が2*偶数の場合はだめ？
if (A[0] / 2) % 2 == 0:
    print(0)
    exit(0)

# 半公倍数の最小値を求める
min_hankobaisu = min_hankobaisu(A, M)
#print('最小半公倍数：{}'.format(min_hankobaisu))
print(int(M/min_hankobaisu+1)/2)



Fixed submission:
# 問題文： 大きさ N の順列 ((1, 2, ..., N) を並び替えてできる数列) P, Q があります。大きさ N の順列は N! 通り考えられます。
#         このうち、P が辞書順で a 番目に小さく、Q が辞書順で b 番目に小さいとして、|a−b| を求めてください。
# 注記： 2 つの数列 X, Y について、ある整数 k が存在して Xi=Yi (1≤i<k) かつ Xk<Yk が成り立つとき、X は Y より辞書順で小さいと定義されます。
# 制約: 2≤N≤8　P,Qは大きさNの順列である。入力は全て整数である。

import math

# 数列が何番目かを返却するメソッド
def junban(N, str):
    int_N = int(N)
    int_list = str.split() # 入力文字を配列化
    int_list = [int(i) for i in int_list]
    yet_list = str.split() # まだ出てきていない数字のリスト
    yet_list = [int(i) for i in yet_list]

    num = 1 # 何番目か保持する
    keta = 0 # 上から何桁目か保持する

    while keta < (int_N):
        # 該当桁の数字を確保する
        now_int = int_list[keta]

        # 未出数値のリストを更新する
        yet_list.remove(now_int)

        # 該当桁以下の階乗
   #     print('該当桁以下の桁数は：{}'.format(len(yet_list)))
        # 該当桁の数字より若い数字がいくつ残っているか
    #    print('該当桁の数字より若い数字はあと{}個'.format(len([i for i in yet_list if i < now_int])))

        # 順番をカウント
        # 該当桁以下の階乗 * 未出数値の内、現在より数値の小さいものの個数
        num += math.factorial(len(yet_list)) * len([i for i in yet_list if i < now_int])
        keta += 1

#    print('{}番目'.format(num))
    return num

# 大きさNを受け取る
N = input()
# 数列Pを受け取る
P = input()
# 数列Qを受け取る
Q = input()

# Pが何番目か求める
p_int = junban(N, P)
q_int = junban(N, Q)

print(abs(p_int - q_int))
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter

anagrams = []
for _ in range(int(input())):
    count = Counter(input())
    found = False
    for v in anagrams:
        if v["count"] == count:
            found = True
            v["total"] += 1
            break
    if not found:
        anagrams.append({"count": count, "total": 1})

total = 0
for v in anagrams:
    n = v["total"]
    total += n * (n - 1) / 2

print(int(total))


Fixed submission:
from collections import defaultdict

anagrams = defaultdict(int)
for _ in range(int(input())):
    anagrams[str(sorted(input()))] += 1

total = 0
for k, v in anagrams.items():
    total += v * (v - 1) / 2

print(int(total))
Buggy python submission (verdict: Time Limit Exceeded):
x = input()
y = x.split()
y = [int (i) for i in y]

length = y[0]
num    = y[1]

count  = 0
string = input()
for i in range(num):
    z = input()
    c = z.split()
    c = [int (i) for i in c]
    l = c[0] - 1
    r = c[1] - 1
    for j in range(l,r+1):
        if j+1 < r+1:
             if string[j] == "A" and string[j+1] == "C":
                 count +=1
    print(count)
    count = 0


Fixed submission:
x = input()
y = x.split()
y = [int (i) for i in y]
string = input()

length = y[0]
num    = y[1]
arr    = [0] * (length + 1)
arr[0] = 0

count = 0
for i in range(length-1):
    if string[i] == "A" and string[i+1] == "C":
        count +=1
        arr[i+1] = count
    else:
        arr[i+1] = arr[i]

result   = 0
for i in range(num):
    z = input()
    c = z.split()
    c = [int (i) for i in c]
    l = c[0]
    r = c[1]
    result = arr[r-1] - arr[l-1]

    print(result)
    result = 0
Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())


if A + B <= K:
	print(0, 0)
elif A < K:
	print(0, B - (K - A))
else:
	print(K - A, B)

Fixed submission:
S, T = input().split()
print(T + S)

Buggy python submission (verdict: Runtime Error):
S, T = map(str, input().split())
print(T + S).split('')


Fixed submission:
S, T = input().split()
print(T + S)
Buggy python submission (verdict: Time Limit Exceeded):
A, B, K = map(int, input().split())

for i in range(K):
	if A > 0:
		A -= 1
	elif B > 0:
		B -= 1
	else:
		pass
		
print(A, B)

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


	
if K <= A:
	print(A - K, B)
elif K <= A + B:
	print(0, A + B - K)
else:
	print(0, 0)
Buggy python submission (verdict: Runtime Error):
from sympy import nextprime
from sympy import isprime

X = int(input())

if isprime(X) == True:
	print(nextprime(X))
else:
	print(X)


Fixed submission:
import math 

def is_prime(n):
	if n == 1:
		return False
		
	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False
			
	return True
	
n = int(input())

X = n

for i in range(n,10**6):
	if is_prime(i):
		break
		
print(i)
Buggy python submission (verdict: Runtime Error):
H = int(input())
A = int(input())
count = 0


while H > 0:
    H -= A
    count +=1
print(count)

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


count = 0

while H > 0:
    H -= A
    count +=1

print(count)

Buggy python submission (verdict: Runtime Error):
H = int(input())
A = int(input())
count = 0


while H > 0:
    H -= A
    count +=1
else:
    print(count)

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


count = 0

while H > 0:
    H -= A
    count +=1

print(count)

Buggy python submission (verdict: Runtime Error):
H = input()
A = input()
count = 0


while H > 0:
    H -= A
    count +=1
else:
    print(count)

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


count = 0

while H > 0:
    H -= A
    count +=1

print(count)

Buggy python submission (verdict: Runtime Error):
H = input()
A = input()
count = 0


while H > A:
    H -= A
    count +=1
else:
    print(count)

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


count = 0

while H > 0:
    H -= A
    count +=1

print(count)
Buggy python submission (verdict: Runtime Error):
floor(X = input(N / 1.08)


Fixed submission:
import math

N = int(input())
X = int(N / 1.08)

for X in range(1, N+1):
  if(int(1.08*X) == N):
    print(X)
    exit(0)

print(":(")
Buggy python submission (verdict: Runtime Error):
A, B) = map(int, input().split(' '))
if A < 10 and B < 10:
    print(A * B)
else:
    print('-1')


Fixed submission:
(A, B) = map(int, input().split(' '))
if A < 10 and B < 10:
    print(str(A * B))
else:
    print('-1')
Buggy python submission (verdict: Runtime Error):
for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            print('yes')
        else:
            print('No')

Fixed submission:
N = int(input())
for a in range(1, 10):
    flag = False
    for b in range(1, 10):
        if a * b == N:

            flag = True
            break
    if flag:
        break
if flag:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
def price():
    ramen_price = 700
    sa, st, sn = input().split() 
    if sa == 'o':
        ramen_price +=100
    if st == 'o':
        ramen_price +=100
    if sn == 'o':    
        ramen_price +=100
    print(ramen_price)

price()


Fixed submission:
s = input()
t = 0
for i in range(3):
    if s[i] == 'o':
        t+=1

print(700 + t * 100)
Buggy python submission (verdict: Runtime Error):
[H, A] = input().split(" ")
return int(H/A)

Fixed submission:
H, A = map(int, input().split())
print(int(H/A) if H % A == 0 else int(H/A)+1)
Buggy python submission (verdict: Runtime Error):
#coding: utf-8

value = input()

list = value.split()

for i in range(len(lise)):
  list[i] = int(list[i])
  
sum = list[0] + list[1] + list[2]

if sum >= 22:
  print("bust")
else:
  print("win")

Fixed submission:
#coding: utf-8

value = input()

list = value.split()

for i in range(len(list)):
  list[i] = int(list[i])
  
sum = list[0] + list[1] + list[2]

if sum >= 22:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Runtime Error):
coding: utf-8

value = int(input())

gokei = 0

for i in range(value):
    gokei += i + 1
    
print(gokei)

Fixed submission:
#coding:utf-8
 
value = int(input())
 
gokei = 0
 
for i in range(value):
    gokei += i + 1
    
print(gokei)
Buggy python submission (verdict: Time Limit Exceeded):
# coding utf-8
import math
N, K = map(int, input().rstrip().split())

H = list(map(int, input().rstrip().split()))

if N > K:
    for i in range(K):
        H.remove(max(H))
    ans = sum(H)
else:
    ans = 0

print(ans)


Fixed submission:
# coding utf-8
import math

N, K = map(int, input().rstrip().split())

H = list(map(int, input().rstrip().split()))
H.sort()

if N > K:
    if K == 0:
        ans = sum(H)
    else:
        ans = sum(H[:-K])
else:
    ans = 0

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
L = list(map(int, input().split()))
t = 0
for l in L :
    t += l
t = t - max(L)

    
if max(L) < t:
  print("Yes")
else :
  print("No")

Fixed submission:
a,b = map(int, input().split())
print(a/b)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

c = b - a
y = 0
for i in range(c+1):
    y = y + i

print(y-b)


Fixed submission:
N = int(input())

if (N<=999) :
    print('ABC')
else :
    print('ABD')
Buggy python submission (verdict: Runtime Error):
Cost0 = 0
CostN = 0

listA=[]
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
X = listA[0][2]

for x in listA:
   length += len(x)

for i in range(length - 3):
    if (listA[1][i] < X):
        Cost0 = Cost0 +1
    else:
        CostN = CostN +1

if (Cost0 < CostN):
    print(Cost0)
else:
    print(CostN)


Fixed submission:
Cost0 = 0
CostN = 0
length = 0

listA=[]
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
X = listA[0][2]

for x in listA:
   length += len(x)

for i in range(length - 3):
    if (listA[1][i] < X):
        Cost0 = Cost0 +1
    else:
        CostN = CostN +1

if (Cost0 < CostN):
    print(Cost0)
else:
    print(CostN)
Buggy python submission (verdict: Runtime Error):
S = raw_input()

chksum = 0
 
if ('a' in S):
    chksum+=1
if ('b' in S):
    chksum+=1
if ('c' in S):
    chksum+=1
    
if chksum == 3:
	print("yes")
else:
	print("no")

Fixed submission:
S = input()

chksum = 0
 
if ('a' in S):
    chksum+=1
if ('b' in S):
    chksum+=1
if ('c' in S):
    chksum+=1
    
if chksum == 3:
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
S = raw_input()

n_a = S.find('a')
n_b = S.find('b')
n_c = S.find('c')

chksum = n_a + n_b + n_c

if chksum = 0:
	print("yes")
else:
	print("no")

Fixed submission:
S = input()

chksum = 0
 
if ('a' in S):
    chksum+=1
if ('b' in S):
    chksum+=1
if ('c' in S):
    chksum+=1
    
if chksum == 3:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())
max_val=(max([A,B,C]))
odd_chk =3 * max_val - A - B - C
if(odd_chk%2 == 0):
         print("{:.0f}".format(odd_chk/2))
else:
         print("{:.0f}".format(odd_chk+3)/2)
 

Fixed submission:
A,B,C = map(int,input().split())
max_val=(max([A,B,C]))
odd_chk =3 * max_val - A - B - C
if(odd_chk%2 == 0):
         print(int(odd_chk/2))
else:
         print(int((odd_chk+3)/2))
Buggy python submission (verdict: Runtime Error):
a = list(map(int,input().split()))
a.sort()

if a[0] == 5:
  if a[1] == 5:
    if a[2] == 7:
      return "YES":

return "NO"

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

if a[0] == 5 and a[1] == 5 and a[2] == 7:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))
count: int = 0
if i[0] <= i[1]:
    print("1")
else:
    while i[0] > 0:
        i[0] -= i[1]
        count += 1
    print(count)

Fixed submission:
i = list(map(int, input().split()))
count = 0
if i[0] <= i[1]:
    print("1")
else:
    while i[0] > 0:
        i[0] -= i[1]
        count += 1
    print(count)
Buggy python submission (verdict: Runtime Error):
print chr(ord(input())+1)

Fixed submission:
s = input()
s = chr(ord(s) + 1)
print(s)
Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))
if ((i[0] >= 1 and i[0] <= 9) and (i[1] >= 1 and i[1] <= 9)):
    print (i[0] * i[1])
else:
    print -1

Fixed submission:
i = list(map(int, input().split()))
if ((i[0] >= 1 and i[0] <= 9) and (i[1] >= 1 and i[1] <= 9)):
    print (i[0] * i[1])
else:
    print (-1)
Buggy python submission (verdict: Runtime Error):
h = int(input())

def count(h):
    if(h==0):
        return 0
    if(h==1):
        return 1
    return 1 + 2*count(h/2)
    
print(count(h))


Fixed submission:
h = int(input())

def count1(h):
    if(h==0):
        return 0
    if(h==1):
        return 1
    return 1 + 2*count1(h//2)
    
print(count1(h))

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

def count(h):
    if(h<=0):
        return 0
    else:
        return 1 + 2*count(h/2)

print(count(h))

Fixed submission:
h = int(input())

def count1(h):
    if(h==0):
        return 0
    if(h==1):
        return 1
    return 1 + 2*count1(h//2)
    
print(count1(h))
Buggy python submission (verdict: Runtime Error):
m,n = [int(x) for x in input().split()]
if m==n:
	print("Yes")
else
	print("No")

Fixed submission:
n,m = [int(x) for x in input().split()]
if n==m:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
import itertools
n = int(input())
p = tuple(map(int,input().split()))
q = tuple(map(int,input().split()))
length = [i+1 for i in range(n)]
permut = list(itertools.permutations(length))
print(max((permut.index(p)) - (permut.index(q)) , (mm.index(q)) - mm.index(p)))


Fixed submission:
import itertools
n = int(input())
p = tuple(map(int,input().split()))
q = tuple(map(int,input().split()))
length = [i+1 for i in range(n)]
permut = list(itertools.permutations(length))
print(max((permut.index(p)) - (permut.index(q)) , (permut.index(q)) - permut.index(p)))
Buggy python submission (verdict: Runtime Error):
ans=0
shogen=[]
n=int(input())
for _ in range(n):
  t=[]
  a=int(input())
  for __ in range(a):
    h=list(map(int,input().split()))
    t.append(s)
  shogen.append(t)
for i in range(2**n):
  flag=True
  for j in range(n):
    if not flag:
      break
    if ((i>>j) & 1):
      for h in shogen[j]:
        if ((i>>h[0]-1)&1) !=h[1]:
          flag=False
  if flag:
    mnt = bin(i).count("1")
    ans=max(ans,mnt)
print(ans)


Fixed submission:
n=int(input())
shogen=[]
for _ in range(n):
  a=int(input())
  t=[]
  for __ in range(a):
    s=list(map(int,input().split()))
    t.append(s)
  shogen.append(t)

ans=0

for i in range(2**n):
  flag=True
  for j in range(n):
    if not flag:
      break
    if ((i>>j) & 1):
      for s in shogen[j]:
        if ((i>>s[0]-1)&1) !=s[1]:
          flag=False
  if flag:
    mnt = bin(i).count("1")
    ans=max(ans,mnt)
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys

H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for n in range(N)]

dp = [sys.maxsize for i in range(H+1)]
dp[0] = 0

# 各ダメージ段階の最小値を求める
for i in range(H):
    if dp[i] == sys.maxsize:
        continue
    # 各魔法を使って最小値なら更新
    for j in range(N):
        a = min(i + AB[j][0], H)
        b = dp[i] + AB[j][1]
        if dp[a] > b:
            dp[a] = b

print(dp[H])


Fixed submission:
import math

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

N = math.ceil(H/A)

print(N)

Buggy python submission (verdict: Runtime Error):
import sys

def use_dp():
    max_a = max([ab[0] for ab in AB])
    dp = [sys.maxsize for i in range(H+max_a)]
    dp[0] = 0

    # 各ダメージ段階の最小値を求める
    for i in range(H):
        if dp[i] == sys.maxsize:
            continue
        # 各魔法を使って最小値なら更新
        for j in range(N):
            a = i + AB[j][0]
            b = dp[i] + AB[j][1]
            if dp[a] > b:
                dp[a] = b

    # H < i < H+max(Ai)の範囲で最小値を求める
    min_mp = sys.maxsize
    for i in range(H, H+max_a):
        min_mp = min(dp[i], min_mp)

    print(min_mp)


if __name__ == '__main__':
    H, N = list(map(int, input().split()))
    AB = []
    for n in range(N):
        AB.append(list(map(int, input().split())))

    use_dp()

Fixed submission:
import math

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

N = math.ceil(H/A)

print(N)
Buggy python submission (verdict: Runtime Error):
H, N = list(map(int, input().split()))
A_list = list(map(int, input().split()))

win: bool = sum(A_list) >= H
print('Yes' if win else 'No')

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

win = sum(A_list) >= H
print('Yes' if win else 'No')
Buggy python submission (verdict: Runtime Error):
import math
A,B =[int(i) for i in input().split()]
result = (A*B) // math.gcd(A, B)
print(result)

Fixed submission:
import fractions
A,B =[int(i) for i in input().split()]
result = (A*B) // fractions.gcd(A, B)
print(result)
Buggy python submission (verdict: Runtime Error):
h,a = map(int, input().split())
print(h//a if !h%a else h//a + 1)

Fixed submission:
h,a = map(int, input().split())
print(-(-h//a))

Buggy python submission (verdict: Runtime Error):
h,a = map(int, input().split())
print(int(h/a) if !h%a else int(h/a) + 1)

Fixed submission:
h,a = map(int, input().split())
print(-(-h//a))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=0
for i in range(1,n+1):
  for j in range(1,n+1):
    if str(i)[0]==str(j)[-1] and str(j)[0]==str(i)[-1]:
      a+=1
print(a)

Fixed submission:
n=int(input())
t=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
  t[int(str(i)[0])][i%10]+=1
a=0
for i in range(10):
  for j in range(10):
    a+=t[i][j]*t[j][i]
print(a)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=0
for i in range(1,n+1):
  for j in range(i,n+1):
    if str(i)[0]==str(j)[-1] and str(j)[0]==str(i)[-1]:
      a++
print(a)

Fixed submission:
n=int(input())
t=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
  t[int(str(i)[0])][i%10]+=1
a=0
for i in range(10):
  for j in range(10):
    a+=t[i][j]*t[j][i]
print(a)
Buggy python submission (verdict: Runtime Error):
print(chr(ord(input()+1)))

Fixed submission:
print(chr(ord(input())+1))
Buggy python submission (verdict: Runtime Error):
S = input()
a = 0
for i in range(len(S)//2):
  if S[i] != S[-i-1]:
    S[i] = S[-i-1]
    a += 1
print(a)

Fixed submission:
S = list(input())
a = 0
for i in range(len(S)//2):
  if S[i] != S[-(i+1)]:
    S[i] = S[-(i+1)]
    a += 1
print(a)
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,input().split())
a=[int(input()) for i in range(m)]
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
    dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
    if i in a:dp[i]=0
print(dp[n])

Fixed submission:
n,m=map(int,input().split())
a=set([int(input()) for i in range(m)])
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
    dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
    if i in a:dp[i]=0
print(dp[n])
Buggy python submission (verdict: Time Limit Exceeded):
N,Q = map(int,input().split())
S = input()
for i in range(Q):
    l,r = map(int,input().split())
    print(S[l-1:r].count("AC"))

Fixed submission:
N,Q = map(int,input().split())
S = input()
T = [0]*(N+1)
for i in range(N):
    T[i+1] = T[i]+ (1 if S[i:i+2]=="AC" else 0)
for i in range(Q):
    l,r = map(int,input().split())
    print(T[r-1]-T[l-1])
Buggy python submission (verdict: Time Limit Exceeded):
ans=1
n=int(input())
for i in range(1,n+1):
    ans*=i
print(ans%(10**9+7))

Fixed submission:
ans=1
n=int(input())
for i in range(1,n+1):
    ans*=i
    ans=ans%(10**9+7)
print(ans)
Buggy python submission (verdict: Runtime Error):
k = input()
x = input()

if 500 * int(k) >= int(x):
    print("Yes")
else:
    print("No")
    

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

if 500 * int(k) >= int(x):
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
k = input()
x = input()

if 500 * int(k) >= int(x):
    print("Yes")
else:
    print("No")
    

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

if 500 * int(k) >= int(x):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
    s, t = input().split()
    print(t+s)

Fixed submission:
s, t = input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
from lib2to3.fixer_util import String
s, t = map(String, input().split())
print(s + t)

Fixed submission:
s, t = input().split()
print(t+s)

Buggy python submission (verdict: Runtime Error):
s, t = map(String, input(),split())
	print(s+t)

Fixed submission:
s, t = input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
T = list(map(int, input().split()))
T.sort()
if K>=N:
    print(0)
else:
    for i in range(K):
        T.pop()
    
    print(sum(T)) 

Fixed submission:
def c(i):
    return i

H,A = map(int, input().split())
a,b = map(c,divmod(H,A))
if b==0:
    print(a)
else:
    print(a+1)
Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
H = map(int, input().split())
T = list(H)
if K>=N:
    print("0")
else:
    T.sort(reverse = True)
    for i in range(K):
        del T[0]
    
    print(sum(T))

Fixed submission:
N,K = map(int, input().split())
T = list(map(int, input().split()))
T.sort()
if K>=N:
    print(0)
else:
    for i in range(K):
        T.pop()
    
    print(sum(T))
Buggy python submission (verdict: Runtime Error):
def factorial(n):
    if n == 0:
        return 1.0
    else:
        return n*factorial(n-1)


n = int(raw_input())
k = n
arr = []
while(k > 0):
    x, y = map(int, raw_input().split())
    arr.append((x, y))
    k -= 1

total = 0.0
for i in range(n):
    x1 = arr[i][0]
    x2 = arr[i][1]
    for j in range(i+1, n, 1):
        y1 = arr[j][0]
        y2 = arr[j][1]
        dist = (x1-y1)*(x1-y1) + (x2-y2)*(x2-y2)
        print dist
        dist = float(math.sqrt(dist))
        dist = dist * float((factorial(n-1)*2))
        total += dist * float(1/factorial(n))

print total

Fixed submission:
import math
 
def factorial(n):
    if n == 0:
        return 1.0
    else:
        return n*factorial(n-1)
 
 
n = int(raw_input())
k = n
arr = []
while(k > 0):
    x, y = map(int, raw_input().split())
    arr.append((x, y))
    k -= 1
 
total = 0.0
for i in range(n):
    x1 = arr[i][0]
    x2 = arr[i][1]
    for j in range(i+1, n, 1):
        y1 = arr[j][0]
        y2 = arr[j][1]
        dist = (x1-y1)*(x1-y1) + (x2-y2)*(x2-y2)
        dist = float(math.sqrt(dist))
        dist = dist * float((factorial(n-1)*2))
        total += dist * float(1/factorial(n))
 
print total