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

Fixed submission:
import fractions

X = [int(x) for x in input().split()]

v = fractions.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Buggy submission (verdict: Runtime Error):
import math

X = [int(x) for x in input().split()]

v = math.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Buggy submission (verdict: Runtime Error):
import fractions

X = [int(x) for x in input().split()]

v = fractions.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Buggy submission (verdict: Runtime Error):
import functions

X = [int(x) for x in input().split()]

v = functions.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Buggy submission (verdict: Runtime Error):
import functions

X = [int(x) for x in input().split()]

v = functions.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Buggy submission (verdict: Runtime Error):
import math

X = [int(x) for x in input().split()]

v = math.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)

Buggy submission (verdict: Runtime Error):
import math

X = [int(x) for x in input().split()]

v = math.gcd(X[0], X[1])
j = X[0] / v
p = int(X[1] * j)

print(p)
Problem p03041 (python)

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

S[X[1] - 1] = S[X[1] - 1].lower()

print(''.join(S))

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

S[X[1] - 1] = S[X[1] - 1].lower()

print(''.join(S))
Problem p02754 (python)

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

x, y = divmod(N, A+B)
print(x * A + min(A, y))

Buggy submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
L = A + B
S = ('b' * A) + ('r' * B)
count = 0
for i in range(0, N):
	s = S[i%L]
	if s == 'b':
		count += 1
print(count)
Problem p02879 (python)

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

if 1 <= A <= 9 and 1 <= B <= 9:
    print(A * B)
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
import sys
N = int(input())

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            print("Yes")
            sys.exit(0)

print("No")
Problem p02880 (python)

Fixed submission:
import sys
N = int(input())

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            print("Yes")
            sys.exit(0)

print("No")

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

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            print("Yes")
            sys.exit(0)

print("No")
Problem p02959 (python)

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

def calc(a, b, c):
    if a < b:
        b -= a 
        c += a 
        a = 0 
    else:
        a -= b 
        c += b 
        b = 0
    return a, b, c 

c = 0
for i in reversed(range(N)):
    A[i+1], B[i], c = calc(A[i+1], B[i], c)
    A[i], B[i], c = calc(A[i], B[i], c)

print(c)

Buggy submission (verdict: Runtime Error):
def calc(a, b, c):
    if a < b:
        b -= a 
        c += a 
        a = 0 
    else:
        a -= b 
        c += b 
        b = 0
    return a, b, c 

c = 0
for i in reversed(range(N)):
    A[i+1], B[i], c = calc(A[i+1], B[i], c)
    A[i], B[i], c = calc(A[i], B[i], c)

print(c)
Problem p03127 (python)

Fixed submission:
import fractions
from functools import reduce

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

print(reduce(fractions.gcd, A))

Buggy submission (verdict: Runtime Error):
import math
from functools import reduce

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

print(reduce(math.gcd, A))
Problem p02831 (python)

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

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)

print(A * B // gcd(A, B))

Buggy submission (verdict: Runtime Error):
import math

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

print(A * B // math.gcd(A, B))

Buggy submission (verdict: Runtime Error):
import math

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

print(A * B // math.gcd(A, B))
Problem p02891 (python)

Fixed submission:
S = input()
K = int(input())

X = []
b = S[0]
cnt = 1
for i in range(1, len(S)):
    s = S[i]
    if b == s:
        cnt += 1
    else:
        X.append([b, cnt])
        cnt = 1
        b = s
X.append([b, cnt])

result = 0
if len(X) == 1:
    print(X[0][1] * K // 2)
elif X[0][0] == X[-1][0]:
    s = X.pop(0)
    e = X.pop()
    for x in X:
        result += x[1] // 2
    result *= K

    result += s[1] // 2
    result += e[1] // 2
    x = (s[1] + e[1]) // 2
    result += x * (K - 1)
    print(result)
else:
    for x in X:
        result += x[1] // 2
    result *= K
    print(result)

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

print(S * K)

X = []
b = S[0]
cnt = 1
for i in range(1, len(S)):
    s = S[i]
    if b == s:
        cnt += 1
    else:
        X.append([b, cnt])
        cnt = 1
        b = s
X.append([b, cnt])

result = 0
for x in X:
    result += x[1] // 2

result = result * K
if X[0][0] == X[-1][0]:
    result += 1
print(result)
Problem p03127 (python)

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

while len(A) > 1:
    a = min(A)
    A = set(x % a if x % a != 0 else a for x in A)
    if 1 in A:
        A = {1}
print(list(A)[0])

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
a, *A = map(int, input().split())

for x in A:
    a = math.gcd(x, a)

print(a)
Problem p03137 (python)

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

X.sort()

x = X[:]
p = x.pop(0)
a = []
for b in x:
    a.append(b - p)
    p = b

if a:
    a.sort(reverse=True)
    print(sum(a[N-1:]))
else:
    print(0)

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

X.sort()

x = X[:]
p = x.pop(0)
a = []
for b in x:
    a.append(b - p)
    p = b

if a:
    for _ in range(N-1):
        a.pop(a.index(max(a)))
    print(sum(a))
else:
    print(0)
Problem p03221 (python)

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

x = [[] for _ in range(N)]
a = [None] * M
for i in range(M):
    P, Y = map(int, input().split())
    x[P-1].append(Y)
    a[i] = (P, Y)

y = {}
for i in range(N):
    x[i].sort()
    for j, Y in enumerate(x[i]):
        y[(i+1, Y)] = j + 1
for i in range(M):
    print('{}{}'.format(str(a[i][0]).zfill(6), str(y[a[i]]).zfill(6)))

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

x = {}
y = [None] * M
for i in range(M):
    P, Y = map(int, input().split())
    if P in x:
        x[P] += [Y]
    else:
        x[P] = [Y]
    y[i] = (P, Y)

for i in range(N):
    x[i+1].sort()

for i in range(M):
    P, Y = y[i]
    print('{}{}'.format(str(P).zfill(6), str(x[P].index(Y) + 1).zfill(6)))
Problem p02781 (python)

Fixed submission:


ar = input()

k = int(input())

l = len(ar)


DP = [[[-1] * 2 for j in range(103)] for i in range(102)]


def dp(i, j, fl):
    if i == l:
        if j == k:
            return 1
        else:
            return 0

    if DP[i][j][fl] != -1:
        return DP[i][j][fl]

    res = 0

   # print(i,j,fl)
    if fl:
        for p in range(10):

            res += dp(i+1, j + (p != 0) , fl == 1)
    else:
        ko = ord(ar[i]) - ord('0')
        for p in range(ko + 1):

            res += dp(i + 1, j + (p != 0), p < ko)
    DP[i][j][fl] = res
    return res

print(dp(0, 0, 0))

Buggy submission (verdict: Runtime Error):


ar = input()

k = int(input())

l = len(ar)


DP = [[[-1] * 2 for j in range(5)] for i in range(102)]


def dp(i, j, fl):
    if i == l:
        if j == k:
            return 1
        else:
            return 0

    if DP[i][j][fl] != -1:
        return DP[i][j][fl]

    res = 0

   # print(i,j,fl)
    if fl:
        for p in range(10):

            res += dp(i+1, j + (p != 0) , fl == 1)
    else:
        ko = ord(ar[i]) - ord('0')
        for p in range(ko + 1):

            res += dp(i + 1, j + (p != 0), p < ko)
    DP[i][j][fl] = res
    return res

print(dp(0, 0, 0))
Problem p02623 (python)

Fixed submission:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

"""
dp
time / books_no?
10 0 0
20 0 0
30 0 0
40 0 0
50 0 0
60 1 0
70 1 0
80 0 1




"""



N, M, K = LI()
A = LI()
B = LI()

"""
片方に注目して探索すればよい　

単純にfor,forだと計算量がまずいが，前回の値の部分から探索すればいいのでそこまで
計算量は増えない

"""

a = [0]
b = [0]

for i in range(N):
    a.append(a[-1] + A[i])

for i in range(M):
    b.append(b[-1] + B[i])

# print(a)
ans = 0
j = M
for i in range(N + 1):
    if a[i] > K:
        break
    while b[j] > K - a[i]:
        j -= 1
    ans = max(ans, i + j)
print(ans)

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

"""
dp
time / books_no?
10 0 0
20 0 0
30 0 0
40 0 0
50 0 0
60 1 0
70 1 0
80 0 1




"""



N, M, K = LI()
A = LI()
B = LI()

a = [0 for i in range(2 * 10 ** 5)]
b = [0 for i in range(2 * 10 ** 5)]
a_sum = [0 for i in range(2 * 10**5)]
b_sum = [0 for i in range(2 * 10 ** 5)]

time = 0
sum_a = 0
for i in range(N):
    time += A[i]
    if time > 2 * 10 ** 5:
        break
    a[time] += 1

time = 0
for j in range(M):
    time += B[j]
    if time > 2 * 10 ** 5:
        break
    b[time] += 1

s_a = 0
s_b = 0
for time in range(2*10 **5):
    s_a += a[time]
    a_sum[time] = s_a
    s_b += b[time]
    b_sum[time] = s_b

ans = 0
for i in range(K):
    ans = max(ans, a_sum[i] + b_sum[K - i])
print(ans)
Problem p02862 (python)

Fixed submission:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7

#modに対応して高速なコンビネーションが求められる
# 階乗 & 逆元計算



d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

X,Y = LI()

if (X + Y) % 3 != 0:
    ans = 0
else:
    n = 10 ** 6
    factorial = [1]
    inverse = [1]
    for i in range(1, n+2):
        factorial.append(factorial[-1] * i % mod)
        inverse.append(pow(factorial[-1], mod-2, mod))

    def combinations_count(n,r):
        if n-r < 0:
            return 0
        return factorial[n]*inverse[r]*inverse[n-r]%mod
    m = int(X * 2 / 3 - Y / 3)
    n = int(Y * 2 / 3 - X / 3)
    if (X+Y) / 3 > X or (X + Y) / 3 > Y or m < 0 or n < 0:
        ans = 0
    else:
        ans = combinations_count((X + Y)//3, n)
print(ans)

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7

#modに対応して高速なコンビネーションが求められる
# 階乗 & 逆元計算



d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

X,Y = LI()

if (X + Y) % 3 != 0:
    ans = 0
else:
    n = 10 ** 4
    factorial = [1]
    inverse = [1]
    for i in range(1, n+2):
        factorial.append(factorial[-1] * i % mod)
        inverse.append(pow(factorial[-1], mod-2, mod))

    def combinations_count(n,r):
        if n-r < 0:
            return 0
        return factorial[n]*inverse[r]*inverse[n-r]%mod
    m = int(X * 2 / 3 - Y / 3)
    n = int(Y * 2 / 3 - X / 3)
    if (X+Y) / 3 > X or (X + Y) / 3 > Y or m < 0 or n < 0:
        ans = 0
    
    else:
        ans = combinations_count(m + n, n)
print(ans)
Problem p02989 (python)

Fixed submission:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

import numpy as np
N = int(input())
d = LI()
d.sort()
cnt = 0
ans = d[N//2]-d[N//2-1]
print(ans)

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

import numpy as np
N = int(input())
d = LI()
d.sort()
cnt_k = np.array([0 for i in range(max(d))])

for i in range(N):
    cnt_k[:d[i]] += 1

print(np.count_nonzero(cnt_k==N//2))
Problem p03038 (python)

Fixed submission:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

N,M = map(int,input().split())
A = [int(i) for i in input().split()]
change = [0 for i in range(M)]
for i in range(M):
    change[i] = [int(i) for i in input().split()]

D = []
change = sorted(change,key=lambda x:x[1],reverse=True)
for i in range(M):
    b,c = change[i]
    for j in range(b):
        D += [c]
    if len(D) > N:
        break

A += D
A.sort(reverse=True)
print(sum(A[:N]))

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

N,M = map(int,input().split())
A = [int(i) for i in input().split()]
change = [0 for i in range(M)]
for i in range(M):
    change[i] = [int(i) for i in input().split()]

D = []
for i in range(M):
    b,c = change[i]
    D += [c]*b

D.sort()
D.reverse()

A.sort()
ans = sum(A)
for i in range(len(D)):
    if D[i]-A[i] < 0:
        break
    else:
        ans += D[i]-A[i]
print(ans)

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

N,M = map(int,input().split())
A = [int(i) for i in input().split()]
change = [0 for i in range(M)]
for i in range(M):
    change[i] = [int(i) for i in input().split()]

A.sort()
change = sorted(change,key=lambda x:x[1])
change.reverse()

ans = 0
b,c = change[0]
for i in range(N):
    if A[i] > c:
        break
partA = A[:i]

ans += sum(A[i:])
# print(partA)
# print(ans)
for i in range(M):
    count,value = change[i]
    if len(partA) == 0:
        break
    if partA[0] > value:
        break
    for j in range(count):
        if partA[j] < value:
            partA[j] = value
            ans += value
    partA = list(filter(lambda partA:partA != value,partA))
    partA.sort()


ans += sum(partA)
print(ans)

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

N,M = map(int,input().split())
A = [int(i) for i in input().split()]
change = [0 for i in range(M)]
for i in range(M):
    change[i] = [int(i) for i in input().split()]

A.sort()
change = sorted(change,key=lambda x:x[1])
change.reverse()

ans = 0
b,c = change[0]
for i in range(N):
    if A[i] > c:
        break
partA = A[:i]

ans += sum(A[i:])
# print(partA)
# print(ans)
for i in range(M):
    count,value = change[i]
    if partA[0] > value:
        break
    for j in range(count):
        if partA[j] < value:
            partA[j] = value
            ans += value
    partA = list(filter(lambda partA:partA != value,partA))
    partA.sort()


ans += sum(partA)
print(ans)
Problem p03041 (python)

Fixed submission:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7

N,K = map(int,input().split())
S = str(input())

replace = S[K-1]
replace = replace.lower()

print(S[:K-1]+replace+S[K:])

Buggy submission (verdict: Runtime Error):
    # encoding:utf-8
    import copy
    import random
    import bisect #bisect_left　これで二部探索の大小検索が行える
    import fractions #最小公倍数などはこっち
    import math
     
    mod = 10**9+7
     
    N,K = map(int,input().split())
    S = str(input())
     
    replace = S[K-1]
    replace = replace.lower()
     
    print(S[:K-1]+replace+S[K:])
Problem p03045 (python)

Fixed submission:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000


N,M = map(int,input().split())
tree = [[] for i in range(N)]
for i in range(M):
    X,Y,Z = map(int,input().split())
    X -= 1
    Y -= 1
    tree[X] += [Y]
    tree[Y] += [X]

# print(tree)
used = [0 for i in range(N)]

def dfs(node,p):
    used[node] = 1
    # print(tree[node])
    for new in tree[node]:
        if new == p or used[new] == 1:continue
        dfs(new,node)

cnt = 0
while sum(used) < len(used):
    for i in range(N):
        if used[i] == 0:
            dfs(i,-1)
            cnt += 1

ans = N - (sum(used) - cnt)
print(ans)

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7

N,M = map(int,input().split())
tree = [[] for i in range(N)]
for i in range(M):
    X,Y,Z = map(int,input().split())
    X -= 1
    Y -= 1
    tree[X] += [Y]
    tree[Y] += [X]

# print(tree)
used = [0 for i in range(N)]

def dfs(node,p):
    used[node] = 1
    # print(tree[node])
    for new in tree[node]:
        if new == p or used[new] == 1:continue
        dfs(new,node)

cnt = 0
while sum(used) < len(used):
    for i in range(N):
        if used[i] == 0:
            dfs(i,-1)
            cnt += 1

ans = N - (sum(used) - cnt)
print(ans)
Problem p03107 (python)

Fixed submission:
# encoding:utf-8
import copy
import numpy as np
import random
# import pandas as pd
# import torch


s = list(str(input()))


count = [0,0]
for i in range(len(s)):
    count[int(s[i])] += 1

ans = 2*min(count[0],count[1])
#
print(ans)
# escape = False
# begin = len(s)
#
# def rem(s):
#     for i in range(1,len(s)):
#         # print(s)
#         if s[i-1] != s[i]:
#             s.pop(i)
#             s.pop(i-1)
#             break
#     return s
#
#
# pre = len(s)
# proceed = 0
# while proceed != pre:
#     pre = len(s)
#     s = rem(s)
#     after = len(s)
#
# end = len(s)
# print(begin-end)

Buggy submission (verdict: Runtime Error):
# encoding:utf-8
import copy
import numpy as np
import random
import pandas as pd
import torch


s = list(str(input()))

escape = False
begin = len(s)

def rem(s):
    for i in range(1,len(s)):
        # print(s)
        if s[i-1] != s[i]:
            s.pop(i)
            s.pop(i-1)
            break
    return s


for i in range(10**4):
    s = rem(s)

end = len(s)
print(begin-end)
Problem p03242 (python)

Fixed submission:
#encoding utf-8

n = list(str(input()))

for i in range(len(n)):
    if n[i] == "1":
        n[i] = "to9"
    if n[i] == "9":
        n[i] = "to1"

for i in range(len(n)):
    if n[i] == "to9":
        n[i] = "9"
    elif n[i] == "to1":
        n[i] = "1"

print("".join(n))

Buggy submission (verdict: Runtime Error):
#encoding utf-8
from collections import Counter
def main(n,v):
    odd = Counter(v[0::2]).most_common(2) + [(0,0)]
    even = Counter(v[1::2]).most_common(2) + [(0,0)]

    if odd[0][0] == even[0][0]:
        ans = min(n-odd[0][1]-even[1][1],
        n-odd[1][1]-even[0][1])
    else:
        ans = n-odd[0][1]-even[0][1]
    print(ans)


if __name__ == "__main__":
    n = int(input())
    v = list(int(i) for i in input().split())
    main(n,v)
Problem p03327 (python)

Fixed submission:
#encoding utf-8


n = int(input())

if n > 999:
    print("ABD")

else:
    print("ABC")

Buggy submission (verdict: Runtime Error):
#encoding utf-8


n = input()

if n > 999:
    print("ABD")

else:
    print("ABC")
Problem p02570 (python)

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

if T-D/S >= 0:
    print("Yes")
else:
    print("No")

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

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

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


if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
x,y,z = int(input().split())
D=x
T=y
S=z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
x,y,z = int(input().split())
int D=int x
int T=int y
int S=int z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
input().split()

x,y,z = input().split()
D=int x
T=int y
S=int z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
x,y,z = map(int, input().split())
D=int x
T=int y
S=int z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
x,y,z = input()

D=int x
T=int y
S=int z

if T-D/S>= 0
    print("Yes")
  else:
    print("No")

Buggy submission (verdict: Runtime Error):
x,y,z = input()

D=int x
T=int y
S=int z

if T-D/S>= 0
    print("Yes")
  else print("No")

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


if T-D/S >= 0
	print("Yes")
  
  else print("No")
Problem p02594 (python)

Fixed submission:
x=int(input())

if x>=30:
  print('Yes')
else:
  print('No')

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

if x>=30:
  print('Yes')
else:
  print('No')

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

if x>=30:
  print('Yes')
else:
  print('No')
Problem p02729 (python)

Fixed submission:
n,m= map(int, input().split())
 
print(int(((n*(n-1))+m*(m-1))/2))

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

print(((n+(n-1))+m(m-1))/2)
Problem p02759 (python)

Fixed submission:
n=int(input())
if n%2==0:
  print(int(n/2))
if not n%2==0:
  print(int(n/2+1))

Buggy submission (verdict: Runtime Error):
n=input()
if n%2==0:
  print(n/2)
if not n%2==0:
  print(n/2+1)
Problem p02915 (python)

Fixed submission:
n=int(input())

print(n**3)

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

print(n**3)

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

print(n**3)
Problem p02785 (python)

Fixed submission:
import math

temp = input().split(' ')
monter_count = int(temp[0])
kill_count = int(temp[1])
 
temp = input().split(' ')
# 数値の配列に変換
temp = [int(s) for s in temp]
# 体力の多い順にソート
temp.sort(reverse=True)
del(temp[0:kill_count])

print(sum(temp))

Buggy submission (verdict: Runtime Error):
temp = input().split(' ')
monter_count = int(temp[0])
kill_count = int(temp[1])

temp = input().split(' ')
# 数値の配列に変換
temp = [int(s) for s in temp]
# 体力の多い順にソート
temp.sort(reverse=True)
del(temp[0:monter_count])
print(temp.sum())