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

Fixed submission:
import collections
import sys
input = lambda: sys.stdin.readline().strip()

def main():
    N,M = map(int,input().split())
    H_list = list(map(int,input().split()))
    ab_list = [list(map(int,input().split())) for _ in range(M)]

    ab_dict = {i: [] for i in range(N)}
    for a,b in ab_list:
        a,b = a-1,b-1
        ab_dict[a].append(b)
        ab_dict[b].append(a)

    c = collections.Counter(H_list)

    # print(H_list)
    # print(ab_dict)
    ans = 0
    for k,v_list in ab_dict.items():
        for v in v_list:
            if H_list[v] >= H_list[k]:
                break
        else:ans += 1
    print(ans)

main()

Buggy submission (verdict: Runtime Error):
import collections
import sys
input = lambda: sys.stdin.readline().strip()

def main():
    N,M = map(int,input().split())
    H_list = list(map(int,input().split()))
    ab_list = [map(int,input().split()) for _ in range(M)]

    ab_dict = dict()
    for a,b in ab_list:
        minab = min(a,b)
        if str(minab) not in ab_dict.keys():
            ab_dict.update({min(a,b):[max(a,b)]})
        else:
            ab_dict[str(minab)] += max(a,b)
    c = collections.Counter(H_list)

    ans = 0
    for i in range(1,len(ab_dict)+1):
        if i < min(ab_dict.get(i)):
            ans += c[i]
    print(ans)

main()
Problem p02676 (python)

Fixed submission:
a = int(input())
b = input()
i = 0
while i < a and i < len(b):
    print(end = b[i])
    i = i + 1
if a < len(b) :
    print(end = "...")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = input()
i = 0
while i < a :
    print(end = b[i])
    i = i + 1
if a < len(b) :
    print(end = "...")
Problem p02753 (python)

Fixed submission:
a = input()
b = 0
c = 0
i = 0
while i < len(a) :
    if a[i] == "A" :
        b = b + 1
    if a[i] == "B" :
        c = c + 1
    i = i + 1
if (b > 0) and (c > 0) :
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a = input()
b = 0
c = 0
i = 0
while i < a :
    if a[i] == "A" :
        b = b + 1
    if a[i] == "B" :
        c = c + 1
    i = i + 1
if (b > 0) and (c > 0) :
    print("Yes")
else:
    print("No")
Problem p03253 (python)

Fixed submission:
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

from scipy.special import comb
n, m = map(int, input().split())
a = factorization(m)
M = 10**9 + 7

ans = 1
if m == 1:
    print(1)
    exit()
for i in a:
    ans *= comb(n, i[1], exact=True, repetition=True)
    ans = ans%M
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
m = int(input())
a = list(map(int,input().split()))
M = 10000

dp = [[0]*(m+1) for i in range(n+1)]

for i in range(n+1):
    dp[i][0] = 1
    
for i in range(n):
    for j  in range(1,m+1):
        if j - 1 - a[i] >= 0:
            dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j] - dp[i][j - 1 - a[i]] ) % M
        else:
            dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % M
            
print(dp)
Problem p03775 (python)

Fixed submission:
n = int(input())
a = []
for i in range(1,int(n**(0.5))+1):
    if n%i == 0:
        a.append(i)
m = max(a)
c = int(n/m)
keta = len(str(c))
print(keta)

Buggy submission (verdict: Runtime Error):
from collections import Counter

n = int(input())
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

cnt = Counter(prime_factorize(n))
two_five = min(cnt[2],cnt[5])
x = 0
for key in cnt:
    if x < key:
        x = key
keta = len(str(key))

print(max(keta,-(-two_five//2)+1))

Buggy submission (verdict: Runtime Error):
from collections import Counter

n = int(input())
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

cnt = Counter(prime_factorize(n))
two_five = min(cnt[2],cnt[5])
x = 0
for key in cnt:
    if x < key:
        x = key
keta = len(str(key))

print(max(keta,-(-two_five//2)+1))
Problem p02835 (python)

Fixed submission:
x = input()
a1 = int(x.split()[0])
a2 = int(x.split()[1])
a3 = int(x.split()[2])

sum = a1 + a2 + a3

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

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

for i in range(len(s) / 2):
  print(list[i])
Problem p02594 (python)

Fixed submission:
t = int(input())
print("Yes" if 30 <= t else "No")

Buggy submission (verdict: Runtime Error):
t = int(input())
print("Yes" if 30 <= t "No")
Problem p02701 (python)

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

print(len(set(S)))

Buggy submission (verdict: Runtime Error):
N = int(input().split())
S = []
for _ in range(N):
    keihin = input().split()
    if keihin not in S:S.append(keihin)

print(len(S))
Problem p02759 (python)

Fixed submission:
N = int(input())
print(int(N/2)+N%2)

Buggy submission (verdict: Runtime Error):
for i in range(3):
    a = []
    for j in range(3):
      	a = input().split()
        a = [int(x) for x in a]
    A.append(a)
N = int(input())
C = []
for _ in range(3):
    C.append(np.zeros(3))
 
for _ in range(N):
    b = int(input())
    for i in range(3):
        for j in range(3):
            if A[i][j] == b: C[i][j] = 1
 
for i in range(3):
    if sum(C[:][i]) == 3:
        print('Yes')
        break
    elif sum(C[i][:]) == 3:
        print('Yes')
        break
if C[1][1]+C[2][2]+C[0][0] == 3:
    print('Yes')
elif C[0][2]+C[1][1]+C[2][0] == 3:
    print('Yes')
else: print('No')
Problem p02723 (python)

Fixed submission:
string=str(input())
if(string[2]==string[3] and string[4]==string[5]):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
input=list(input())
if(input[2]==input[3] and input[5]==input[6]):
  print("Yes")
else:
  print("No")
Problem p02580 (python)

Fixed submission:
H,W,M = [int(x) for x in input().split()]
hw = []
hNum = [0]*H
wNum = [0]*W

for i in range(M):
    h,w = [int(x) for x in input().split()]
    hw.append([h,w])
    hNum[h-1]+=1
    wNum[w-1]+=1

hmax = max(hNum)
hMaxList = []
wmax = max(wNum)
wMaxList = []

for i in range(H):
    if(hmax == hNum[i]):
        hMaxList.append(i)
for i in range(W):
    if(wmax == wNum[i]):
        wMaxList.append(i)

ans = wmax + hmax
count = 0
for i in hw:
    if(hNum[i[0]-1] == hmax and wNum[i[1]-1] == wmax):
        count += 1
if(hNum.count(hmax) * wNum.count(wmax) == count):
    ans -= 1
print(ans)

Buggy submission (verdict: Runtime Error):
H,W,M = [int(x) for x in input().split()]
hw = []
hNum = [0]*10
wNum = [0]*10

for i in range(M):
    h,w = [int(x) for x in input().split()]
    hw.append([h,w])
    hNum[h]+=1
    wNum[w]+=1

hmax = max(hNum)
hMaxList = []
wmax = max(wNum)
wMaxList = []

for i in range(10):
    if(hmax == hNum[i]):
        hMaxList.append(i)

    if(wmax == wNum[i]):
        wMaxList.append(i)

ans = wmax + hmax
for i in range(10):
    if([i,i] in hw and i in hMaxList and i in wMaxList):
        ans -= 1
if(len(hw) < 10 and (hmax ==  1 or  wmax ==  1 )):
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
H,W,M = [int(x) for x in input().split()]
hw = []
hNum = [0]*10
wNum = [0]*10

for i in range(M):
    h,w = [int(x) for x in input().split()]
    hw.append([h,w])
    hNum[h]+=1
    wNum[w]+=1
hmax = -1
hMaxList = []
wmax = -1
wMaxList = []
for i in range(10):
    if(hmax <= hNum[i]):
        if(hmax == hNum[i]):
            hMaxList.append(i)
        else:
            hMaxList = [i]
        hmax = hNum[i]

    if(wmax <= wNum[i]):
        if(wmax == wNum[i]):
            wMaxList.append(i)
        else:
            wMaxList = [i]
        wmax = wNum[i]

ans = wmax + hmax
# print(ans)
# for i in range(10):
#     if([i,i] in hw and i in hMaxList and i in wMaxList):
#         ans -= 1
# if(len(hw) < 10 and (hmax ==  1 or  wmax ==  1 )):
#     ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
H,W,M = [int(x) for x in input().split()]
hw = []
hNum = [0]*10
wNum = [0]*10

for i in range(M):
    h,w = [int(x) for x in input().split()]
    hw.append([h,w])
    hNum[h]+=1
    wNum[w]+=1
hmax = -1
hMaxList = []
wmax = -1
wMaxList = []
for i in range(10):
    if(hmax <= hNum[i]):
        if(hmax == hNum[i]):
            hMaxList.append(i)
        else:
            hMaxList = [i]
        hmax = hNum[i]

    if(wmax <= wNum[i]):
        if(wmax == wNum[i]):
            wMaxList.append(i)
        else:
            wMaxList = [i]
        wmax = wNum[i]

ans = wmax + hmax
# print(ans)
for i in range(10):
    if([i,i] in hw and i in hMaxList and i in wMaxList):
        ans -= 1
if(len(hw) < 10 and (hmax ==  1 or  wmax ==  1 )):
    ans += 1
print(ans)
Problem p02597 (python)

Fixed submission:
N = int(input())
line = list(input())

# print(line)
bottom_w = N
top = 0
count = 0
while(bottom_w > top):
    for i in reversed(range(bottom_w)):
        if(line[i]=='R'):
            bottom_w = i
            break

    if(line[-1]=='W' and bottom_w == N):
        print(0)
        exit()
    if(bottom_w <= top):
        break
    for i in range(top,N):
        if(i == N-1):
            print(count)
            exit()
        if(line[i]=='W' and bottom_w > i):
            # print("line",i,line[i])
            # print("swap",i,bottom_w)
            count += 1
            line[bottom_w] = 'W'
            top = i+1
            break
print(count)

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

# print(line)
bottom_w = N
top = 0
count = 0
while(bottom_w > top):
    for i in reversed(range(bottom_w)):
        if(line[i]=='R'):
            bottom_w = i
            break

    for i in range(top,N):
        if(line[i]=='W' and bottom_w > i):
            # print("line",i,line[i])
            # print("swap",i,bottom_w)
            count += 1
            line[bottom_w] = 'W'
            top = i+1
            break
print(count)
Problem p02577 (python)

Fixed submission:
n = input()

s = sum([int(v) for v in n.split()])

if s % 9 == 0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
from math import ceil

n, x, t = [int(v) for v in input().split(" ")]


print(ceil(n / x) * t)

Buggy submission (verdict: Runtime Error):
from math import *

n, x, t = input().split(" ")


print(ceil(n / x) * t)
Problem p02777 (python)

Fixed submission:
S, T = input().split()
A, B = input().split()
U = input()
A, B = int(A), int(B)

if U == S:
    A -= 1
elif U == T:
    B -= 1

print(A, B)

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

if U == S:
    A -= 1
elif U == T:
    B -= 1

print(A, B)
Problem p02577 (python)

Fixed submission:
a = int(input())
if a % 9 == 0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a = input()
if a % 9 == 0:
  print("Yes")
else:
  print("No")
Problem p02577 (python)

Fixed submission:
N=int(input())
if N%9==0:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
x=0
N=int(input("整数を入力:"))

while(1==1):
    Nn=str(N/10)
    a=Nn.split(".")
    x+=int(a[1])
    N=int(a[0])
    if N==0:
        break
if x%9==0:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
#9の倍数か判定する
x=0
N=int(input("整数を入力:"))
#Nを桁ごとに分解
while(1==1):
    Nn=str(N/10)
    a=Nn.split(".")
    x+=int(a[1])
    N=int(a[0])
    if N==0:
        break
if x%9==0:
    print('Yes')
else:
    print('No')
Problem p02624 (python)

Fixed submission:
import numpy as np
n = int(input())
cnt = 0

for k in range(1,n+1):
    d = n//k
    if d == 1:
        cnt += (k+n)*(n-k+1)//2
        break
    cnt += k*d*(d+1)//2
print(cnt)

Buggy submission (verdict: Runtime Error):
n = int(input())
cnts = [k*d*(d+1)//2 for k in range(1,n//2)]
print(sum(cnts)+ (n//2)*d*(d+1)//2)
Problem p02695 (python)

Fixed submission:
import numpy as np
from itertools import combinations_with_replacement
 
n, m, q = map(int, input().split())
 
pt = np.array(list(combinations_with_replacement(range(1,m+1), n)))
score = np.zeros(len(pt))
 
for i in range(q):
    a, b, c, d =map(int, input().split())
    flg = pt[:,b-1] - pt[:,a-1] == c
    score += flg * d
#    print(score)
 
print(int(score.max()))

Buggy submission (verdict: Runtime Error):
m, n, q = map(int, input().split())
aa = [0]*q
bb = [0]*q
cc = [0]*q
dd = [0]*q
for i in range(q):
    aa[i],bb[i],cc[i], dd[i] = list(map(int, input().split()))
    
import itertools
ss = set(itertools.permutations([0]*(n-1)+[1]*(m-1)))
score = 0
for tu in ss:
    tmp = 0
    xx = [1]*n
    j = 0
    for t in tu:
        if t == 0:
            j += 1
        if t == 1:
            xx[j] += 1
    for i in range(q):
        if xx[bb[i]-1] - xx[aa[i]-1] ==cc[i]: 
            tmp += dd[i]
    score = max(score, tmp)
print(score)
Problem p02759 (python)

Fixed submission:
a = int(input())
print((a + 1)//2)

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

d = {}
ret = True
for i in range(m):
  a = input().split()
  s = int(a[0])
  c = int(a[1])
  if (d.get(s,-1) != -1) & (d.get(s,-1) != c):
    ret = False
  if (s == 1) & (c == 0):
    ret = False
  if s > n:
    ret = False
  d[s] = c

p = ""    
for i in range(1,n+1):
  if d.get(i,-1) == -1:
    if (i == 1) & (n >1):
      p += "1"
    else:
      p += "0"
  else:
    p += str(d[i])
if ret:
  print(p)
else:
  print("-1")
Problem p02771 (python)

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

if (a == b) and (b == c):
  print('No')
elif (a == b) or (b == c) or (a == c):
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
nums = [int(i) for i in input().split(" ")]

approved = True
for num in nums:
  if num%2 == 0:
    approved = (num%3 == 0) | (num%5 == 0)
if approved:
  print('APPROVED')
else:
  print('DENIED')

Buggy submission (verdict: Runtime Error):
n = int(input())
nums = [int(i) for i in input().split(" ")]

approved = True
for num in nums:
  if num%2 == 0:
    approved = (num%3 == 0) or (num%5 == 0)
if approved:
  print('APPROVED')
else:
  print('DENIED')

Buggy submission (verdict: Runtime Error):
n = int(input())
nums = [int(i) for i in input().split(" ")]

approved = True
for num in nums:
  if num%2 == 0:
    approved = (num%3 == 0) or (num%5 == 0)
if approved:
  print('APPROVED')
else:
  print('DENIED')

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if (a == b) and (b == c):
  print('No')
  return
elif (a == b) or (b == c):
  print('Yes')
  return
else:
  print('No')

Buggy submission (verdict: Runtime Error):
return 'No'
Problem p02773 (python)

Fixed submission:
n = int(input())
 
s = [str(input()) for i in range(n)]

set_key = list(set(s))
set_key.sort()
dic = dict(zip(set_key, [0]*len(set_key)))

for c in s:
  dic[c] += 1

n_max = max(dic.values())

for c in set_key:
  if dic[c] == n_max:
    print(c)

Buggy submission (verdict: Runtime Error):
n = int(input())
 
s = [str(input()) for i in range(n)]

set_key = set(s)
dic = dict(set_key, [0]*len(set_key))

for c in s:
  dic[c] += 1
  
n_max = max(dic.values())
str_argmax = dic.keys()[dic.values() == n_max]
str_argmax.sort()

for i in str_argmax:
  print(i)
Problem p02790 (python)

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

if M > N:
  body = N
  numm = M
else:
  body = M
  numm = N

ret = ''
for i in range(numm):
  ret += str(body)
print(ret)

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

if M > N:
  body = N
  numm = M
else:
  body = M
  numm = N

ret = ''
for i in numm:
  ret += str(body)
print(ret)
Problem p02984 (python)

Fixed submission:
n = int(input())
aa = list(map(int, input().split()))
total_odd = sum(aa[1::2])
total_eve = sum(aa[0::2])
tmp = total_eve - total_odd
print(tmp)
for i in range(1,n):
    tmp = 2*aa[i-1] - tmp
    print(tmp)

Buggy submission (verdict: Runtime Error):
l, r = map(int, input().split())
if r //2019 > l //2019:
    print(0)
else:
    res = 2018
    for i in range(l%2019, (r%2019)+1):
        for j in range(i+1, (r%2019)+1):
            res = min(res, (i*j)%2019)
    print(res)

Buggy submission (verdict: Runtime Error):
l, r = map(int, input().split())
if r //2019 > l //2019:
    print(0)
else:
    res = 2018
    for i in range(l%2019, (r+1)%2019):
        for j in range(i+1, (r+1)%2019):
            res = min(res, (i*j)%2019)
    print(res)
Problem p02594 (python)

Fixed submission:
a=int(input())

if(a>=30):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
X=map(int,input().split())

if(X>=30):
    print("Yes")
else:
    print("No")
Problem p02712 (python)

Fixed submission:
n=int(input())
ans=0
for i in range(n+1):
    if i%3!=0 and i%5!=0:
        ans+=i
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
ans=0
for i in range(n):
    if i%3!=0 and i%5=!=0:
        ans=ans+i
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
ans=0
for i in range(n):
    if i%3!=0 and i%5=!=0:
        ans+=i:
print(ans)
Problem p02723 (python)

Fixed submission:
s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
s=int(input())
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")
Problem p02766 (python)

Fixed submission:
n,k=map(int,input().split())
ans=0
while(n>0):
    n=n//k
    ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
n,k=map(int,input().split())
ans=0
while(n>0)
    n=n//k
    ans+=1
print(ans)
Problem p02777 (python)

Fixed submission:
s,t=input().split()
a,b=map(int,input().split())
u=input()
print(a-1,b) if s==u else print(a,b-1)

Buggy submission (verdict: Runtime Error):
s,t=input().split()
a,b=map(int.input().split())
u=input()
print(a-1,b) if s==u else print(a,b-1)

Buggy submission (verdict: Runtime Error):
s,t=input().split()
a,b=map(int.input().split())
u=input()
print(a-1,b) if s==i else print(a,b-1)
Problem p02970 (python)

Fixed submission:
import math 
n,d=map(int,input().split())
print(math.ceil(n/(d*2+1)))

Buggy submission (verdict: Runtime Error):
import math 
n,d=map(int,input().split())
print(math.ceil(n/(s*2+1)))
Problem p02729 (python)

Fixed submission:
n,m=map(int,input().split())
if n<=1 and m<=1:
  ans=0
if n<=1 and m>=2:
  ans=m*(m-1)//2
if m<=1 and n>=2:
  ans=n*(n-1)//2
if m>=2 and n>=2:
  ans= n*(n-1)//2+(m*(m-1)//2)
print(ans)

Buggy submission (verdict: Runtime Error):
n,m=map(int,input().split())
if n==1 and m==1:
  ans=0
if n==1 and m>=2:
  ans=m*(m-1)//2
if m==1 and n>=2:
  ans=n*(n-1)//2
if m>=2 and n>=2:
  ans= n*(n-1)//2+m*(m-1)//2
print(ans)
Problem p02771 (python)

Fixed submission:
a,b,c=input().split()
ans="Yes"
if a!=b and b!=c and c!=a:
  ans="No"
if a==b==c:
  ans="No"
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
ans="APPROVED"
for i in range (n):
  if a[i]%2==0:
    if a[i]%3!=0and a[i]%5!=0:
      ans="DENIED"
    else:
      ans="APRROVED"
    
print(ans)
Problem p02777 (python)

Fixed submission:
s,t=input().split()
a,b=map(int,input().split())
u=input()
print(a-1, b) if u==s else print(a, b-1)

Buggy submission (verdict: Runtime Error):
n=int(input())
a=set(map(int,input().split()))
print("YES") if len(a)==n else print("NO")

Buggy submission (verdict: Runtime Error):
n=int(input())
a=set(map(int,input().split()))
print("YES") if len(a)==n else print("No")

Buggy submission (verdict: Runtime Error):
s,t=input().split()
a,b=map(int,input().split())
u=input()
print(a-1 b if u==s else a b-1)

Buggy submission (verdict: Runtime Error):
s=input(),u=input()
a,b=map(int,input().split())
u=input()
print(a-1 b if s==u else a b-1)

Buggy submission (verdict: Runtime Error):
s=input() u=input()
a,b=map(int,input().split())
u=input()
print(a-1 b if s==u else a b-1)

Buggy submission (verdict: Runtime Error):
s,t=input().split()
a,b=map(int,input().split())
u=input()
print(a-1 b if s==u else a b-1)
Problem p02790 (python)

Fixed submission:
a, b = input().split()
 
print(min(a*int(b), b*int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b　=　input().split()
 
print(min(a*int(b),b*(int(a) ) )

Buggy submission (verdict: Runtime Error):
a, b=input().split()
 
print(min(a＊(int(b)),b＊(int(a) ) )

Buggy submission (verdict: Runtime Error):
a, b=input().split()
 
print(min(a*(int(b)),b*(int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b=input().split()
 
print(min(a＊int(b),b＊(int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b=input().split()
 
print(min(a＊int(b),b＊(int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b=input().split()
 
print(min(a*int(b),b*(int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b=input().split()

print(min(a*int(b),b*(int(a)))

Buggy submission (verdict: Runtime Error):
a,b=input().split()
print(min(a*int(b),b*(int(a)))

Buggy submission (verdict: Runtime Error):
a,b=input().split()
print( min(a*int(b), b*(int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b=input().split()
print( min (a*(int(b), b*(int(a) ) )

Buggy submission (verdict: Runtime Error):
a,b=input().split()
print(min(a*(int(b),b*(int(a)))))

Buggy submission (verdict: Runtime Error):
a,b=map(int.input().split())
print(b**a if b>=a else a**b)
Problem p02829 (python)

Fixed submission:
a=int(input())
b=int(input())
print(6-a-b)

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
print(6-(A+B))

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
print(6-(a+B))
Problem p02847 (python)

Fixed submission:
days=["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-days.index(input()))

Buggy submission (verdict: Runtime Error):
days=["SUN","MON","TUE","WED","THR","FRI","SAT"]
print(7-days.index(input()))
Problem p02859 (python)

Fixed submission:
A=int(input())
print(A**2)

Buggy submission (verdict: Runtime Error):
a=input()
print(a**2)
Problem p02595 (python)

Fixed submission:
import math
N, D = map(int, input().split()) #split()で空白区切り
count = 0
for i in range(N):
    x, y = map(int, input().split())
    if math.sqrt(x**2 + y**2) <= D:
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
import math
N = int(input())
x = int(input())
y = int(input())

D = int(input())
distance = math.sqrt(x**2 + y**2)

count = 0
for i in range(1, N+1):
    if distance <= D:
        count += 1

print(count)
Problem p03775 (python)

Fixed submission:
import math
N=int(input())
#考えるべき範囲
ans=11
#絶対ありえない数を定義しておく
for i in range(1,int(math.sqrt(N))+1):
    if N%i !=0:
        continue
    else:
        A=N//i
        A=str(A)
        i=str(i)
        F=max(len(A),len(i))
        if F<ans:
            ans=F

print(ans)

Buggy submission (verdict: Runtime Error):
import math
#N=int(input())
#考えるべき範囲
ans=11
#絶対ありえない数を定義しておく
for i in range(1,int(math.sqrt(N))+1):
    if N%i !=0:
        continue
    else:
        A=N//i
        A=str(A)
        i=str(i)
        F=max(len(A),len(i))
        if F<ans:
            ans=F

print(ans)