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

Fixed submission:
a=list(input())
if a[0]==a[1]==a[2] or a[1]==a[2]==a[3]:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a=list(int ,input().split())
if a[0]==a[1]==a[2] or a[1]==a[2]==a[3]:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c,d=list(int ,input().split())
if a==b==c or b==c==d:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int ,input().split())
if a==b==c or b==c==d:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int ,input().split())
if a==b==c or b==c==d or a==b==c==d:
  print("Yes")
else:
  print("No")
Problem p03547 (python)

Fixed submission:
x,y=map(str,input().split())
if int(x,16)>int(y,16):
  print(">")
elif int(x,16)==int(y,16):
  print("=")
else:
  print("<")

Buggy submission (verdict: Runtime Error):
x,y=map(str,input().split())
h =['A','B','C','D','E','F']
a=0
b=0
for v, i in enumerate(h):
  if x == v:
    a = i
  elif y ==v:
    b = i
if a<b:
  print('<')
elif a=b:
  print('=')
else:
  print('>')
Problem p03555 (python)

Fixed submission:
a = list(input())
b = list(input())
if a[0]==b[2] and a[1]==b[1] and a[2]==b[0]:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
c11,c12,c13 =map(str,input().split())
c21,c22,c23 =map(str,input().split())
if c11==c23 and c12==c22 and c13==c21:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
c_1 =map(str,input().split())
c_2 =map(str,input().split())
if c_1[0]==c_2[2] and c_1[1]==c_2[1] and c_1[2]==c_2[0]:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
c_1 =map(str,input().split())
c_2 =map(str,input().split())
if c_1[0]==c_2[2] 
and c_1[1]==c_2[1] 
and c_1[2]==c_2[0]:
  print("YES")
else:
  print("NO")
Problem p03587 (python)

Fixed submission:
a = input()
print(a.count("1"))

Buggy submission (verdict: Runtime Error):
a = int(input())
print(a.count(1))
Problem p03605 (python)

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

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

Fixed submission:
print("ABC" + str(input()) )

Buggy submission (verdict: Runtime Error):
print("ABC" + int(input()) )
Problem p03657 (python)

Fixed submission:
a,b=map(int,input().split())
if (a+b)%3==0 or a%3==0 or b%3==0:
  print("Possible")
else:
  print("Impossible")

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
if(a+b)%3:
  print(Impossible)
else:
  print(Possible)
Problem p03671 (python)

Fixed submission:
a,b,c= map(int,input().split())
print(min([a+b,b+c,c+a]))

Buggy submission (verdict: Runtime Error):
a= map(int,input().split())
l=a.sort()
print(l[0]+l[1])

Buggy submission (verdict: Runtime Error):
a= map(int,input().split())
l=sort(a)
print(l[0]+l[1])
Problem p03693 (python)

Fixed submission:
r,g,b=map(int,input().split())
if (10*g + b)%4:
  print("NO")
else:
  print("YES")

Buggy submission (verdict: Runtime Error):
r,g,b=map(int,input().split())
if (10*g + b)%4=0:
  print("YES")
else:
  print("NO")
Problem p03711 (python)

Fixed submission:
x,y=map(int,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]
if (x in a) and (y in a):
  print("Yes")
elif (x in b) and (y in b):
  print("Yes")
elif (x in c) and (y in c):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
x,y=map(int,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]
if x=2 or y=2:
  print("No")
if (x in a) and (y in a):
  print("Yes")
if (x in b) and (y in b):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
x,y=map(int,input().split())
a=[1,3,5,7,8,10,12]
b=[4,6,9,11]
c=[2]
if x=2 or y=2:
  print("No")
for v in a:
  if x=v:
    for w in a:
      if w =y:
        print("Yes")
for v in b:
  if x=v:
    for w in b:
      if w =y:
        print("Yes")
else:
  print("No")
Problem p03729 (python)

Fixed submission:
a,b,c = map(str,input().split())
if a[-1]==b[0] and b[-1]==c[0]:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
a,b,c = map(str,input().split())
if a[-1]=b[0] and b[-1]=c[0]:
  print('YES')
else:
  print('NO')
Problem p03737 (python)

Fixed submission:
a,b,c = map(str,input().split())
print((a[0]+b[0]+c[0]).upper())

Buggy submission (verdict: Runtime Error):
a,b,c = map(str,input().split())
print((a[0],b[0],c[0]).upper())
Problem p03759 (python)

Fixed submission:
a,b,c=map(int,input().split())
if b-a == c-b:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if b-a == c-b:
  print(YES)
else:
  print(NO)
Problem p03777 (python)

Fixed submission:
a,b = map(str,input().split())
if a=='H' and b == 'H':
  print('H')
if a=='D' and b == 'H':
  print('D')
if a=='H' and b == 'D':
  print('D')
if a=='D' and b == 'D':
  print('H')

Buggy submission (verdict: Runtime Error):
a,b = map(str,input().split())
if a='H' and b = 'H':
  print('H')
if a='D' and b = 'H':
  print('D')
if a='H' and b = 'D':
  print('D')
if a='D' and b = 'D':
  print('H')
Problem p03852 (python)

Fixed submission:
c = input()
if c in 'aeiou':
  print('vowel')
else:
  print('consonant')

Buggy submission (verdict: Runtime Error):
c = input()
if v,c in 'aeiou':
  print(vowel)
else:
  print(consonant)

Buggy submission (verdict: Runtime Error):
c = input()
if c in 'aeiou':
  print(vowel)
else:
  print(consonant)

Buggy submission (verdict: Runtime Error):
s =input()
v = ['a','e','i','o','u']
for i in v:
  if s = i:
    print(vowel)
  else:
    print(consonant
Problem p03919 (python)

Fixed submission:
H, W = map(int, input().split())
S = [list(input().split()) for _ in range(H)]
for i in range(H):
    for j in range(W):
        if S[i][j] == 'snuke':
            print(chr(ord('A') + j) + str(1 + i))
            break

Buggy submission (verdict: Runtime Error):
h,w = map(int,input(),split())
for i in range(h):
    a = input().split()
    if "snuke" in a:
        ans = chr(ord('A') + j)+str(i)

print(ans)

Buggy submission (verdict: Runtime Error):
h,w = map(int,input(),split())
for i in range(h):
    a = input().split()
    for j in range(w):
        if a[j] == "snuke":
            ans = chr(ord('A') + j)+str(i)

print(ans)

Buggy submission (verdict: Runtime Error):
h,w = map(int,input(),split())
for i in range(h):
    a = input().split()
    for j in range(w):
        if a[j] == "snuke":
            print(chr(ord('A') + j)+str(i))
            break
Problem p03943 (python)

Fixed submission:
a,b,c = map(int,input().split())
if a + b == c or b + c == a or c + a == b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a + b = c or b + c = a or c + a = b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if (a + b + c)%2=0:
  print(Yes)
else:
  print(No)
Problem p03957 (python)

Fixed submission:
s= input()
a=-1
b=-1
for i in range(len(s)):
  if s[i]=='C':
    a = i
  elif s[i]=='F':
    b = i
if a>=0and a<b:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
s= input()
a=0
b=0
for i in range(len(s)):
  if s[i]=='C':
    a += i
  elif s[i]=='F':
    b += i
if a,b!=0 and a<b:
  print("Yes")
else:
  print("No")
Problem p03962 (python)

Fixed submission:
p = list(map(int,input().split()))
if p[0] != p[1] and p[1] != p[2] and p[2] != p[0]:
  print(3)
elif p[0] == p[1] == p[2]:
  print(1)
else:
  print(2)

Buggy submission (verdict: Runtime Error):
p = list(map(int,input()split()))
if p[0] != p[1] and p[1] != p[2] and p[2] != p[0]:
  print(3)
elif p[0] == p[1] == p[2]:
  print(1)
else:
  print(2)

Buggy submission (verdict: Runtime Error):
p = list(map(int,input()split()))
if p[0] != p[1] and p[1] != p[2] and p[2] != p[0]:
  print(3)
elif p[0] = p[1] and p[1] = p[2]:
  print(1)
else:
  print(2)

Buggy submission (verdict: Runtime Error):
p = list(map(int,input()split()))
if (p[1] = p[2] and p[0]!=p[1])or(p[0]=p[1]and p[1]!=p[2])or(p[0]=p[2] and p[0]!=p[1]):
  print("2")
if p[0]!=p[1] and p[0]!=p[2]:
  print("3")
else:
  print("1")
Problem p03970 (python)

Fixed submission:
s= input()
ss ="CODEFESTIVAL2016"
t = 0
for i in range(len(ss)):
  if s[i]!=ss[i]:
    t +=1
print(t)

Buggy submission (verdict: Runtime Error):
s= input()
ss ="CODEFESTIVAL2016"
t = 1
for i in range(ss):
  if s[i]!=ss[i]:
    t +=1
print(t)

Buggy submission (verdict: Runtime Error):
s= input()
ss ="CODEFESTIVAL2016"
t = 1
for i in range(s):
  if s[i]==ss[i]:
    t +=1
print(t)

Buggy submission (verdict: Runtime Error):
s= input()
ss =‘CODEFESTIVAL2016’
t = 1
for i in range(s):
  if s[i]==ss[i]:
    t +=1
print(t)
Problem p03997 (python)

Fixed submission:
a = int(input())
b = int(input())
h = int(input())
s = (a+b)*h/2
print(int(s))

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
h = int(input())
s == (a+b)*h/2
print(s)
Problem p04043 (python)

Fixed submission:
a = list(map(int,input().split()))
b = 0
c = 0
for i in a:
  if i == 7:
    b += 1
  elif i == 5:
    c += 1
 
if b == 1 and c == 2:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a = list(map(int,input().split()))
b = 0
c = 0
for i in a:
  if i == 5:
    b = b + 1
  if i == 7:
    c = c+1
if b ==2 and c==1:
  print(YES)
else:
  print(NO)

Buggy submission (verdict: Runtime Error):
a = list(map(int,input().split()))
b = 0
c = 0
for i in range(len(a)):
  if a[i] == 5:
    b = b + 1
  if a[i] == 7:
    c = c+1
if b ==2 and c==1:
  print(YES)
else:
  print(NO)

Buggy submission (verdict: Runtime Error):
a = input().split()
x =0
y =0
for i in range(len(a)):
  if len(a[i]) = 5:
    x = x+1
  if len(a[i]) = 7:
    y = y+1
if x =2 and y=1:
  print(YES)
else:
  print(NO)

Buggy submission (verdict: Runtime Error):
l =input().split()
a=0
b=0
for i in range(0,2):
  if len(i) = 5:
    a = a+1
  if len(i) = 7:
    b = b+1
if a=2 and b=1:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
l =input().split()
for i in range(0,2):
  a=0
  b=0
  if len(i) = 5:
    a = a+1
  if len(i) = 7:
    b = b+1
if a=2 and b=1:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
l =input().split()
for i in range(len(l)-1):
  a=0
  b=0
  if len(i) = 5:
    a = a+1
  if len(i) = 7:
    b = b+1
if a=2 and b=1:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c =input().split()
if len(a)*len(b)*len(c) =175:
  print("YES")
else:
  print("NO")

Buggy submission (verdict: Runtime Error):
a,b,c =map(int,input().split())
if a*b*c = 175:
  print("YES")
else:
  print("NO")
Problem p02698 (python)

Fixed submission:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
from bisect import bisect_left
 
N = int(input())
a = [int(i) for i in input().split()]
vec = [[] for _ in range(N)]
for _ in range(N - 1) :
  u, v = map(int, input().split())
  vec[u - 1].append(v - 1)
  vec[v - 1].append(u - 1)
 
lis = [a[0]]
ret = [0] * N
def dfs(cur, pre) :
  for nex in vec[cur] :
    if nex == pre : continue
    if a[nex] > lis[-1] :
      lis.append(a[nex])
      ret[nex] = len(lis)
      dfs(nex, cur)
      lis.pop()
    else :
      pos = bisect_left(lis, a[nex])
      v = lis[pos]
      lis[pos] = a[nex]
      ret[nex] = len(lis)
      dfs(nex, cur)
      lis[pos] = v
 
dfs(0, -1)
 
ret[0] = 1
for i in range(N) :
  print(ret[i])

Buggy submission (verdict: Runtime Error):
#!/usr/bin/python3

import sys
import resource

sys.setrecursionlimit(1000000)
resource.setrlimit(resource.RLIMIT_STACK, (-1, -1))

def getmlen(cur, p, n, a, mlen, st, dp, nbs):
    ca = a[cur]
    
    for i in range(n):
        if dp[i] > ca:
            st.append((i, dp[i], ca))
            dp[i] = ca
            mlen[cur] = i + 1
            break

    for ch in nbs[cur]:
        if ch == p:
            continue

        getmlen(ch, cur, n, a, mlen, st, dp, nbs)

    (idx, ov, nv) = st.pop()
    dp[idx] = ov
    return


n = int(input())
a = tuple(map(int, input().split()))

nbs = [ [] for i in range(n) ]

for i in range(n - 1):
    (u, v) = map(int, input().split())
    nbs[u - 1].append(v - 1)
    nbs[v - 1].append(u - 1)


mlen = [ 0 for i in range(n) ]
st = []
dp = [ float('inf') for i in range(n) ]

getmlen(0, -1, n, a, mlen, st, dp, nbs)

for i in range(n):
    print(mlen[i])
Problem p02724 (python)

Fixed submission:
inp = input()
inp = int(float(inp))
aaa = 0
bbb = 0
yyy = 0

if 0 < inp and inp <= 10**9:
  if 500 <= inp:
    big = inp // 500
    aaa = big * 1000
    amari = inp % 500
    if 5 <= amari:
      smo = amari //5
      bbb = smo *5
    print(aaa+bbb)
  elif 5 <= inp:
    hhh = inp // 5
    yyy = hhh * 5
    print(yyy)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
inp = input()
inp = int(float(inp))
aaa = 0
bbb = 0
yyy = 0

if 0 <= inp and inp <= 10**9:
  if 500 <= inp:
    big = inp // 500
    aaa = big * 1000
    amari = inp % 500
    if 5 <= amari:
      smo = amari //5
      bbb = smo *5
    print(aaa+bbb)
  else if 5 <= inp:
    hhh = inp // 5
    yyy = hhh * 5
    print(yyy)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
inp = int(input())
aaa =0
bbb =0
nega = 0

if 0 <= inp and inp <= 10**9:
  if 500 <= inp:
    big = int(inp / 500)
    
    sma = inp-(big *500)
    if 5 <= sma:
      nega = int(sma / 5)
      
  aaa = 1000*big
  bbb = 5*nega
  print(aaa + bbb)
Problem p02677 (python)

Fixed submission:
import math
t = input().split()
t = [int(i) for i in t]
r = math.sqrt(t[0]*t[0]+ t[1]*t[1])
h = t[2]
m = t[3]
if (h == 12):
    h = 0
if (m == 60):
    m = 0
hour_angle = 0.5 * (h * 60 + m) 
minute_angle = 6 * m 
angle = abs(hour_angle - minute_angle) 
angle = min(360 - angle, angle)
print(math.sqrt(r*r - 2*t[0]*t[1]*math.cos(angle*(2*math.pi/360))))

Buggy submission (verdict: Runtime Error):
import math
t = input().split()
t = [int(i) for i in t]
r = math.sqrt(t[0]*t[0]+ t[1]*t[1])
h = t[2]
m = t[3]
if (h == 12):
    h = 0
if (m == 60):
    m = 0
hour_angle = 0.5 * (h * 60 + m) 
minute_angle = 6 * m 
angle = abs(hour_angle - minute_angle) 
angle = min(360 - angle, angle)
print(math.sqrt(r*r - 2*t[0]*t[1]*math.cos(angle(2*math.pi/360))))

Buggy submission (verdict: Runtime Error):
mport math
t = input().split()
t = [int(i) for i in t]
r = math.sqrt(t[0]*t[0]+ t[1]*t[1])
h = t[2]
m = t[3]
if (h == 12):
    h = 0
if (m == 60):
    m = 0
hour_angle = 0.5 * (h * 60 + m) 
minute_angle = 6 * m 
angle = abs(hour_angle - minute_angle) 
angle = min(360 - angle, angle)
print(math.sqrt(r*r - 2*t[0]*t[1]*math.cos(angle(2*math.pi/360))))
Problem p02981 (python)

Fixed submission:
N, A, B = list(map(int, input().split()))
 
total_cost = N * A
 
if total_cost > B:
  total_cost = B
  
print(total_cost)

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

total_cost = N * A

if total_cost > B:
  total_cost = B
  
print(total_cost)
Problem p02993 (python)

Fixed submission:
password = input()

result = 'Good'

for i in range(len(password)-1):
    if password[i] == password[i+1]:
      result = 'Bad'
      break
      
print(result)

Buggy submission (verdict: Runtime Error):
password = input()

result = 'Good'

for i in range(len(password)-1):
  ):
    if password[i] == password[i+1]:
      result = 'Bad'
      break
      
print(result)
Problem p03059 (python)

Fixed submission:
# coding:UTF-8

# 入力値の受け取り
input_list = input().split()

num_A = int(input_list[0])
num_B = int(input_list[1])
num_T = int(input_list[2])

# 合計枚数の算出
output_answer = int((num_T + 0.5) // num_A * num_B)
print(output_answer)

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

# 入力値の受け取り
'''
input_list[0]→A
input_list[1]→B
input_list[2]→T
'''
input_list = input().split()

# 合計枚数の算出
print((input_list[2] + 0.5) // input_list[0] * input_list[1])
Problem p03071 (python)

Fixed submission:
# coding:UTF-8

# ２つのボタンのコイン獲得枚数を取得
buttons = list(map(int, input().split()))

# 最大獲得コイン取得用領域
max_coin = 0

for _ in range(2):
    if buttons[0] > buttons[1]:
        max_coin += buttons[0]
        buttons[0] -= 1
    else:
        max_coin += buttons[1]
        buttons[1] -= 1

# 結果出力
print(max_coin)

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

# ２つのボタンのコイン獲得枚数を取得
buttons = list(map(int, input().split()))

# 最大獲得コイン取得用領域
max_coin = 0

for _ in range(2):
  if buttons[0] > buttons[1]:
    max_coin += buttons[0]
    button[0] -= 1
  else:
    max_coin += button[1]
    buttons[1] -= 1
    
# 結果出力
print(max_coin)
Problem p02717 (python)

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

print(l[2],l[0],l[1])

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

print(l[2],l[0],l[1])
Problem p02719 (python)

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

N = N % K

if K - N > N:
  print(N)
  exit()
print(K - N)

Buggy submission (verdict: Runtime Error):
1000000000000000000 1
Problem p02927 (python)

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

if D < 22:
  print("0")
  exit()

count = 0

for m in range(1,M+1):
  for d in range(22,D+1):
    if int(str(d)[1]) < 2:
      continue
    if int(str(d)[0]) * int(str(d)[1]) == m:
      count += 1
print(count)

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

if D < 22:
  print("0")
  exit()

count = 0
  
for m in range(1,M+1):
  for d in range(22,N+1):
    if int(str(d)[1]) < 2:
      continue
   	if int(str(d)[0]) * int(str(d)[1]) == m:
      count += 1
print(count)
Problem p02945 (python)

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

l = [a+b,a-b,a*b]

print(max(l))

Buggy submission (verdict: Runtime Error):
from collections import Counter
n = int(input())

sn = []
count = 0

for i in range(n):
  sn.append(sorted(Counter(list(input())).items()))


for i in range(n - 1):
  for j in range(i+1,n):
    if sn[i] == sn[j]:
      count += 1
print(count)
Problem p02952 (python)

Fixed submission:
n = input()

count = 0

l = len(n)

if l % 2:
  num = n[0:l]
  tmp = 1
  for i in range(l-1):
    tmp *= 10
  count += int(num) - tmp + 1
  l -= 1

for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= int(float(tmp) / float(10))
    count += tmp
    
print(count)

Buggy submission (verdict: Runtime Error):
n = input()

count = 0

l = len(n)

if l % 2:
  num = n[1:l]
  count += int(num) + 1
  l -= 1

for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= int(float(tmp) / float(10))
    count += tmp
    
print(count)

Buggy submission (verdict: Runtime Error):
n = input()

count = 0

l = len(n)


if l % 2:
  num = n[1:l]
  count += int(num) + 1
  l -= 1

for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= float(tmp) / float(10)
    count += tmp
    
print(int(count))

Buggy submission (verdict: Runtime Error):
n = input()

count = 0

l = len(n)

#kisu
if l % 2:
  num = n[1:l]
  count += int(num) + 1
  l -= 1
#gusu
for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= float(tmp) / float(10)
    count += tmp
    
print(int(count))

Buggy submission (verdict: Runtime Error):
n = input()

count = 0

l = len(n)

#kisu
if l % 2:
  num = n[1:l]
  count += int(num) + 1
  l -= 1
#gusu
for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= tmp / 10
    count += tmp
    
print(int(count))

Buggy submission (verdict: Runtime Error):
n = input()

count = 0

l = len(n)

#kisu
if l % 2:
  num = n[1:l]
  count += int(num) + 1
  l -= 1
#gusu
for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= int(tmp / 10)
    count += tmp
    
print(count)

Buggy submission (verdict: Runtime Error):
n = input()

count = 0

l = len(n)

#kisu
if l % 2:
  num = n[1:l]
  count += int(num) + 1
  l -= 1
#gusu
for i in range(l):
  tmp = 1
  if (i+1) % 2:
    for j in range(i+1):
      tmp *= 10
    tmp -= int(tmp / 10)
    count += tmp
    
print(count)
Problem p02866 (python)

Fixed submission:
n=int(input())
d=list(map(int,input().split()))
ans=1
a=1
b=1
if n==1 or d[0]!=0:
    ans=0
d=sorted(d)
for j in range(0,n-1):
        if d[j+1]-d[j]>1:
            ans=0
            break
        
if d[0]!=0 or d[1]==0:
    ans=0
else:
    for i in range(1,n-1):
        if d[i]==d[i+1]:
            a+=1
        else:
            ans=ans*(b**a)
            b=a
            a=1
ans=ans*(b**a)
ans=ans%998244353
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
d=list(map(int,input().split()))
ans=1
a=1
b=1
d=sorted(d)
if d[0]!=0 or d[1]==0:
    ans=0
else:
    if d[-1]==d[-2]:
        for i in range(1,n-1):
            if d[i]==d[i+1]:
                a+=1
            else:
                ans=ans*(b**a)
                b=a
                a=1
    else:
        for j in range(1,n-1):
            if d[i]==d[i+1]:
                a+=1
            else:
                ans=ans*(b**a)
                b=a
                a=1
            ans=ans*b
ans=ans%998244353
print(ans)
Problem p02885 (python)

Fixed submission:
a,b=list(map(int,input().split()))
if a<=b*2:
  print(0)
else:
  print(a-b*2)

Buggy submission (verdict: Runtime Error):
a,b=list(map(int,input().split()))
if a<=b*2:
  print 0
else:
  print a-b*2
Problem p02899 (python)

Fixed submission:
N=int(input())
stu=list(map(int,input().split()))
stu2=list(range(N))
for i in range(N):
    stu2[stu[i]-1]=i+1
print(*stu2,end=' ')

Buggy submission (verdict: Runtime Error):
N=input()
stu=list(map(int,input().split()))
stu2=list(range(8))
for i in range(N):
  for j in range(N):
    if stu[i]==j:
      stu2[j-1]=i+1
print(stu2)

Buggy submission (verdict: Runtime Error):
N=input()
stu=list(map(int,input().split()))
lis=[x for x in range(N)]
for i in range(N):
  for j in range(N):
    if stu[i]==j:
      lis[j-1]=i+1
print(lis)
Problem p02909 (python)

Fixed submission:
S=input('')
if S=='Sunny':
  print('Cloudy')
elif S=='Cloudy':
  print('Rainy')
else:
  print('Sunny')

Buggy submission (verdict: Runtime Error):
S=input('')
if S='Sunny':
  print('Cloudy')
elif S='Cloudy':
  print('Rainy')
else:
  print('Sunny')
Problem p02910 (python)

Fixed submission:
S=input()
ans='Yes'

for i in range(0,int(len(S))):
  if i%2==0:
    if S[i]=='L':
        ans='No'
        break
  elif i%2==1:
    if S[i]=='R':
        ans='No'
        break
print(ans)

Buggy submission (verdict: Runtime Error):
S=input()
for i in range(0,int(len(S)):
  if S[2*i]!='L' and S[2*i+1]!='R':
    print('Yes')
  else:
    print('No')

Buggy submission (verdict: Runtime Error):
S=input()
for i in range(int(S)):
  if S[2i]!='L' and S[2i+1]!='R':
    print('Yes')
  else:
    print('No')
Problem p02921 (python)

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

Buggy submission (verdict: Runtime Error):
S,T=input()
for i in range(0,len(S)):
  cr=0
  if S[i]==T[i]:
    cr+=1
print(cr)

Buggy submission (verdict: Runtime Error):
S,T=input().split()
for i in range(0,len(S)):
  cr=0
  if S[i]==T[i]:
    cr+=1
print(cr)
Problem p02934 (python)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
re=0
for i in range(N):
  re+=1/A[i]
print(1/re)

Buggy submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
re=0
for i in A:
  re+=1/A[i]
print(1/re)
Problem p02945 (python)

Fixed submission:
A,B=list(map(int,input().split()))
print(max(A+B,A-B,A*B))

Buggy submission (verdict: Runtime Error):
A,B=int(input()),int(input())
print(max[A+B,A-B,A*B])