Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
mod = pow(10,9)+7
s = 0
for i in range(N-1):
    b = a[i]
    for j in range(i+1,N):
        s += b*a[j]
        s %= mod
print(s)

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N-1):
    b = a[i]
    for j in range(i+1,N):
        s += b*a[j]
print(s%(pow(10,9)+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N):
    s += sum(a[i]*a[i+1:])
print(s%(pow(10,9)+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N):
    b = a[i]
    s += sum(b*a[i+1:])
print(s%(pow(10,9)+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N):
    b = a[i]
    for j in range(i+1,N):
        s += b*a[j]
print(s%(pow(10,9)+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N):
    for j in range(i+1,N):
        s += a[i]*a[j]
print(s%(pow(10,9)+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N):
    for j in range(i+1,N):
        s += a[i]*a[j]
print(s%(10**9+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(N):
    for j in range(i+1,N):
        s += a[i]*a[j]
print(s%(10**9+7))

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a_s = sum(a)
mod = 10**9+7
s = 0
for i in range(N-1):
    b = a[i]
    a_s -= b
    s += b*(a_s)
    s %= mod
print(s)
Buggy python submission (verdict: Runtime Error):
N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
 
sum = 0
for i in a_list:
  sum += i
 
output_sum = 0
for idx, i in enumerate(a_list[:-1]):
  sum -= a_list[idx]
  output_sum += i*sum
  
print(output_sum%mod)

Fixed submission:
D,T,S = [int(i) for i in input().split(' ')]
 
if T*S >= D:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
 
sum = 0
for i in a_list:
  sum += i
output_sum=0
for idx, i in enumerate(a_list[:-1]):
  sum -= a_list[idx]
  output_sum += i*sum
  
print(output_sum%mod)

Fixed submission:
D,T,S = [int(i) for i in input().split(' ')]
 
if T*S >= D:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
 
sum = 0
for i in a_list:
  sum += i

output_sum = 0
for idx, i in enumerate(a_list[:-1]):
  sum -= a_list[idx]
  output_sum += i*sum
  
print(output_sum%mod)

Fixed submission:
D,T,S = [int(i) for i in input().split(' ')]
 
if T*S >= D:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
 
sum = 0
for i in a_list:
  sum += i
 
for idx, i in enumerate(a_list[:-1]):
  sum -= a_list[idx]
  sum += i*sum
  
print(sum%mod)

Fixed submission:
D,T,S = [int(i) for i in input().split(' ')]
 
if T*S >= D:
  print('Yes')
else:
  print('No')

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

min = len(T)
for t in range(len(S) - len(T)+1):
    tmp = 0
    for i in range(len(T)):
        if S[i+t] != T[i]:
            tmp+=1
    
    if tmp < min:
        min = tmp

print(min)

Fixed submission:
D,T,S = [int(i) for i in input().split(' ')]
 
if T*S >= D:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
if S*T > D:
  print('Yes')
else:
  print('No')

Fixed submission:
D,T,S = [int(i) for i in input().split(' ')]
 
if T*S >= D:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import math
N = input()
nums = [int(i) for i in input().split(' ')]

sum = 0

for i in range(len(nums)-1):
    for ii in range(len(nums)-i-1):
        sum += nums[i]*nums[i+ii+1]

sum = sum%(math.pow(10,9)+7)
print(int(sum))


Fixed submission:
N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007

sum_list = []
sum = 0
for i in a_list:
  sum += i
  sum_list.append(sum)

sum = 0
for idx, i in enumerate(a_list[:-1]):
  sum += i*(sum_list[-1]-sum_list[idx])
  
print(sum%mod)
Buggy python submission (verdict: Runtime Error):
n=int(input())
dic={"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(n):
  s=input()
  dic[s]+=1
for k,v in dic.items():
  print("{0} x {1}".format(k,v)

Fixed submission:
n=int(input())
dic={"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(n):
  s=input()
  dic[s]+=1
for k,v in dic.items():
  print("{0} x {1}".format(k,v))
Buggy python submission (verdict: Runtime Error):
H=int(input())
W=int(input())
h=int(input())
w=int(input())
print((H-h)*(W-w))

Fixed submission:
H,W=map(int,input().split())
h,w=map(int,input().split())
X=H-h
Y=W-w
Z=X*Y
print(Z)
Buggy python submission (verdict: Runtime Error):
N=int(input())
l_list = list(map(int,input().split()))
max_l=max(l_list)
if sum(l_list)-max_l>max_l:
  print("Yes")
else:
  print("No")


Fixed submission:
T,X=input().split()
print(int(T)/int(X))
Buggy python submission (verdict: Runtime Error):
N=int(input())
l_list = list(int(input()) for _ in range(N))
max_l=max(l_list)
if sum(l_list)-max_l>max_l:
  print("Yes")
else:
  print("No")

Fixed submission:
N=int(input())
table=list(map(int,input().split()))
if max(table)*2<sum(table[:]):
  print("Yes")
else :
  print("No")

Buggy python submission (verdict: Runtime Error):
N=int(input())
l_list=[int(input())for _ in range(N)]
max_l=max(l_list)
if sum(l_list)-max_l>max_l:
  print("Yes")
else:
  print("No")

Fixed submission:
N=int(input())
table=list(map(int,input().split()))
if max(table)*2<sum(table[:]):
  print("Yes")
else :
  print("No")
Buggy python submission (verdict: Runtime Error):
if int(input())==1:
  print("Hello World")
else:
  A,B=map(int,input().split())
  print(A+B)

Fixed submission:
if int(input())==1:
  print("Hello World")
else:
  A = int(input())
  B=int(input())
  print(A+B)
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
if abs(a-c)<= d:
  print("Yes")
elif abs(a-b)<=d and abs(b-c)<=d:
  print("Yes")
else:
  print("No"

Fixed submission:
a,b,c,d=map(int,input().split())
if abs(a-c)<= d:
  print("Yes")
elif abs(a-b)<=d and abs(b-c)<=d:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
print(min(a,b)+min(c,d))

Fixed submission:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
print(int(min(a,b)+min(c,d)))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

allsum = 0
for i in range(n-1):
    allsum += a[i] * sum(a[i+1:])
print(allsum % (10**9+7))


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

"""
allsum = 0
for i in range(n-1):
    allsum += a[i] * sum(a[i+1:])
print(allsum % (10**9+7))
"""
s, s2 = 0, 0
for i in range(n):
    s += a[i]
    s2 += a[i] * a[i]
print(((s*s - s2)//2) % (10**9+7))

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

allsum = 0
for i in range(n-1):
    allsum += a[i] * sum(a[i+1:])
print(allsum % (10**9+7))


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

"""
allsum = 0
for i in range(n-1):
    allsum += a[i] * sum(a[i+1:])
print(allsum % (10**9+7))
"""
s, s2 = 0, 0
for i in range(n):
    s += a[i]
    s2 += a[i] * a[i]
print(((s*s - s2)//2) % (10**9+7))
Buggy python submission (verdict: Runtime Error):
a,b = input().split()
a1 = int(a)
bs = list(b)
b1 = int(bs[0])
b2 = 0
if len(b)==3:
    b2 = int(bs[2])*10
else:
    b2 = int(bs[2]+bs[3])
b1 = b1*100+b2
ans = list(str(a1*b1))
del ans[-1]
del ans[-1]
print(''.join(ans))

Fixed submission:
a,b = input().split()
a1 = int(a)
bs = list(b)
b1 = int(bs[0])
b2 = 0
if len(b)==3:
    b2 = int(bs[2])*10
else:
    b2 = int(bs[2]+bs[3])
b1 = b1*100+b2
ans = list(str(a1*b1))
del ans[-1]
if ans:
    del ans[-1]
if ans:
    print(''.join(ans))
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
a,b,c,k = [int(i) for i in input().split()]
if k<=a:
  print(k)
else if k<=a+b and k>a:
  print(a)
else:
  print(a-(k-a-b))
      

Fixed submission:
a,b,c,k = [int(i) for i in input().split()]
if k<=a:
  print(k)
elif k<=a+b and k>a:
  print(a)
else:
  print(a-(k-a-b))

Buggy python submission (verdict: Runtime Error):
a,b,c,k = [int(i) for i in input().split()]
if k<=a:
  print(k)
else if a<k<=a+b:
  print(a)
else:
  print(a-(k-a-b))
      

Fixed submission:
a,b,c,k = [int(i) for i in input().split()]
if k<=a:
  print(k)
elif k<=a+b and k>a:
  print(a)
else:
  print(a-(k-a-b))
Buggy python submission (verdict: Runtime Error):
n = list(input())
ans = 'No'
for i in range(len(n)):
  if n[i] = '7':
    ans = 'Yes'
    break
print(ans)


Fixed submission:
n = list(input())
ans = 'No'
for i in range(len(n)):
  if n[i] == '7':
    ans = 'Yes'
    break
print(ans)

Buggy python submission (verdict: Runtime Error):
n = input()
ans = 'No'
for i in range(len(n)):
  if n[i] = '7':
    ans = 'Yes'
    break
print(ans)


Fixed submission:
n = list(input())
ans = 'No'
for i in range(len(n)):
  if n[i] == '7':
    ans = 'Yes'
    break
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(i) for i in input().split()]
c = [0 for i in range(n)]
b = sorted(a)
cnt = 1
for i in range(n-1):
  if b[i]==b[i+1]:
    cnt += 1
  else:
    c[b[i]] = cnt
    cnt = 1
  if i==n-2:
    c[b[n-1]] = cnt
ans = 0
for i in range(n):
  ans += int(c[i]*(c[i]-1)/2)
for i in range(n):
  print(ans-(c[a[i]]-1))

Fixed submission:
n = int(input())
a = [int(i) for i in input().split()]
c = [0 for i in range(n+1)]
b = sorted(a)
cnt = 1
for i in range(n-1):
  if b[i]==b[i+1]:
    cnt += 1
  else:
    c[b[i]] = cnt
    cnt = 1
  if i==n-2:
    c[b[n-1]] = cnt
ans = 0
for i in range(n+1):
  ans += int(c[i]*(c[i]-1)/2)
for i in range(n):
  print(ans-(c[a[i]]-1))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [input() for _ in range(n)]
d = {}
for i in s:
  if i in d:
    d[i] += 1
  else:
    d[i] = 1
ans = [kv[0] for kv in d.items() if kv[1] == max(d.values())]
ans.sort()
print('\n'.join(ans))

Fixed submission:
n = int(input())
s = [input() for _ in range(n)]
d = {}
for i in s:
  if i in d:
    d[i] += 1
  else:
    d[i] = 1
vmax = max(d.values())
ans = [kv[0] for kv in d.items() if kv[1] == vmax]
ans.sort()
print('\n'.join(ans))
Buggy python submission (verdict: Runtime Error):
s,t = map(int,input().split())
a,b = map(int,input().split())
u = input()
if u==s:
  a=a-1
else:
  b=b-1
print(a,b)

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

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

Fixed submission:
s,t = input().split()
a,b = map(int,input().split())
u = input()
if u==s:
  a=a-1
else:
  b=b-1
print(a,b)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = list(map(int,input().split()))
pre = True
ans = 1
for i in range(1,n):
  if pre and p[i]<=p[i-1]:
    ans += 1
  elif not pre and p[i]>p[i-1]:
    pre = False
  else:
    if min(p[:i])>=p[i]:
      ans += 1
      pre = True
    else:
      pre = False
print(ans)

Fixed submission:
n = int(input())
p = list(map(int,input().split()))
pre = True
premin = p[0]
ans = 1
for i in range(1,n):
  if pre and p[i]<=p[i-1]:
    ans += 1
    premin = p[i]
  elif not pre and p[i]>p[i-1]:
    pre = False
  else:
    if premin>=p[i]:
      ans += 1
      pre = True
      premin = p[i]
    else:
      pre = False
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
s = [['n' for i in range(10)] for j in range(n)]
for i in range(n):
    s[i]=list(input())
    s[i].sort()
j=0
tans=1
f = 1
ans=0
donei=[]
for i in range(n):
    if not i in donei:
        j=n-1
        while j>i:
            if s[i]==s[j]:
                tans = tans + 1
                donei.append(j)
            j=j-1
        for k in range(tans):
            f = f * (k+1)
        ans = ans + int(f/2)
        tans=1

print(ans)


Fixed submission:
n = int(input())
s = []
for i in range(n):
    s.append(''.join(sorted(input())))
s.sort()
ans = 0
t = 0
for i in range(1,n):
    if s[i-1]==s[i]:
        t += 1
        if i==n-1:
            ans += t*(t+1)/2
    else:
        if t>0:
            ans += t*(t+1)/2
            t = 0

print(int(ans))

Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
s = [['n' for i in range(10)] for j in range(n)]
for i in range(n):
    s[i]=list(input())
    s[i].sort()
j=0
tans=1
ans=0
donei=[]
for i in range(n):
    if not i in donei:
        j=n-1
        while j>i:
            if s[i]==s[j]:
                tans = tans + 1
                donei.append(j)
            j=j-1
        ans = ans + int(math.factorial(tans)/2)
        tans=1

print(ans)


Fixed submission:
n = int(input())
s = []
for i in range(n):
    s.append(''.join(sorted(input())))
s.sort()
ans = 0
t = 0
for i in range(1,n):
    if s[i-1]==s[i]:
        t += 1
        if i==n-1:
            ans += t*(t+1)/2
    else:
        if t>0:
            ans += t*(t+1)/2
            t = 0

print(int(ans))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [['n' for i in range(10)] for j in range(n)]
for i in range(n):
    s[i]=list(input())
    s[i].sort()
j=0
ans=0
for i in range(n):
    j=n-1
    while j>i:
        if s[i]==s[j]:
            ans = ans + 1
        j=j-1

print(ans)


Fixed submission:
n = int(input())
s = []
for i in range(n):
    s.append(''.join(sorted(input())))
s.sort()
ans = 0
t = 0
for i in range(1,n):
    if s[i-1]==s[i]:
        t += 1
        if i==n-1:
            ans += t*(t+1)/2
    else:
        if t>0:
            ans += t*(t+1)/2
            t = 0

print(int(ans))
Buggy python submission (verdict: Runtime Error):
n = input()
h = [int(i) for i in input().split()]

max = 0
i = 0
y = 1
for i in range(n):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")


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

max = 0
i = 0
y = 1
for i in range(int(n)):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
h = [int(i) for i in input().sprit()]

max = 0
i = 0
y = 1
for i in range(n):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")


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

max = 0
i = 0
y = 1
for i in range(int(n)):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
h = [int(i) for i in input().sprit()]

max = 0
i = 0
y = 1
for i in range(n):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
        break
    
if y==1:
    print("Yes")
else:
    print("No")


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

max = 0
i = 0
y = 1
for i in range(int(n)):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
h = [int(i) for i in input().sprit()]

max = 0
i = 0
y = 1
for i in range(n):
    if h[i] > max:
        max = h[i]
    else if h[i] < max-1:
        y = 0
        break
    
if y:
    print("yes")
else:
    print("no")


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

max = 0
i = 0
y = 1
for i in range(int(n)):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
h = [int(i) for i in input().sprit()]

max = 0
y = 1
for i in range(n):
    if h[i] > max:
        max = h[i]
    else if h[i] < max-1:
        y = 0
        break
    
if y:
    print("yes")
else:
    print("no")


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

max = 0
i = 0
y = 1
for i in range(int(n)):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
h = [int(i) for i in input().sprit()]

max = 0

while 1:
    for i in range(n):
        if h[i] > max:
            max = h[i]
        else if h[i] < max+1:
            print("no")
            break
    print("yes")
    break


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

max = 0
i = 0
y = 1
for i in range(int(n)):
    if h[i] > max:
        max = h[i]
    elif h[i] < max-1:
        y = 0
    
if y==1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
r = input()
print(r * r)

Fixed submission:
r = int(input())
print(r * r)

Buggy python submission (verdict: Runtime Error):
r = input()
print(r * r)

Fixed submission:
r = int(input())
print(r * r)
Buggy python submission (verdict: Runtime Error):
a,b = map(int(input().split()))
if a < 10 and b < 10:
  print(a * b)
else:
  print(-1)

Fixed submission:
a,b = map(int,input().split())
if a < 10 and b < 10:
  print(a * b)
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
i = input().split()
if i < 10:
  print(i[0] * i[1])

Fixed submission:
a,b = map(int,input().split())
if a < 10 and b < 10:
  print(a * b)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
S=input()
T=input()
ans=[]
count=0
for i1 in range(len(S)-len(T)):
	for i2 in range(len(T)):
  		if S[i1+i2]==T[i2]:
          count++
    else:
    ans=ans.append(count)
    count=0
else:
	print(ans.max())

Fixed submission:
D,T,S=map(int,input().split())
if (D/S)>T:
	print("No")
else:
	print("Yes")

Buggy python submission (verdict: Runtime Error):
D,T,S=map(int,input())
if D*S>T:
	print("No")
else:
	print("Yes")

Fixed submission:
D,T,S=map(int,input().split())
if (D/S)>T:
	print("No")
else:
	print("Yes")

Buggy python submission (verdict: Runtime Error):
D,T,S=map(int,input())
if D*S>T :
	print("No")
else:
	print("Yes")

Fixed submission:
D,T,S=map(int,input().split())
if (D/S)>T:
	print("No")
else:
	print("Yes")

Buggy python submission (verdict: Runtime Error):
D,T,S=map(int,input())
if D*S>T :
 print("No")
else:
 print("Yes")

Fixed submission:
D,T,S=map(int,input().split())
if (D/S)>T:
	print("No")
else:
	print("Yes")
Buggy python submission (verdict: Runtime Error):
import sys

N, Y = map(int, input().split())
for x in range(N+1):
	for y in range(N+1-x):
		for z in range(N+1-x-y):
   			if Y == 10000*x+5000*y+1000*z :
    			print(x,y,z)
    			sys.exit()
print("-1 -1 -1")

Fixed submission:
s = input()
print("2018/01/"+s[8:])

Buggy python submission (verdict: Runtime Error):
s= List(input())
s[3]="8"
print(s)

Fixed submission:
s = input()
print("2018/01/"+s[8:])

Buggy python submission (verdict: Runtime Error):
s= input()
s[3]="8"
print(s)

Fixed submission:
s = input()
print("2018/01/"+s[8:])
Buggy python submission (verdict: Runtime Error):
n = int(input())
d = []
for i in range(n):
    d.extend(int(input()))
print(len(set(d)))

Fixed submission:
n = int(input())
d = []
for i in range(n):
    d.append(int(input()))
print(len(set(d)))
Buggy python submission (verdict: Runtime Error):
a = input()
a = 48 - a
print(a)

Fixed submission:
a = int(input())
a = 48 - a
print(a)
Buggy python submission (verdict: Runtime Error):
N=input()
print(N*(N+1)/2)

Fixed submission:
N=int(input())
print((N*(N+1))//2)
Buggy python submission (verdict: Runtime Error):
s = str(input())
a = []
 
for i in len(s):
    if s[i] == '0':
        a.append('0')
    elif s[i] == '1':
        a.append('1')
    else:
        if len(a) != 0:
            a.pop()
 
print(''.join(a))

Fixed submission:
s = str(input())
a = []
 
for i in range(len(s)):
    if s[i] == '0':
        a.append('0')
    elif s[i] == '1':
        a.append('1')
    else:
        if len(a) != 0:
            a.pop()
 
print(''.join(a))
Buggy python submission (verdict: Runtime Error):
abc=map(int,input().split())
if abc.count(5)==5 and abc.count(7)==1:
	print("YES")
else:
  	print("NO")

Fixed submission:
a,b,c=map(int,input().split())
if((a*b*c)%7==0)and((a*b*c)/7==25):
	print("YES")
else:
  	print("NO")

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if((a*b*c)%7=0)and((a*b*c)/7=25):
	print("YES")
else:
  	print("NO")

Fixed submission:
a,b,c=map(int,input().split())
if((a*b*c)%7==0)and((a*b*c)/7==25):
	print("YES")
else:
  	print("NO")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a*b %2=0:
	print("Even")
else:
	print("Odd")

Fixed submission:
a,b=map(int,input().split())
if a*b %2==0:
	print("Even")
else:
	print("Odd")
Buggy python submission (verdict: Runtime Error):
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
x=1
for i in range(d):
    x*=100
ans=0
for i in range(n):
    ans+=x
    if(ans%(x*100))==0)ans+=x
print(ans)

Fixed submission:
from sys import stdin
d,n=[int(x) for x in stdin.readline().rstrip().split()]
x=1
for i in range(d):
    x*=100
ans=0
if (n==100):
    n+=1

for i in range(n):
    ans+=x
print(ans)
Buggy python submission (verdict: Runtime Error):
z=0
a,b,c,k = map(int,input().split())
z=k-a
if z>=0:
    z=z-b
print(a+b*0+z*-1)



Fixed submission:
s = input()
t = input()
if s == t[:-1]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import math
a,b = map(int,input().split())
ans = a * b // math.gcd(a, b)
print(ans)

Fixed submission:
import fractions
a,b = map(int,input().split())
ans = a * b // fractions.gcd(a, b)
print(ans)
Buggy python submission (verdict: Runtime Error):
count=0
a=0
n,x = map(int,input().split())
li = list(map(int,input().split()))
for i in range(n):
    if (a<=x):
        a=a+li[i]
        count+=1
print(count)

Fixed submission:
x,y = map(int,input().split())
if x<y:
	print(0)
else:
	print(10)