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

Fixed submission:
# https://atcoder.jp/contests/abc063/tasks/arc075_b
import sys
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
import math
sys.setrecursionlimit(12345678)


def can_delete(ml, t, a, b):
    for i in range(len(ml)):
        ml[i] -= (b * t)

    count = 0
    for m in ml:
        if m > 0:
            count += math.ceil(m/(a-b))

    return t >= count


def main():
    n, a, b = map(int, input().split())
    monsters = []
    for _ in range(n):
        monsters.append(int(input()))

    l = 0
    r = 10**9
    while l < r:
        m = (l + r) // 2
        if can_delete(monsters.copy(), m, a, b):
            r = m
        else:
            l = m + 1

    print(r)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# https://atcoder.jp/contests/abc063/tasks/arc075_b
import sys
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
import math
sys.setrecursionlimit(12345678)


def can_delete(ml, t, a, b):
    for i in range(len(ml)):
        ml[i] -= (b * t)

    count = 0
    for m in ml:
        if m > 0:
            count += math.ceil(m/(a-b))

    return t >= count


def main():
    n, a, b = map(int, input().split())
    monsters = []
    for _ in range(n):
        monsters.append(int(input()))

    l = 0
    r = 10**9
    while l < r:
        m = (l + r) // 2
        if can_delete(monsters.copy(), m, a, b):
            r = m
        else:
            l = m + 1

    print(r)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# https://atcoder.jp/contests/abc063/tasks/arc075_b
import sys
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
import math
sys.setrecursionlimit(12345678)


def can_delete(ml, t, a, b):
    for i in range(len(ml)):
        ml[i] -= (b * t)

    count = 0
    for m in ml:
        if m > 0:
            count += math.ceil(m/(a-b))

    return t >= count


def main():
    n, a, b = map(int, input().split())
    monsters = []
    for _ in range(n):
        monsters.append(int(input()))

    l = 0
    r = 10**9
    while l < r:
        m = (l + r) // 2
        if can_delete(monsters.copy(), m, a, b):
            r = m
        else:
            l = m + 1

    print(r)


if __name__ == '__main__':
    main()
Problem p03729 (python)

Fixed submission:
# https://atcoder.jp/contests/abc060/tasks/abc060_a

import itertools
import collections
import bisect

def main():
    A, B, C = input().split()
    print('YES' if A[-1] == B[0] and B[-1] == C[0] else 'NO')

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
# https://atcoder.jp/contests/abc060/tasks/abc060_a

import itertools
import collections
import bisect

def main():
    A, B, C = map(int, input().split())
    print('YES' if A[-1] == B[0] and B[-1] == C[0] else 'NO')

if __name__ == '__main__':
    main()
Problem p03854 (python)

Fixed submission:
S = input()

S = S[::-1]

dream = "maerd"
dreamer = "remaerd"
erase = "esare"
eraser = "resare"

if len(S) > 0:
    while len(S) > 0:
        if S.startswith(dream):
            S = S[len(dream):]
        elif S.startswith(dreamer):
            S = S[len(dreamer):]
        elif S.startswith(erase):
            S = S[len(erase):]
        elif S.startswith(eraser):
            S = S[len(eraser):]
        else:
            break
    if len(S) > 0:
        print("NO")
    else:
        print("YES")

else:
    print("NO")

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


def is_composable(s):
    if len(s) == 0:
        return True

    if s.startswith("dreamer"):
        dream_s = s[5:]
        dreamer_s = s[7:]
        return is_composable(dream_s) or is_composable(dreamer_s)
    elif s.startswith("dream"):
        dream_s = s[5:]
        return is_composable(dream_s)
    elif s.startswith("eraser"):
        erase_s = s[5:]
        eraser_s = s[6:]
        return is_composable(erase_s) or is_composable(eraser_s)
    elif s.startswith("erase"):
        erase_s = s[5:]
        return is_composable(erase_s)
    else:
        return False


if len(S) > 0 and is_composable(S):
    print("YES")
else:
    print("NO")

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


def is_composable(s):
    if len(s) == 0:
        return True

    if s.startswith("dreamer"):
        dream_s = s[5:]
        dreamer_s = s[7:]
        return is_composable(dream_s) or is_composable(dreamer_s)
    elif s.startswith("dream"):
        dream_s = s[5:]
        return is_composable(dream_s)
    elif s.startswith("eraser"):
        erase_s = s[5:]
        eraser_s = s[6:]
        return is_composable(erase_s) or is_composable(eraser_s)
    elif S.startswith("erase"):
        erase_s = s[5:]
        return is_composable(erase_s)
    else:
        return False


if len(S) > 0 and is_composable(S):
    print("YES")
else:
    print("NO")
Problem p02765 (python)

Fixed submission:
x,y = map(int,input().split())
if x >= 10:
	print(y)  
else:
	print(y+(100*(10-x)))

Buggy submission (verdict: Runtime Error):
import math
x,y = map(int,input().split())
print(math.ceil(x/y))

Buggy submission (verdict: Runtime Error):
x,y = map(int,input().split())
if x => 10:
	print(y)  
else:
	print(y+(100*(10-x)))

Buggy submission (verdict: Runtime Error):
x,y = map(int,input(),split())
print(y+100*(10-x))
Problem p02765 (python)

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

if a>=10:
    print(b)
else:
    print(b+100*(10-a))

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

if a>=10:
    print(b)
else:
    print(b+100*(10-a))

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

if a>=10:
    print(b)
else:
    print(b+100*(10-a))
Problem p02767 (python)

Fixed submission:
N = int(input())
List = [int(i) for i in input().split()]


ans = 10**18
def rally(p):
    n = 0
    for a in range(N):
        n += (int(p)-List[a])**2
    return n

for i in range(1,101):
    ans = min(rally(i),ans)

print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
List = [input().split()]


ans = 10**18
def rally(p):
    n = 0
    for a in range(N):
        n += (p-List[a])**2
    return n

for i in range(1,101):
    ans = min(rally(i),ans)

print(ans)

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

N = 7
List = [14,14,2,13,56,2,37]

ans = 10**18
def rally(p):
    n = 0
    for a in range(N):
        n += (p-List[a])**2
    return n

for i in range(1,101):
    ans = min(rally(i),ans)

print(ans)

Buggy submission (verdict: Runtime Error):
N = input()
List = [int(i) for i in input().split()]



ans = 10**18
def rally(p):
    n = 0
    for a in range(N):
        n += (p-List[a])**2
    return n

for i in range(1,101):
    ans = min(rally(i),ans)

print(ans)
Problem p02772 (python)

Fixed submission:
n = int(input())
list = [int(i) for i in input().split()]

for i in range(n):
    if list[i] %2 == 0:
        if list[i]%3 == 0 or list[i] %5 == 0:
            continue
        else:
            print("DENIED")
            break
else:
    print("APPROVED")

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

for i in range(n):
    if list[i] %2 == 0:
        if list[i]%3 == 0 or list[i] %5 == 0:
            continue
        else:
            print("DENIED")
            break
else:
    print("APPROVED")
Problem p02924 (python)

Fixed submission:
import sys
def input():
    return sys.stdin.readline()[:-1]

N = int(input())
total = sum(range(1, N))
  
print(total)

Buggy submission (verdict: Runtime Error):
import numpy as np
N = int(input())
print(np.sum(np.arange(1, N, dtype='int32')))

Buggy submission (verdict: Runtime Error):
import numpy as np
N = int(input())
ar = np.arange(1, N)
total = np.sum(ar)
print(total)

Buggy submission (verdict: Runtime Error):
import numpy as np
N = int(input())
ar = np.arange(1, N)
total = np.sum(ar)
print(total)
Problem p02971 (python)

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

sort = sorted(a)
m1 = sort[-1]
m2 = sort[-2]
if m1 == m2:
  for i in range(N):
    print(m1)
else:
  j = a.index(m1)
  for i in range(N):
    if i == j:
      print(m2)
    else:
      print(m1)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = []
for i in range(N):
  a.append(int(input()))

for i in range(N):
  b = a[:]
  b.pop(i)
  print(max(b)
Problem p03101 (python)

Fixed submission:
H, W = map(int, input().split())
h, w = map(int, input().split())
a = (H-h) * (W-w)
print(a)

Buggy submission (verdict: Runtime Error):
H=int(input())
W=int(input())
h=int(input())
w=int(input())

a = (H-h) * (W-w)
print(a)
Problem p03160 (python)

Fixed submission:
N=int(input())
h=[0 for i in range(N+1)]
h=list(map(int,input().split()))
dp=[0 for i in range(N+1)]
for i in range(1,N):
  if(i==1):
    dp[i]=dp[i]+abs(h[i]-h[i-1])
  else:
    dp[i]=min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print(dp[N-1])

Buggy submission (verdict: Runtime Error):
N=int(input())
h=[0 for i in n+1]
h=list(map(int,input().split()))

Buggy submission (verdict: Runtime Error):
N=int(input())
h=[0 for i in n+1]
h=map(int,input().split())
Problem p03162 (python)

Fixed submission:
N=int(input())
a,b,c=map(int,input().split())
dp=[[0 for i in range(3)]for j in range(N)]
dp[0]=[a,b,c]
for i in range(1,N):
  A,B,C=map(int,input().split())
  dp[i]=[max(dp[i-1][1]+A,dp[i-1][2]+A),max(dp[i-1][0]+B,dp[i-1][2]+B),max(dp[i-1][0]+C,dp[i-1][1]+C)]
print(max(dp[N-1][0],dp[N-1][1],dp[N-1][2]))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=[]
B=[]
C=[]
for i in range(N):
  a,b,c=map(int,input().split())
  A.append(a)
  B.append(b)
  C.append(c)
dp=[[0 for i in range(N)]for j in range(N)]
dp[0][0]=A[0]
dp[0][1]=B[0]
dp[0][2]=C[0]
for i in range(1,N):
  dp[i]=[max(dp[i-1][1]+A[i],dp[i-1][2]+A[i]),max(dp[i-1][0]+B[i],dp[i-1][2]+B[i]),max(dp[i-1][0]+C[i],dp[i-1][1]+C[i])]
print(max(dp[N-1][0],dp[N-1][1],dp[N-1][2]))

Buggy submission (verdict: Runtime Error):
N=int(input())
A=[]
B=[]
C=[]
for i in range(N):
  a,b,c=map(int,input().split())
  A.append(a)
  B.append(b)
  C.append(c)
dp=[[0 for i in range(N)]for j in range(N)]
dp[0][0]=A[0]
dp[0][1]=B[0]
dp[0][2]=C[0]
for i in range(1,N):
  dp[i]=[max(dp[i-1][1]+A[i],dp[i-1][2]+A[i]),max(dp[i-1][0]+B[i],dp[i-1][2]+B[i]),max(dp[i-1][0]+C[i],dp[i-1][1]+C[i])]
print(max(dp[N-1][0],dp[N-1][1],dp[N-1][2]))
Problem p04043 (python)

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 submission (verdict: Runtime Error):
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)
Problem p02778 (python)

Fixed submission:
l = len(input())
out = "x"*l
print(out)

Buggy submission (verdict: Runtime Error):
l = len(input())
out = "x"*l
peint(out)
Problem p02765 (python)

Fixed submission:
i = list(map(int, input().split()))
N = i[0]
R = i[1]

if N >= 10:
    insc = R
else:
    insc = R + 100*(10-N)

print(insc)

Buggy submission (verdict: Runtime Error):
i = list(map(int, input().split()))
N = i[0]
R = i[1]

if N >= 10:
    insc = R
else:
    insc = R + 100(10-N)

print(insc)
Problem p02761 (python)

Fixed submission:
n,m = map(int,input().split())
#10進数でちょうどn桁
defs = [tuple(map(int,input().split())) for _ in range(m)]

is_empty = False
jouken = {}

for i in range(n):
    #i桁目で条件に重複がないか見る
    dd = list(set([d[1] for d in defs if d[0]-1 == i]))
    if len(dd) > 1:
        is_empty = True
        break
    elif len(dd) == 1:
        jouken[i] = dd[0] #i桁目の数が決まる

num = [0]*n

if n == 1:
    if 0 in jouken:
        num[0] = jouken[0]
    else:
        num[0] = 0
else:
    if 0 in jouken:
        if jouken[0] == 0:
            is_empty = True
        else:
            num[0] = jouken[0]
    else:
        num[0] = 1
    for i in range(1,n):
        if i in jouken:
            num[i] = jouken[i]
        else:
            num[i] = 0

num = [str(i) for i in num]

if is_empty:
    print(-1)
else:
    print(''.join(num))

Buggy submission (verdict: Runtime Error):
n,m = map(int,input().split())
#10進数でちょうどn桁
defs = [tuple(map(int,input().split())) for _ in range(m)]

is_empty = False
jouken = {}

for i in range(n):
    #i桁目で条件に重複がないか見る
    dd = list(set([d[1] for d in defs if d[0]-1 == i]))
    if len(dd) > 1:
        is_empty = True
        break
    elif len(dd) == 1:
        jouken[i] = dd[0] #i桁目の数が決まる

num = [0]*n

if n == 1:
    print(jouken[0])
else:
    if 0 in jouken:
        if jouken[0] == 0:
            is_empty = True
        else:
            num[0] = jouken[0]
    else:
        num[0] == 1
    for i in range(1,len(num)):
        if i in jouken:
            num[i] = jouken[i]
        else:
            num[i] = 0

num = [str(i) for i in num]

if is_empty:
    print(-1)
else:
    print(''.join(num))
Problem p02802 (python)

Fixed submission:
N,M = map(int,input().split())
p_s = [tuple(input().split()) for _ in range(M)]

wa_total = [0]*N
wa_count = [0]*N 
ac_flg = [False]*N

for p,s in p_s:
    p = int(p)-1
    if not ac_flg[p]:
        if s == 'AC':
            ac_flg[p] = True
            wa_count[p] = wa_total[p]
        else:
            wa_total[p] += 1

print(ac_flg.count(True),sum(wa_count))

Buggy submission (verdict: Runtime Error):
N,M = map(int,input().split())
p_s = [tuple(input().split()) for _ in range(M)]

wa_score = [0]*N
ac_flg = [0]*N

for p,s in p_s:
    p = int(p)
    if s == 'AC':
        ac_flg[p-1] = 1
    else:
        if ac_flg[p-1] == 0:
            wa_score[p-1] += 1

ac_count = sum(ac_flg)
wa_count = 0
for i in ac_flg:
    if i == 1:
        wa_count += wa_score[i]

print(ac_count,wa_count)
Problem p02982 (python)

Fixed submission:
import numpy as np

n, _ = map(int, input().split())
x = np.array([[int(i) for i in input().split()] for _ in range(n)])

c = [1 if np.linalg.norm(x[i]-x[j]).is_integer() else 0 for i in range(1, len(x)) for j in range(i)]
print(sum(c))

Buggy submission (verdict: Runtime Error):
import numpy as np

n, d = map(int, input().split())
x = np.array([[int(i) for i in input().split()] for _ in range(n)])

c = [1 if np.linalg.norm(x[i]-x[i-1]).is_integer() else 0 for i in range(len(x)) ]
print(sum(c))
Problem p03693 (python)

Fixed submission:
#coding: utf-8
input = input().split()
r = input[0]
g = input[1]
b = input[2]
x = int(r+g+b)
if x%4==0:
  print('YES')
else:
  print('NO')

Buggy submission (verdict: Runtime Error):
#coding: utf-8
input = input().split()
r = input[0]
g = input[1]
b = input[2]
x = r+g+b
if x%4==0:
  print('YES')
else:
  print('NO')
Problem p02765 (python)

Fixed submission:
N, R = [int(x) for x in input().split(' ')]

if N > 9:
  print(R)
else:
  print(R + 100 * (10 - N))

Buggy submission (verdict: Runtime Error):
N, R = [int(x) for x in input()]

if N > 9:
  print(R)
else:
  print(R - 100 * (10 - N))

Buggy submission (verdict: Runtime Error):
N, R = [int(x) for x in input().split(' ')]

if N > 9:
  print(R)
else:
  print(R - 100 * (10 - K))

Buggy submission (verdict: Runtime Error):
N, R = [int(x) for x in input()]

if N > 9:
  print(R)
else:
  print(R - 100 * (10 - K))
Problem p03280 (python)

Fixed submission:

A,B =  [int(x) for x in input().split()]


print((A-1)*(B-1))

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())

print((A-1)*(B-1))

Buggy submission (verdict: Runtime Error):

A = int(input())
B=int(input())

print((A-1)*(B-1))
Problem p03281 (python)

Fixed submission:
N = int(input())

if N >= 195:
    print("5")
elif N >= 189:
    print("4")
elif N >= 165:
    print("3")
elif N >= 135:
    print("2")
elif N >= 105:
    print("1")
else:
    print("0")

Buggy submission (verdict: Runtime Error):

N = int(input())

if N => 195:
    print("4")
elif N => 165:
    print("3")
elif N => 135:
    print("2")
elif N => 105:
    print("1")
else:
    print("0")
Problem p03359 (python)

Fixed submission:
a,b = [int(x) for x in input().split()]
 
if b >= a:
  print(a)
else:
  print(a-1)

Buggy submission (verdict: Runtime Error):
a,b = [int(x) for x in input().split()]

if b =>a:
  print(a)
else:
  print(a-1)
Problem p02755 (python)

Fixed submission:
l=list(input().split())
A=int(l[0])
B=int(l[1])
c=0
for i in range(1,100001):
  if int(i*0.08)==A and int(i*0.1)==B:
    print(i)
    c=1
    break
if c==0:
	print(-1)

Buggy submission (verdict: Runtime Error):
l=list(input().split())
A=int(l[0])
B=int(l[1])
c=0
for i in range(1,1009):
	if int(i*0.08)==A and int(i**0.1)==B:
  		print(i)
        c=1
        break
if c==1:
	print(-1)

Buggy submission (verdict: Runtime Error):
l=list(input().split())
A=int(l[0])
B=int(l[1])
c=0
for i in range(1,100001):
	if int(i*0.08)==A and int(i**0.1)==B:
  		print(i)
        c=1
        break
if c==1:
	print(-1)
Problem p02780 (python)

Fixed submission:
a=input().split()
N=int(a[0])
K=int(a[1])
zantei=0
P=list(map(float,input().split()))

P_ex=list(map(lambda x: (x+1)/2,P))


for i in range(0,K):
    
    zantei+=P_ex[i]
zanans=0
buffer=P_ex[0]
beforeans=zantei
for i in range(1,N-K+1):
    if(beforeans-buffer+P_ex[K+i-1]>zantei):
        zantei=beforeans+P_ex[K+i-1]-buffer
    beforeans+=(P_ex[K+i-1]-buffer)
    buffer=P_ex[i]

print(zantei)

Buggy submission (verdict: Runtime Error):
a=input().split()
N=int(a[0])
K=int(a[1])
zantei=0
P=list(map(float,input().split()))

P_ex=list(map(lambda x: (x+1)/2,P))


for i in range(0,K):
    
    zantei+=P_ex[i]
zanans=0
buffer=P_ex[0]
beforeans=zantei
for i in range(1,N-K+1):
    if(beforeans-buffer+P_ex[K+i-1]>zantei):
        zantei=breforeans+P_ex[K+i-1]-buffer
    buffer=P_ex[i]
    beforeans+=P_ex[K+i-1]-buffer

print(zantei)
Problem p02755 (python)

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

eightper = 0.08
tenper = 0.1
ans = -1
for i in range(1,1000+1):
    if int(i*eightper)==a:
        if int(i*tenper)==b:
            ans=i
            break
print(ans)

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

eightper = 0.08
tenper = 0.1
ans = -1
for i in range(1,100*(1+tenper)+1):
    if int(i*eightper)==a:
        if int(i*tenper)==b:
            ans=i
            break
print(ans)
Problem p02761 (python)

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

if N == 1 and M == 0:  # 1桁の数字指定なし
    ans = 0
elif N == 1:  # 1桁で数字指定有り:最初のcと同じものがずっと来ればans=c
    s, c = input().split()
    c = int(c)
    ans = c
    for m in range(M-1):
        temp_s, temp_c = input().split()
        if not int(temp_c) == c:
            ans = -1
            break

elif M == 0:  # 2桁以上で数字指定無し:10or100
    ans = 10**(N-1)
else:  # 2桁以上かつ数字指定有り:指定された数字から答えを出す
    # ただし、1桁目についての指定で追加処理
    ans_exist = True  # 矛盾なく答えが存在するか
    guess = []
    for n in range(N):
        guess.append(-1)
        # guess=[-1,-1,-1]
    for m in range(M):
        s, c = input().split()
        s, c = int(s), int(c)

        # すでに別の数字が指定されている時
        if not guess[s-1] == -1 and not guess[s-1] == c:
            ans_exist = False
            break
        # 1桁目に0が指定された時
        elif s == 1 and c == 0:
            ans_exist = False
            break
        else:
            guess[s-1] = c

    # 矛盾なく解が存在するなら指定がある桁を加算
    if ans_exist:
        # 1桁目に指定が無いなら1桁目は1
        ans = 10**(N-1) if guess[0] == -1 else 0
        for n in range(N):
            if not guess[n] == -1:
                ans += guess[n]*(10**(N-1-n))
    else:
        ans = -1

print(ans)

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

guess = [] #答えの候補を保管
for i in range(N):
    guess.append(-1)
exits=True #答えが存在するか
ans=-1

for i in range(M):
    s,c=input().split()
    #桁数sを直感に一致させるために-1
    s,c=int(s)-1,int(c)
    if guess[s]==-1 or guess[s]==c:
        guess[s]=c
    else:
        exits=False

#1桁目が0or与えられてないならば答えは存在しない
if guess[0]==0 or guess[0]==-1:
    exits=False 

if exits:
    ans=0
    for i in range(N):
        ans+= guess[i]*(10**(N-i-1)) if not guess[i]==-1 else 0

#1桁の場合はcがそのまま答え
if N==1:
    ans=c

print(ans)
Problem p02783 (python)

Fixed submission:
a,b=map(int,input().split())
print(a//b+(1-int(a%b==0)))

Buggy submission (verdict: Runtime Error):
a,b=map(int,imput().split())
print(a//b+(1-int(a%b==0)))
Problem p03059 (python)

Fixed submission:
a,b,t=map(int,input().split())
i=1
ans=0
while i*a<=t+0.5:
    ans+=b
    i+=1
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
V = list(map(int, input().split()))
C = list(map(int, input().split()))
ans = 0
for i in range(N):
  if V[i] > C[i]:
    ans += V[i]-C[i]
print(ans)

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

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

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
t = int(input())
print(((t+0.5)//a)*b)
Problem p03071 (python)

Fixed submission:
a,b = map(int, input().split())
if a>b:
  ans = 2*a-1
elif a==b:
  ans = 2*a
else:
  ans = 2*b-1
  
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
ans = 0
max = H[0]
for i in range(N-1):
  if H[i] >= max:
    ans += 1
    max = H[i]
print(ans+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
ans = 0
max = H[1]
for i in range(N-1):
  if H[i+1] >= max:
    ans += 1
    max = H[i+1]
print(ans+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
ans = 0
for i in range(N-1):
  if H[i+1]>=H[i] and H[1]<=H[i+1] and H[2]<=H[i+1]:
    ans += 1
print(ans+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
ans = 0
for i in range(N-1):
  if H[i+1] >= H[i]:
    ans += 1
print(ans+1)
Problem p03076 (python)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
n = []
ans = 0
for i in range(5):
  if dishes[i]%10==0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
    n.append(dishes[i]%10)
if len(n)==0:
  print(ans*10)
else:
  ans = ans*10-10+min(n)
  print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
n = []
ans = 0
for i in range(5):
  if dishes[i]%10==0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
    n.append(dishes[i]%10)
if len(n)==0:
  print(ans*10)
else:
ans = ans*10-10+min(n)
print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
n = list()
ans = 0
for i in range(5):
  if dishes[i]%10==0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
    n.append(dishes[i]%10) 
ans = ans*10-10+min(n)
print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
n = []
ans = 0
for i in range(5):
  if dishes[i]%10==0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
    n.append(dishes[i]%10) 
ans = ans*10-10+min(n)
print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
n = []
ans = 0
for i in range(5):
  if dishes[i]%10==0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
    n.append(dishes[i]%10)

ans = ans*10-10+min(n)
print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
n = []
ans = 0
for i in range(5):
  if dishes[i]%10==0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
    n.append(dishes[i]%10)

ans = ans*10-10+min(n)
print(ans)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
dishes = [a,b,c,d,e]
ans = 0
for i in range(5):
  if dishes[i]%10=0:
    ans += dishes[i]//10
  else:
    ans += dishes[i]//10+1
print(ans*10)