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

Fixed submission:
(s, t) = input().split()
a = input().split()
(n, m) = list(map(int, a))
u = input()
if u == s:
    print(n - 1, m)
elif u == t:
    print(n, m - 1)

Buggy submission (verdict: Runtime Error):
(s,t)=input().split()
a=input()
(n,m)=list(map(int,a))
u=input()
if u==s:
  print(n-1,m)
elif u==t:
  print(n,m-1)
Problem p02596 (python)

Fixed submission:
k=int(input())
a=[]
judge=0
a.append("")
a.append(7%k)
for i in range(2,k+1):
    a.append((a[i-1]*10+7)%k)
for i in range(1,k+1):
    if a[i]==0:
        print(i)
        judge=1
        break
if judge==0:
    print(-1)

Buggy submission (verdict: Runtime Error):
k=int(input())
i=1
if k%7==0:
    while (10**i)%(9*k/7)!=1:
        i+=1

else:
    while (10**i)%(9*k)!=1:
        i+=1



print(i)

Buggy submission (verdict: Runtime Error):
#include<iostream>
using namespace std;

int main(){
    int k;
    int n=7;
    int count=1;

    cin>>k;

    while(n%k != 0){
        if(k%2==0){
            count=-1;
            break;
        }
        else if(k%5==0){
            count=-1;
            break;
        }
        n=10*n+7;
        count++;
    }
    cout<<count<<"\n";

}

Buggy submission (verdict: Runtime Error):
#include<iostream>
using namespace std;

int main(){
    int k;
    int n=7;
    int count=1;

    cin>>k;

    while(n%k != 0){
        if(k%2=0){
            count=-1;
            break;
        }
        else(k%5=0){
            count=-1;
            break;
        }
        n=10*n+7;
        count++;
    }
    cout<<count<<"\n";

}
Problem p02659 (python)

Fixed submission:
A, B = input().split(' ')
print(int(A) * int(B.replace('.', '')) // 100)

Buggy submission (verdict: Runtime Error):
import math

a,b=int(input()),float(input())
print((math.floor(float(a*b))))
Problem p03042 (python)

Fixed submission:
n=input()

n1,n2=int(n[:2]),int(n[2:])
if (n1>12 and n2>12) or (n1==0 and n2==0):
    print("NA")
elif (n1!=0 and n1<=12) and (n2!=0 and n2<=12):
    print("AMBIGUOUS")
elif n1!=0 and n1<=12:
    print("MMYY")
elif n2!=0 and n2<=12:
    print("YYMM")
else:
    print("NA")

Buggy submission (verdict: Runtime Error):

n1,n2=int(n[:2]),int(n[2:])
if (n1>12 and n2>12) or (n1==0 and n2==0):
    print("NA")
elif (n1!=0 and n1<=12) and (n2!=0 and n2<=12):
    print("AMBIGUOUS")
elif n1!=0 and n1<=12:
    print("MMYY")
elif n2!=0 and n2<=12:
    print("YYMM")
else:
    print("errer")
Problem p02819 (python)

Fixed submission:
def main():
	x = int(input())
	while not IsPrime(x):
		x += 1
	print(x)

def IsPrime(n):
	if n < 2:
		return False
	elif n == 2:
		return True
	elif n % 2 == 0:
		return False
	
	sqrtN = int(n**0.5)
	for i in range(3, sqrtN, 2):
		if n%i == 0:
			return False
	return True

if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
# coding: utf-8
import pkg
from itertools import combinations as comb
import numpy as np


# 参考:
# エラトステネスの篩
# https://blog.mktia.com/how-to-output-prime-numbers-in-python/
# https://python.ms/eratosthenes/#_2-%E9%AB%98%E9%80%9F%E7%89%88

	# p:素数　a:任意の自然数
	# a**p≡a mod p
	# a**(p-1)≡1 (mod p) ※Pで割ったあまりが1
	
	
def main():
	x = int(input())
	while not IsPrime(x):
		x += 1
	print(x)

def IsPrime(n):
	if n < 2:
		return False
	elif n == 2:
		return True
	elif n % 2 == 0:
		return False
	
	sqrtN = int(n**0.5)
	for i in range(3, sqrtN, 2):
		if n%i == 0:
			return False
	return True


def primes(n):
	is_prime = [True] * (n + 1)
	is_prime[0] = False
	is_prime[1] = False
	for i in range(2, int(n**0.5) + 1):
		if not is_prime[i]:
			continue
		for j in range(i * 2, n + 1, i):
			is_prime[j] = False
	return [i for i in range(n + 1) if is_prime[i]]


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

Fixed submission:
def main():
	N = int(input())
	a = list(map(int, input().split()))
	num = 1
	cnt = 0
	if 1 not in a:
		print(-1)
	else:
		for i in range(N):
			if a[i] == num:
				num += 1
			else:
				cnt += 1
		print(cnt)



if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
def main():
	N = int(input())
	a = list(map(int, input().split()))
	if 1 not in a:
		print(-1)
	else:
		ans = solve(1,a,0)
		print(ans)


def solve(n,a,b):
	if n in a:
		idx = a.index(n)
		b += idx
		return solve(n+1, a[idx+1:],b)
	else:
		return b


if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
def main():
	N = int(input())
	a = list(map(int, input().split()))
	if 1 not in a:
		print(-1)
		exit
	ans = test(1,a,0)
	print(ans)


def test(n,a,b):
	if n in a:
		idx = a.index(n)
		b += idx
		return test(n+1, a[idx+1:],b)
	else:
		return b


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

Fixed submission:
import math
def main():
	N = int(input())
	if N%2 == 1 or N==0:
		print(0)
	else:
		N = N//2
		P = int(math.log(N,5))
		ans = [ N//(5**p) for p in range(1,P+1)]
		print(sum(ans))

if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
import math
def main():
	N = int(input())
	P = int(math.log(N,5))
	ans = 0
	if N%2 == 1:
		print(0)
	else:
		N = int(N/2)
		ans = [ int(N/(5**p)) for p in range(1,P+1)]
		print(sum(ans))

if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
import math
def main():
	N = int(input())
	P = int(math.log(N,5))
	ans = 0
	if N%2 == 1:
		print(0)
	else:
		ans = [int((N/2)/int(pow(5,p))) for p in range(1,P)]
		print(sum(ans)+1)

if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
import math
def main():
	N = int(input())
	P = int(math.log(N,5))
	ans = 0
	if N%2 == 1:
		print(0)
	else:
		ans = [int((N/2)/int(pow(5,p))) for p in range(P)]
		print(sum(ans)+1)

if __name__ == '__main__':
	main()

Buggy submission (verdict: Runtime Error):
import math
def main():
	N = int(input())
	P = int(math.log(N,5))
	ans = 0
	
	ans = [int((N/2)/pow(5,p)) for p in range(1,P)]
	print(sum(ans))


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

Fixed submission:
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Buggy submission (verdict: Runtime Error):
a = int(input())
s = input()
  if a <= 3200:
    print(s)
else:
    print("red")
Problem p03045 (python)

Fixed submission:
import sys
sys.setrecursionlimit(1000000)

class UnionFind:
	def __init__(self, n=1):
		self.par = [ i for i in range(n)]
		self.size = [0] * n

#   木の根を求める
	def root(self, x):
		if self.par[x] == x:
			return x
		else:
			self.par[x] = self.root(self.par[x])
			return self.par[x]


#   x を含むグループと y を含むグループをマージする
	def merge(self, x, y):
		x = self.root(x)
		y = self.root(y)
		if x == y:
			return
		self.par[x] = y

if __name__ == '__main__':
	N, M = map(int, input().split())
	uf = UnionFind(N)
	for i in range(M):
		X, Y, Z = map(int, input().split())
		uf.merge(X-1, Y-1)
	
	ans = [ uf.root(i) for i in range(N)]

	print(len(set(ans)))

Buggy submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(1000)

class UnionFind:
	def __init__(self, n=1):
		self.par = [ i for i in range(n)]
		self.size = [0] * n

#   木の根を求める
	def root(self, x):
		if self.par[x] == x:
			return x
		else:
			self.par[x] = self.root(self.par[x])
			return self.par[x]


#   x を含むグループと y を含むグループをマージする
	def merge(self, x, y):
		x = self.root(x)
		y = self.root(y)
		if x == y:
			return
		self.par[x] = y

if __name__ == '__main__':
	N, M = map(int, input().split())
	uf = UnionFind(N)
	for i in range(M):
		X, Y, Z = map(int, input().split())
		uf.merge(X-1, Y-1)
	
	ans = [ uf.root(i) for i in range(N)]

	print(len(set(ans)))

Buggy submission (verdict: Runtime Error):
class UnionFind:
	def __init__(self, n=1):
		self.par = [ i for i in range(n)]
		self.size = [0] * n

#   木の根を求める
	def root(self, x):
		if self.par[x] == x:
			return x
		else:
			self.par[x] = self.root(self.par[x])
			return self.par[x]


#   x を含むグループと y を含むグループをマージする
	def merge(self, x, y):
		x = self.root(x)
		y = self.root(y)
		if x == y:
			return
		self.par[x] = y

if __name__ == '__main__':
	N, M = map(int, input().split())
	uf = UnionFind(N)
	for i in range(M):
		X, Y, Z = map(int, input().split())
		uf.merge(X-1, Y-1)
#		print(uf.par)
	
	ans = [ uf.root(i) for i in range(N)]

	print(len(set(ans)))
Problem p02948 (python)

Fixed submission:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect


visit = []

def aaa(ind_lim, dame_num):
    global visit
    if ind_lim >= dame_num:
        return -1
    elif visit[ind_lim] == -1:
        return -1
    elif visit[ind_lim] == 0:
        return ind_lim
    else:
        visit[ind_lim] = aaa(visit[ind_lim], dame_num)
        return visit[ind_lim]

def main():
    num, max_num = map(int, input().split())
    data = [list(map(int, input().split())) for i in range(num)]

    data.sort(key=lambda x:(-x[1]))
    # for

    global visit
    visit = [0 for i in range(max_num + 1)]

    ans = 0

    for i in range(num):
        day, value = data[i]
        ind_lim = day
        # print(i, num, visit)
        ind_insert = aaa(ind_lim, max_num + 1)
        if ind_insert != -1:
            visit[ind_insert] = ind_insert + 1
            ans += value

    # print('uuu')
    print(ans)







if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect


from math import factorial
# 組み合わせ
def combinations_count(n, r):
    return factorial(n) // (factorial(n - r) * factorial(r))


def check(left, right, num, max_num, data):
    half = (left + right) // 2
    kari = 0


def main():
    num, max_num = map(int, input().split())
    data = [list(map(int, input().split())) for i in range(num)]

    data.sort(key=lambda x: (-x[1]))

    visit = [0 for i in range(max_num + 1)]

    ans = 0
    left = 0
    # print(data)
    for i in range(num):
        day, value = data[i]
        for j in range(left, max_num + 1 - day)[::-1]:
            if visit[j] == 0:
                ans += value
                visit[j] = 1
                break
        else:
            left = max_num - day
    # print(visit)
    print(ans)







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

Fixed submission:
from collections import defaultdict
import math

from math import factorial
# 組み合わせ
def combinations_count(n, r):
    return factorial(n) // (factorial(n - r) * factorial(r))

def main():
    num, k_bleu = map(int, input().split())
    red_num = num - k_bleu

    # ans = 0
    mod = 10 ** 9 + 7
    for i in range(k_bleu):
        kaisuu = i + 1
        if i >= min(k_bleu, red_num + 1):
            print(0)
        else:
            ans = combinations_count(red_num + 1, kaisuu) * combinations_count(k_bleu - 1, kaisuu - 1)
            ans %= mod
            print(ans)








if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
from collections import defaultdict
import math

from math import factorial
# 組み合わせ
def combinations_count(n, r):
    return factorial(n) // (factorial(n - r) * factorial(r))

def main():
    num, k_bleu = map(int, input().split())
    red_num = num - k_bleu

    # ans = 0
    mod = 10 ** 9 + 7
    for i in range(k_bleu):
        kaisuu = i + 1
        ans = combinations_count(red_num + 1, kaisuu) * combinations_count(k_bleu - 1, kaisuu - 1)
        ans %= mod
        print(ans)








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

Fixed submission:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math

def main():
    kouji_num, person_num = map(int, input().split())
    koji_data = [list(map(int, input().split())) for i in range(kouji_num)]
    person_data = [int(input()) for i in range(person_num)]

    event_list = [0 for i in range(kouji_num * 2)]
    now_kouji = set()

    for i in range(kouji_num):
        start, fin, position = koji_data[i]
        event_list[2 * i] = (start - position - 0.25, 1, position)
        event_list[2 * i + 1] = (fin - position - 0.75, 0, position)
    event_list.sort(key=lambda x: x[0])

    ans = 10 ** 9 + 1
    now_ind = 0
    for i in range(person_num):
        person_start = person_data[i]
        while now_ind < kouji_num * 2:
            time_data, flg, position = event_list[now_ind]
            if time_data > person_start:
                break

            if flg:
                now_kouji.add(position)
                ans = min(ans, position)
            else:
                now_kouji.remove(position)
                if len(now_kouji) == 0:
                    ans = 10 ** 9 + 1
                elif ans == position:
                    ans = min(now_kouji)

            now_ind += 1
        if ans == 10 ** 9 + 1:
            print(-1)
        else:
            print(ans)





if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math

def main():
    kouji_num, person_num = map(int, input().split())
    koji_data = [list(map(int, input().split())) for i in range(kouji_num)]
    person_data = [int(input()) for i in range(person_num)]

    event_list = [0 for i in range(kouji_num * 2)]
    now_kouji = set()

    for i in range(kouji_num):
        start, fin, position = koji_data[i]
        event_list[2 * i] = (start - position, 1, position)
        event_list[2 * i + 1] = (fin - position, 0, position)
    event_list.sort(key=lambda x: x[0])

    now_ind = 0
    for i in range(person_num):
        person_start = person_data[i]
        while now_ind < kouji_num * 2:
            time_data, flg, position = event_list[now_ind]
            if time_data > person_start:
                break
            if flg:
                now_kouji.add(position)
            else:
                now_kouji.remove(position)
            now_ind += 1
        if len(now_kouji) == 0:
            ans = -1
        else:
            ans = min(now_kouji)
        print(ans)





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

Fixed submission:

def calc_data(data):
    count = 0
    c_0, c_1 = 0, 0
    for i in range(len(data)):
        if data[i] == '0':
            if c_1 > 0:
                count += 2
                c_1 -= 1
            else:
                c_0 += 1
        if data[i] == '1':
            if c_0 > 0:
                count += 2
                c_0 -= 1
            else:
                c_1 += 1
    print(count)

def main():
    data = input()
    calc_data(data)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):

length = 0
ans = 0

def remove_data(data, ind_pre, ind_after):
    if ind_pre == 0:
        data_pre = ''
    else:
        data_pre = data[:ind_pre]
    if ind_after == len(data) - 1:
        data_after = ''
    else:
        data_after = data[ind_after + 1:]
    data_remove = data_pre + data_after
    return data_remove

def calc_ans(data):
    global length, ans
    ans_kari = length - len(data)
    if ans_kari > ans:
        ans = ans_kari


def calc_data(data):
    for i in range(len(data) - 1):
        if data[i] != data[i + 1]:
            data_remove = remove_data(data, i, i+1)
            calc_data(data_remove)
    calc_ans(data)

def main():
    global length, ans
    data = input()
    length = len(data)
    calc_data(data)
    print(ans)


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

Fixed submission:

if __name__ == '__main__':
    ken_num, city_num = list(map(int, input().split()))
    data = []
    for i in range(city_num):
        element = list(map(int, input().split()))
        element.append(i)
        data.append(element)

    data = sorted(data, key=lambda x: (x[0], x[1]))

    count = 1
    ken_num = 1
    ans_data = {}

    for i in range(city_num):
        number = data[i][2]
        if data[i][0] != ken_num:
            count = 1
            ken_num = data[i][0]
        chr = "{0:06d}".format(ken_num) + "{0:06d}".format(count)
        ans_data.update({number:chr})
        count += 1

    for i in range(city_num):
        print(ans_data[i])

Buggy submission (verdict: Runtime Error):


if __name__ == '__main__':
    ken_num, city_num = list(map(int, input().split()))
    data = [list(map(int, input().split())).append(i) for i in range(city_num)]

    # ken_num, city_num = 2, 3
    # data = [[1,32,0], [2,63,1],[1,12,2]]

    data = sorted(data, key=lambda x: (x[0], x[1]))

    count = 1
    ken_num = 1
    ans_data = {}

    for i in range(city_num):
        number = data[i][2]
        if data[i][0] != ken_num:
            count = 1
            ken_num = data[i][0]
        chr = "{0:06d}".format(ken_num) + "{0:06d}".format(count)
        ans_data.update({number:chr})
        count += 1

    for i in range(city_num):
        print(ans_data[i])
Problem p02793 (python)

Fixed submission:
import fractions 

N = int(input())
A = list(map(int, input().split()))
MODE = 10**9+7

def lcm(a, b):
    return a*b//fractions.gcd(a,b)

_lcm = 1
for a in A:
    _lcm = lcm(a, _lcm)

ret = 0
for a in A:
    ret += (_lcm // a)

print(ret%MODE)

Buggy submission (verdict: Runtime Error):
import math 

N = int(input())
A = list(map(int, input().split()))
MODE = 10**9+7

def lcm(a, b):
    return a*b//math.gcd(a,b)

_lcm = 1
for a in A:
    _lcm = lcm(a, _lcm)

ret = 0
for a in A:
    ret += (_lcm // a)
    ret %= MODE

print(ret)

Buggy submission (verdict: Runtime Error):
import math 

N = int(input())
A = list(map(int, input().split()))
MODE = 10**9+7

def lcm(a, b):
    return a*b//math.gcd(a,b)

_lcm = 1
for a in A:
    _lcm = lcm(a, _lcm)

ret = 0
for a in A:
    ret += (_lcm // a)
    ret %= MODE

print(ret)
Problem p02820 (python)

Fixed submission:
# D - Prediction and Restriction
# https://atcoder.jp/contests/abc149/tasks/abc149_d


N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()

def opt(seg):
    # dp[STEP][R/P/S]
    dp = [ [-1, -1, -1] for _ in range(len(seg))]

    dp[0][0] = (R if seg[0] == 's' else 0)
    dp[0][1] = (P if seg[0] == 'r' else 0)
    dp[0][2] = (S if seg[0] == 'p' else 0)

    for i in range(1, len(seg)):
        dp[i][0] = (R if seg[i] == 's' else 0) + max(dp[i-1][1], dp[i-1][2])
        dp[i][1] = (P if seg[i] == 'r' else 0) + max(dp[i-1][0], dp[i-1][2])
        dp[i][2] = (S if seg[i] == 'p' else 0) + max(dp[i-1][0], dp[i-1][1])

    return max(dp[-1])

segs = list()

for K_idx in range(K):
    segs.append( T[K_idx::K] )

print('{}'.format(sum(map(opt, segs))))

Buggy submission (verdict: Runtime Error):
N, K = raw_input().split()
N, K = int(N), int(K)

R, S, P = raw_input().split()
R, S, P = int(R), int(S), int(P) 

T = raw_input()

his = list()
ret = 0

for i in range(N):
    if T[i] == 'r':
        if i-K >= 0 and his[i-K] == 'p':
            if i+K <= N and T[i+K] == 's':
                his.append('s')
            else:
                his.append('r')
        else:
            ret += P
            his.append('p')

    elif T[i] == 's':
        if i-K >= 0 and his[i-K] == 'r':
            if i+K <= N and T[i+K] == 'p':
                his.append('p')
            else:
                his.append('s')
        else:
            ret += R
            his.append('r')

    else: # T[i] == 'p'
        if i-K >= 0 and his[i-K] == 's':
            if i+K <= N and T[i+K] == 'r':
                his.append('r')
            else:
                his.append('p')
        else:
            ret += S
            his.append('s')
    
print '{}'.format(ret)
Problem p02829 (python)

Fixed submission:
A = int(input())
B = int(input())
s = 1 + 2 + 3
print '{}'.format(s-A-B)

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

s = 1 + 2 + 3
print '{}'.format(s-A-B)

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

s = 1 + 2 + 3
print('{}'.format(s-A-B))
Problem p03104 (python)

Fixed submission:
# D - XOR World
# https://atcoder.jp/contests/abc121/tasks/abc121_d


def xor_from0(n):
    if n % 4 == 0:
        return n
    elif n % 4 == 1:
        return 1
    elif n % 4 == 2:
        return n+1
    else: # n % 4 == 3
        return 0

A, B = map(int, raw_input().split())
print '{}'.format(xor_from0(A-1) ^ xor_from0(B))

Buggy submission (verdict: Runtime Error):
# D - XOR World
# https://atcoder.jp/contests/abc121/tasks/abc121_d

def two2ten(two):
    base = 1
    ten = 0
    for i in two:
        ten += i*base
        base *= 2
    return ten

def ten2two(ten):
    two = list()
    while ten > 0:
        two.append(ten%2)
        ten /= 2
    return two

def find_first_1(two):
    for two_id in range(len(two)):
        if two[two_id] == 1:
            return two_id

A, B = map(int, raw_input().split())
b = ten2two(B)
pos1 = find_first_1(b)
ret = [0]*len(b)
t = B - A + 1

while t > 0:
    for b_id in range(len(b)):
        ret[b_id] += b[b_id]

    b[pos1] = 0
    for b_id in range(0, pos1):
        b[b_id] = 1

    pos1 = find_first_1(b)
    t -= 1

for ret_id in range(len(ret)):
    ret[ret_id] %= 2

print '{}'.format(two2ten(ret))
Problem p03127 (python)

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

while len(A) != 1:
    minA = min(A)

    nextA = set()
    for Ai in A:
        if Ai == minA:
            nextA.add(Ai)
            continue
        if Ai % minA != 0:
            nextA.add(Ai%minA)

    A = nextA

A = list(A)
print '{}'.format(A[0])

Buggy submission (verdict: Runtime Error):
# C - Monsters Battle Royale
# https://atcoder.jp/contests/abc118/tasks/abc118_c

N = int(input())
A = set(map(int, raw_input().split()))

while len(A) != 1:

    # minimum number of A
    minA = min(A)

    # next round A
    nA = set(), nA.add(minA)

    for Ai in A:
        if Ai % minA != 0 and Ai != minA:
            nA.add(Ai%minA)

    # update for next round
    A = nextA

print '{}'.format( list(A)[-1])
Problem p02570 (python)

Fixed submission:
D, T, S = input().split()
sum_price = int(T) * int(S)
if int(D) <= sum_price:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
D, T, S = input().split()
sum = T * S
if D < sum
	return "Yes"
else
	return "No"

Buggy submission (verdict: Runtime Error):
put D
Problem p02847 (python)

Fixed submission:
S = input()

week = {"SAT":1, "SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3,"FRI":2}

ans = week[S]

print(ans)

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

week = {"SUT":1, "SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3,"FRI":2}

ans = week[S]

print(ans)

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

week = {"SUT":1, "SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3,"FRI":2}

ans = week[S]

print(ans)

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

week = {"SUT":1, "SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3,"FRI":2}

print(week[S])
Problem p02570 (python)

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

Buggy submission (verdict: Runtime Error):
D,T,S=[int(input()) for i in range(3)]
if D/S<=T:
    print('Yes')
else:
    print('No')