Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#ABC061D - Score Attack
#https://atcoder.jp/contests/abc061/tasks/abc061_d
#自己考察

import sys
n, m = list(map(int,input().split()))
lst = [[] for _ in range(n+1)]#*(n+1)の挙動がよくわからない
for i in range(n):
    a, b, c = list(map(int,input().split()))
    lst[a].append((b,-c))
dp = [float("Inf")]*(n+1)
dp[1] = 0

for _ in range(n):
    for f in range(1,n+1):
        if dp[f] != float("Inf"):
            for t, c in lst[f]:
                dp[t] = min(dp[t], dp[f] + c)

for f in range(1,n+1):
    for t,c in lst[f]:
        if dp[t] > dp[f] + c:
            print("inf")
            sys.exit()

print(-dp[n])

Fixed submission:
import sys
 
inf = float('inf')
 
n, m = map(int, sys.stdin.readline().split())
abc = []
for _ in range(m):
    a, b, c = map(int, sys.stdin.readline().split())
    abc.append((a-1, b-1, -c))
 
def main():
    dist = [inf] * n
    dist[0] = 0
    for _ in range(n-1):
        for a, b, c in abc:
            dist[b] = min(dist[b], dist[a] + c)
 
    for _ in range(n):
        for a, b, c in abc:
            if dist[a] + c < dist[b]:
                dist[b] = -inf
 
    return -dist[n-1]
 
if __name__ == '__main__':
    ans = main()
    print(ans)
Buggy python submission (verdict: Runtime Error):
#arc061_C - たくさんの数式 / Many Formulas
s = list(str(input()))
l = len(s)
def dfs(i,f):
    if i == l-1:
        return sum(list(map(int,f.split("+"))))
    return dfs(i + 1, f + s[i+1]) + \ #この記号の正体を教えて下さい
           dfs(i + 1, f + "+" +s[i + 1])
print(dfs(0,s[0]))

Fixed submission:
#arc061_C - たくさんの数式 / Many Formulas
s = list(str(input()))
l = len(s)
def dfs(i,f):
    if i == l-1:
        return sum(list(map(int,f.split("+"))))
    #この記号の正体を教えて下さい
    return dfs(i + 1, f + s[i+1]) + \
           dfs(i + 1, f + "+" +s[i + 1])
print(dfs(0,s[0]))
Buggy python submission (verdict: Time Limit Exceeded):
N = input()
A = input().split()
if '0' in A:
    print(0)
else:
    N = int(N)
    sum = 1
    for i in range(N):
        sum *= int(A[i])
    if sum > 1000000000000000000:
        sum = -1
    print(sum)

Fixed submission:
N = input()
A = input().split()
if '0' in A:
    print(0)
else:
    N = int(N)
    sum = 1
    for i in range(N):
        sum *= int(A[i])
        if sum > 10**18:
            print(-1)
            exit()
    print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import math
N = input()
A = input().split()
N = int(N)
sum = 1
for i in range(N):
    sum *= int(A[i])
if sum > 1000000000000000000:
    sum = -1
print(sum)

Fixed submission:
N = input()
A = input().split()
if '0' in A:
    print(0)
else:
    N = int(N)
    sum = 1
    for i in range(N):
        sum *= int(A[i])
        if sum > 10**18:
            print(-1)
            exit()
    print(sum)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = []
for i in range(N):
    S.append(input())
print(set(S))

Fixed submission:
S, W = map(int,input().split())
if S <= W:
    print('unsafe')
else:
    print('safe')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = []
count = 0
for i in range(N):
    Si = input()
    if Si not in S:
        S.append(Si)
        count += 1
print(count)

Fixed submission:
N = int(input())
S = []
for i in range(N):
    S.append(input())
print(len(set(S)))
Buggy python submission (verdict: Runtime Error):
a,b,x = map(int, raw_input().split());
cnt = 0;
for i in range(a,b+1):
    if(i%x == 0):
        cnt+=1;
print(cnt);

Fixed submission:
import math;
a,b,x = map(long, raw_input().split());
if(a%x == 0):
    a-=1;
A = long(math.ceil(a/x));
B = long(b//x);
print(B-A);
Buggy python submission (verdict: Runtime Error):
N = int(input())
nums = map(int, input().split())

ans = 1
for n in nums:
  ans *= n

if ans == 0:
  print(0)
elif ans > 10**18:
  print(-1)
else:
  print(ans)

Fixed submission:
a, b = map(int, input().split())
print(a * b)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
nums = map(int, input().split())

ans = 1
for n in nums:
  ans *= n

if ans == 0:
  print(0)
elif ans > 10**18:
  print(-1)
else:
  print(ans)

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

ans = 1
if 0 in nums:
  print(0)
else:
  for n in nums:
    ans *= n
    if ans > 10**18:
      print(-1)
      break
  if ans <= 10**18: print(ans)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3

n, k = map(int, input().split())
D = list(map(int, input().split()))

paid = n
while True:
    st = set(int(x) for x in str(paid))
    l = len(st)
    if len([x for x in st if x not in D]) == l:
        print(paid)
        break
    paid += 1

Fixed submission:
#!/usr/bin/env python3

import sys
  
if sorted(sys.stdin.readline().split()) == ['5', '5', '7']:
  print('YES')
else:
  print('NO')

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

n, k = map(int, input().split())
D = list(map(int, input().split()))

price = n
while True:
    st = set(int(x) for x in str(price))
    l = len(st)
    if len([x for x in st if x not in D]) == l:
        print(price)
        break
    price += 1

Fixed submission:
#!/usr/bin/env python3

import sys
  
if sorted(sys.stdin.readline().split()) == ['5', '5', '7']:
  print('YES')
else:
  print('NO')

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

import sys

n, k = map(int, input().split())
D = list(map(int, input().split()))

for i in range(1, 100):
    total = n * i
    st = set(int(x) for x in str(total))
    l = len(st)
    if len([x for x in st if x not in D]) == l:
        print(total)
        break

Fixed submission:
#!/usr/bin/env python3

import sys
  
if sorted(sys.stdin.readline().split()) == ['5', '5', '7']:
  print('YES')
else:
  print('NO')

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

n, l = map(int, input().split())
s = []

for _ in range(n):
    s.append(str(input()))

print(''.join(sorted(s)))

Fixed submission:
#!/usr/bin/env python3

import sys
  
if sorted(sys.stdin.readline().split()) == ['5', '5', '7']:
  print('YES')
else:
  print('NO')

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

def judge_575(args):
    count5 = [int(x) for x in args ].count(5)
    count7 = [int(x) for x in args ].count(7)
    if count5 == 2 and count7 == 1:
        print('YES')
        return

    print('NO')

if __name__ == "__main__":
    if len(sys.argv) < 4:
        print('NO')
        os.exit(0)

    judge_575(sys.argv[1:])

Fixed submission:
#!/usr/bin/env python3

import sys
  
if sorted(sys.stdin.readline().split()) == ['5', '5', '7']:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
food = [0 for i in range(m+1)]
for i in range(n):
    a = input().split()
    for j in range(1,int(a[0])):
        food[int(a[j])] += 1
count = 0
for i in food:
    if i = n:
        count += 1
print(count)

Fixed submission:
n,m = map(int,input().split())
food = [0 for i in range(m+1)]
for i in range(n):
    a = input().split()
    for j in range(1,int(a[0])+1):
        food[int(a[j])] += 1
count = 0
for i in food:
    if i == n:
        count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
food = [0 for i in range(m+1)]
for i in range(n):
    a = input().split()
    for j in range(0,int(a[0])):
        food[int(a[j])] += 1
count = 0
for i in food:
    if i = n:
        count += 1
print(count)

Fixed submission:
n,m = map(int,input().split())
food = [0 for i in range(m+1)]
for i in range(n):
    a = input().split()
    for j in range(1,int(a[0])+1):
        food[int(a[j])] += 1
count = 0
for i in food:
    if i == n:
        count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
food = [0 for i in range(m)]
for i in range(n):
    a = input().split()
    for j in range(0,int(a[0])):
        food[int(a[j])] = 1
print(food.index(0)+1)

Fixed submission:
n,m = map(int,input().split())
food = [0 for i in range(m+1)]
for i in range(n):
    a = input().split()
    for j in range(1,int(a[0])+1):
        food[int(a[j])] += 1
count = 0
for i in food:
    if i == n:
        count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
food = [0 for i in range(m)]
for i in range(n):
    k = int(input())
    for j in range(k):
        food[int(input())] = 1
print(food.index(0))

Fixed submission:
n,m = map(int,input().split())
food = [0 for i in range(m+1)]
for i in range(n):
    a = input().split()
    for j in range(1,int(a[0])+1):
        food[int(a[j])] += 1
count = 0
for i in food:
    if i == n:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
tmp = input().split()
   ans = tmp[0] * tmp[1]
  print(ans)
 

Fixed submission:
tmp = input().split()
ans = int(tmp[0]) * int(tmp[1])
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    num = int(input())
    suzi = list(map(int,input().split()))
    ans = 1
    if 0 in suzi:
	    print(0)
	    return

    for kazu in suzi:
	    ans *= kazu
    if ans >  1000000000000000000:
	    print(-1)
    else:
	    print(ans)

main()

Fixed submission:
def main():
    num = int(input())
    suzi = list(map(int,input().split()))

    if 0 in suzi:
	    print(0)
	    return
    ans = 1
    for kazu in suzi:
        ans *= kazu
        if ans > 1000000000000000000:
            print(-1)
            return
    print(ans)


main()

Buggy python submission (verdict: Time Limit Exceeded):
num = int(input())
suzi = list(map(int,input().split()))
ans = 1
for kazu in suzi:
	ans *= kazu
if ans >  1000000000000000000:
	print(-1)
else:
	print(ans)

Fixed submission:
def main():
    num = int(input())
    suzi = list(map(int,input().split()))

    if 0 in suzi:
	    print(0)
	    return
    ans = 1
    for kazu in suzi:
        ans *= kazu
        if ans > 1000000000000000000:
            print(-1)
            return
    print(ans)


main()
Buggy python submission (verdict: Time Limit Exceeded):
N, X = map(int, input().split())
A = list(map(int, input().split()))
A.reverse()

acc = [0]
for i in range(0, N):
    acc.append(acc[i] + A[i])

ans = []
for k in range(1, N + 1):
    cost = k * X + N * X
    for i in range(0, (N + k - 1) // k):
        l = k * i
        r = min([l + k, N])
        t = i + 1
        if t == 1:
            cost += (acc[r] - acc[l]) * 5
        else:
            cost += (acc[r] - acc[l]) * (2 * t + 1)
    ans.append(cost)

print(min(ans))

Fixed submission:
N, X = map(int, input().split())
A = list(map(int, input().split()))
A.reverse()

acc = [0]
for i in range(0, N):
    acc.append(acc[i] + A[i])

ans = []
for k in range(1, N + 1):
    cost = k * X + N * X
    for i in range(0, (N + k - 1) // k):
        l = k * i
        r = min([l + k, N])
        t = i + 1
        if t == 1:
            cost += (acc[r] - acc[l]) * 5
        else:
            cost += (acc[r] - acc[l]) * (2 * t + 1)
    ans.append(cost)

print(min(ans))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))

def f(x):
  x.sort()
  if x[0]==0:
    return 0

  x.sort(reversed=True)
  
  ans=1
  
  for i in a:
    ans=ans*i

    if ans>10**18:
      return -1
      
    if n==0:
      return ans
  


print(f(a))

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

def f(x):
  x.sort()
  if x[0]==0:
    return 0

  x.sort(reverse=True)
  
  ans=1
  
  for i in a:
    ans=ans*i

    if ans>10**18:
      return -1
      
  return ans
  


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

x=list(range(1,N+1,1))


if N%2==1:
    for i in range(M):
        print(x.pop(0),x.pop(-1))
        
else:
    x_f=x[1:int(N/2+1)]
    x_l=x[int(N/2+1):]
    
    
    count=0
    
    for i in range(M):
        if len(x_f)>1:
            print(x_f.pop(0),x_f.pop(-1))
            count+=1
            
        if count==M:
            break
        
        if len(x_l)>1:
            print(x_l.pop(0),x_l.pop(-1))
            count+=1
            
        if count==M:
            break

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

Ans='NG'

for i in range(A,B+1):
    if i%K==0:
        Ans='OK'
        break
        
print(Ans)

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

def g(t):
    return int(A*t/B)-A*int(t/B)

x=[i for i in range(0,N,1)]

y=[g(i) for i in x]

print(max(y))

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

Ans='NG'

for i in range(A,B+1):
    if i%K==0:
        Ans='OK'
        break
        
print(Ans)

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

def f(t):
    return int(t)

Max_x=0

for i in range(N):
    if f(A*i/B)-A*f(i/B)<f(A*(i+1)/B)-A*f((i+1)/B):
        Max_x=i+1
        
print(f(A*Max_x/B)-A*f(Max_x/B))

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

Ans='NG'

for i in range(A,B+1):
    if i%K==0:
        Ans='OK'
        break
        
print(Ans)
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())

x=list(range(1,N+1,1))

for i in range(3):
    print(x.pop(0),x.pop(-1))

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

x=list(range(1,N+1,1))

if N%2==1:
    for i in range(M):
        print(x.pop(0),x.pop(-1))
        
else:
    x_f=x[1:int(N/2+1)]
    x_l=x[int(N/2+1):]
    
    count=0
    
    for i in range(M):
        if len(x_f)>1:
            print(x_f.pop(0),x_f.pop(-1))
            count+=1
            
        if count==M:
            break
        
        if len(x_l)>1:
            print(x_l.pop(0),x_l.pop(-1))
            count+=1
            
        if count==M:
            break
Buggy python submission (verdict: Runtime Error):
S=int(input())
W=int(input())

if S<=W:
    print('unsafe')
    
else:
    print('safe')

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

if S<=W:
    print('unsafe')
    
else:
    print('safe')

Buggy python submission (verdict: Runtime Error):
if S<=W:
    print('unsafe')
    
else:
    print('safe')

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

if S<=W:
    print('unsafe')
    
else:
    print('safe')
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())

A=[int(input())for i in range(M)]

print(N-sum(A))

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

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

if N-sum(A)>=0:
    print(N-sum(A))
    
else:
    print('-1')
Buggy python submission (verdict: Time Limit Exceeded):
N,A,B=map(int,input().split())

count=0

count_blue=0

while count<N-(A+B):
    count_blue+=A
    count+=A+B

if N-count<A:
    count_blue+=N-count
    
else:
    count_blue+=A
    
print(count_blue)
    

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

x=N//(A+B)

y=N%(A+B)

if y<A:
    print(A*x+y)
    
else:
    print(A*x+A)
Buggy python submission (verdict: Runtime Error):
n=int(input())
p=list(map(int,input().split()))
q=list(map(int,input().split()))


def fun(x):
    
    count=0
    
    for k in range(len(x)-1):
        count+=math.factorial(len(x)-1)*sum(i<x[0] for i in x)
        del x[0]
        
    return count+1

a=fun(p)
b=fun(q)

print(abs(a-b))

Fixed submission:
import math

n=int(input())
p=list(map(int,input().split()))
q=list(map(int,input().split()))


def fun(x):
    
    count=0
    
    for k in range(len(x)-1):
        count+=math.factorial(len(x)-1)*sum(i<x[0] for i in x)
        del x[0]
        
    return count+1

a=fun(p)
b=fun(q)

print(abs(a-b))

Buggy python submission (verdict: Runtime Error):
n=int(input())
p=list(map(int,input().split()))
q=list(map(int,input().split()))


def fun(x):
    
    count=0
    
    for k in range(len(x)-1):
        count+=math.factorial(len(x)-1)*sum(i<x[0] for i in x)
        del x[0]
        
    return count+1

a=fun(p)
b=fun(q)

print(abs(a-b))

Fixed submission:
import math

n=int(input())
p=list(map(int,input().split()))
q=list(map(int,input().split()))


def fun(x):
    
    count=0
    
    for k in range(len(x)-1):
        count+=math.factorial(len(x)-1)*sum(i<x[0] for i in x)
        del x[0]
        
    return count+1

a=fun(p)
b=fun(q)

print(abs(a-b))
Buggy python submission (verdict: Time Limit Exceeded):
n,y=map(int,input().split())

ans=0

for i in range(y//10000,-1,-1):

    nokori=(y-i*10000)

    for j in range(min(n-i,nokori//5000),-1,-1):
 
        nokori2=nokori-j*5000
    
        for k in range(min(n-i-j,nokori2//1000),-1,-1):
            
            if 10000*i+5000*j+1000*k==y and i+j+k==n:
                print(i,j,k)
                ans=1
                break
                
        else:
            continue
        break
        
    else:
        continue
    break
    
if ans==0:
    print(-1,-1,-1)

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

ans=0

for i in range(y//10000,-1,-1):

    nokori=(y-i*10000)

    for j in range(min(n-i,nokori//5000),-1,-1):
 
        nokori2=nokori-j*5000
    
        if 10000*i+5000*j+1000*(n-i-j)==y:
            print(i,j,n-i-j)
            ans=1
            break
            
    else:
        continue
    break
    
          
if ans==0:
    print(-1,-1,-1)

Buggy python submission (verdict: Time Limit Exceeded):
n,y=map(int,input().split())

a=0

for s in range(y//10000+1)[::-1]:
    for t in range((y-10000*s)//5000+1)[::-1]:
        for u in range((y-10000*s-5000*t)//1000+1)[::-1]:
            if 10000*s+5000*t+1000*u==y and s+t+u==n:
                print(s,t,u)
                a=1
                break
                
            else:
                continue
            break
            
        else:
            continue
        break
        
    else:
        continue
    break
    
if a==0:
    print(-1,-1,-1)

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

ans=0

for i in range(y//10000,-1,-1):

    nokori=(y-i*10000)

    for j in range(min(n-i,nokori//5000),-1,-1):
 
        nokori2=nokori-j*5000
    
        if 10000*i+5000*j+1000*(n-i-j)==y:
            print(i,j,n-i-j)
            ans=1
            break
            
    else:
        continue
    break
    
          
if ans==0:
    print(-1,-1,-1)

Buggy python submission (verdict: Time Limit Exceeded):
n,y=map(int,input().split())

a=0

for s in range(y//10000+1)[::-1]:
    for t in range(y//5000+1)[::-1]:
        for u in range(y//1000+1)[::-1]:
            if 10000*s+5000*t+1000*u==y and s+t+u==n:
                print(s,t,u)
                a=1
                break
                
            else:
                continue
            break
            
        else:
            continue
        break
        
    else:
        continue
    break
    
if a==0:
    print(-1,-1,-1)


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

ans=0

for i in range(y//10000,-1,-1):

    nokori=(y-i*10000)

    for j in range(min(n-i,nokori//5000),-1,-1):
 
        nokori2=nokori-j*5000
    
        if 10000*i+5000*j+1000*(n-i-j)==y:
            print(i,j,n-i-j)
            ans=1
            break
            
    else:
        continue
    break
    
          
if ans==0:
    print(-1,-1,-1)
Buggy python submission (verdict: Runtime Error):
import numpy as np

s=list(map(int,input().split()))

s_array=np.array(s)

if np.sum(s_array)==7:
    Ans=['+'+str(i) for i in s]
    Ans[0]=str(s[0])
    print(''.join(Ans)+'=7')
    
else:
    for i in range(3):
        if np.sum(s_array)-2*s_array[i+1]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[i+1]='-'+str(s[i+1])
            print(''.join(Ans)+'=7')
            break
            
        elif np.sum(s_array)-2*s_array[1]-2*s_array[2]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[1]='-'+str(s[1])
            Ans[2]='-'+str(s[2])
            print(''.join(Ans)+'=7')
            break
            
        elif np.sum(s_array)-2*s_array[2]-2*s_array[3]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[2]='-'+str(s[2])
            Ans[3]='-'+str(s[3])
            print(''.join(Ans)+'=7')
            break
        
        elif np.sum(s_array)-2*s_array[1]-2*s_array[3]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[1]='-'+str(s[1])
            Ans[3]='-'+str(s[3])
            print(''.join(Ans)+'=7')
            break
            
        elif np.sum(s_array)-2*s_array[1]-2*s_array[2]-2*s_array[3]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[1]='-'+str(s[1])
            Ans[2]='-'+str(s[2])
            Ans[3]='-'+str(s[3])
            print(''.join(Ans)+'=7')
            break

Fixed submission:
import numpy as np

nyuryoku=input()

s=[int(i) for i in nyuryoku]

s_array=np.array(s)

if np.sum(s_array)==7:
    Ans=['+'+str(i) for i in s]
    Ans[0]=str(s[0])
    print(''.join(Ans)+'=7')
    
else:
    for i in range(3):
        if np.sum(s_array)-2*s_array[i+1]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[i+1]='-'+str(s[i+1])
            print(''.join(Ans)+'=7')
            break
            
        elif np.sum(s_array)-2*s_array[1]-2*s_array[2]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[1]='-'+str(s[1])
            Ans[2]='-'+str(s[2])
            print(''.join(Ans)+'=7')
            break
            
        elif np.sum(s_array)-2*s_array[2]-2*s_array[3]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[2]='-'+str(s[2])
            Ans[3]='-'+str(s[3])
            print(''.join(Ans)+'=7')
            break
        
        elif np.sum(s_array)-2*s_array[1]-2*s_array[3]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[1]='-'+str(s[1])
            Ans[3]='-'+str(s[3])
            print(''.join(Ans)+'=7')
            break
            
        elif np.sum(s_array)-2*s_array[1]-2*s_array[2]-2*s_array[3]==7:
            Ans=['+'+str(i) for i in s]
            Ans[0]=str(s[0])
            Ans[1]='-'+str(s[1])
            Ans[2]='-'+str(s[2])
            Ans[3]='-'+str(s[3])
            print(''.join(Ans)+'=7')
            break
Buggy python submission (verdict: Runtime Error):

A,B = input.split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)


Fixed submission:
A,B = input().split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)

Buggy python submission (verdict: Runtime Error):
def main():
  A,B = input.split()
  A = int(A)
  B = round(float(B)*100)
 
  res = (A*B)//100
  print(res)
 
main()

Fixed submission:
A,B = input().split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)

Buggy python submission (verdict: Runtime Error):
def main():
  A,B = input.split()
  A = int(A)
  B = round(float(B)*100)

  res = (A*B)//100
  print(res)
  return
 
main()

Fixed submission:
A,B = input().split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)

Buggy python submission (verdict: Runtime Error):
def main():
  A,B = map(int,input.split())
  
  B*=100
  res = (A*B)/100
  print(res)
  return
 
main()

Fixed submission:
A,B = input().split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)

Buggy python submission (verdict: Runtime Error):
def main():
  A,B = map(int,input.split())
  
  B*=100
  res = (A*B)//100
  print(res)
  return
 
main()

Fixed submission:
A,B = input().split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)

Buggy python submission (verdict: Runtime Error):
def main():
  A,B = map(int,input.split())
  
  B*=100
  
  print((A*B)//100)
  return

main()

Fixed submission:
A,B = input().split()
A = int(A)
B = round(float(B)*100)

res = (A*B)//100
print(res)