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

Fixed submission:
import sys
N, M = map(int, input().split())
sys.setrecursionlimit(10**5)
E = [[] for _ in range(N)]
for i in range(M):
    x, y = map(int, input().split())
    E[x-1].append(y-1)

dp = [-1]*N


def rec(v):
    if dp[v] != -1:
        return dp[v]
    if len(E[v]) == 0:
        dp[v] = 0
        return dp[v]

    for to in E[v]:
        dp[v] = max(dp[v], rec(to)+1)
    return dp[v]


for i in range(N):
    dp[i] = rec(i)
print(max(dp))

Buggy submission (verdict: Runtime Error):
import sys
from functools import lru_cache

N, M = map(int, input().split())
sys.setrecursionlimit(10**5)
E = [[] for _ in range(N)]
for i in range(M):
    x, y = map(int, input().split())
    E[x-1].append(y-1)

dp = [-1]*N


@lru_cache(maxsize=None)
def rec(v):
    if len(E[v]) == 0:
        dp[v] = 0
        return dp[v]

    for to in E[v]:
        dp[v] = max(dp[v], rec(to)+1)
    return dp[v]


for i in range(N):
    dp[i] = rec(i)
print(max(dp))

Buggy submission (verdict: Runtime Error):
import sys
from functools import lru_cache

N, M = map(int, input().split())
sys.setrecursionlimit(10**5)
E = [[] for _ in range(N)]
for i in range(M):
    x, y = map(int, input().split())
    E[x-1].append(y-1)

dp = [-1]*N


@lru_cache(maxsize=10**5)
def rec(v):
    if len(E[v]) == 0:
        dp[v] = 0
        return dp[v]

    for to in E[v]:
        dp[v] = max(dp[v], rec(to)+1)
    return dp[v]


for i in range(N):
    dp[i] = rec(i)
print(max(dp))

Buggy submission (verdict: Runtime Error):
import sys
N, M = map(int, input().split())
sys.setrecursionlimit(N)
E = [[] for _ in range(N)]
for i in range(M):
    x, y = map(int, input().split())
    E[x-1].append(y-1)

dp = [-1]*N


def rec(v):
    if dp[v] != -1:
        return dp[v]
    if len(E[v]) == 0:
        dp[v] = 0
        return dp[v]

    for to in E[v]:
        dp[v] = max(dp[v], rec(to)+1)
    return dp[v]


for i in range(N):
    dp[i] = rec(i)
print(max(dp))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
E = [[] for _ in range(N)]
for i in range(M):
    x, y = map(int, input().split())
    E[x-1].append(y-1)

dp = [-1]*N


def rec(v):
    if dp[v] != -1:
        return dp[v]
    if len(E[v]) == 0:
        dp[v] = 0
        return dp[v]

    for to in E[v]:
        dp[v] = max(dp[v], rec(to)+1)
    return dp[v]


for i in range(N):
    dp[i] = rec(i)
print(max(dp))
Problem p02606 (python)

Fixed submission:
l,r,d=map(int, input().split())
sum = 0
for i in range(l,r+1):
    if i % d == 0:
        sum += 1
print(sum)

Buggy submission (verdict: Runtime Error):
l,r,d=map(int, split())
sum = 0
for i in range(l,r+1):
    if i % 2 == 0:
        sum += 1
print(sum)
Problem p04044 (python)

Fixed submission:
n, l = map(int, input().split())
a = [input() for i in range(n)]
a.sort()
 
print("".join(a))

Buggy submission (verdict: Runtime Error):
n,b=list(input().split())

a=[input() for i in range(n)]

print(''.join(a))
Problem p03844 (python)

Fixed submission:
A,B,C = input().split()
if B is "+":
    n = int(A) + int(C)
    print(n)
elif B is "-":
    n = int(A) - int(C)
    print(n)

Buggy submission (verdict: Runtime Error):
A,B,C=(int(x) for x in input().split())
if B is "+":
    n = int(A) + int(C)
    print(n)
elif B is "-":
    n = int(A) - int(C)
    print(n)
Problem p02612 (python)

Fixed submission:
N=int(input())
a=N//1000
if N%1000==0:
  print(0)
else:
  print(1000*(a+1)-N)

Buggy submission (verdict: Runtime Error):
N=int(input())
a=N//1000
if N%1000=0:
  print(0)
else:
  print(1000*(a+1)-N)
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
N=int(input())
L=list(map(int,input().split()))
a=1
for i in range(N):
  a=a*L[i]
if a>10**18:
  print(-1)
else:
  print(a)
Problem p02713 (python)

Fixed submission:
n = int(input())
total = 0

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

	return gcd(b, a % b)

total = total + n * (n+1) / 2

for i in range(n):
	for j in range(i+1,n):
		total = total + 6 * gcd(j+1,i+1)

for i in range(n):
	for j in range(i+1,n):
		for k in range(j+1,n):
			l = gcd(j+1,k+1)
			if i < l:
				total = total + 6 * gcd(l,i+1)
			else:
				total = total + 6 * gcd(i+1,l)

print(int(total))

Buggy submission (verdict: Runtime Error):
n = input()
total = 0

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

	return gcd(b, a % b)

total = total + n * (n+1) / 2

for i in range(n):
	for j in range(i+1,n):
		total = total + 6 * gcd(j+1,i+1)

for i in range(n):
	for j in range(i+1,n):
		for k in range(j+1,n):
			l = gcd(j+1,k+1)
			if i < l:
				total = total + 6 * gcd(l,i+1)
			else:
				total = total + 6 * gcd(i+1,l)

print(int(total))

Buggy submission (verdict: Runtime Error):
import sys

n = int(sys.argv[1])
total = 0

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

	return gcd(b, a % b)

total = total + n * (n+1) / 2

for i in range(n):
	for j in range(i+1,n):
		total = total + 6 * gcd(j+1,i+1)

for i in range(n):
	for j in range(i+1,n):
		for k in range(j+1,n):
			l = gcd(j+1,k+1)
			if i < l:
				total = total + 6 * gcd(l,i+1)
			else:
				total = total + 6 * gcd(i+1,l)

print(int(total))
Problem p02582 (python)

Fixed submission:
S = input()

R = []
r = 0
for s in S:
    if s == "R":
        r += 1
    if s == "S":
        R.append(r)
        r = 0
    R.append(r)

print(max(R))

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

R = []
r = 0
for s in S:
    if s == "R":
        r += 1
    if s == "S":
        R.append(r)
        r = 0

print(max(R))
Problem p02911 (python)

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

A = [int(input()) for _ in range(Q)]

Point = [ 0 for _ in range(N)]

if K-1 >= Q:
    for _ in range(N):
        print("Yes")

else:
    for a in A:
        Point[a-1] += 1

    for p in Point:
        if K - Q + p > 0:
            print("Yes")
        else:
            print("No")

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

A = [int(input()) for _ in range(Q)]

Point = [ 0 for _ in range(Q)]

for a in A:
    Point[a-1] += 1

for p in Point:
    if K - (K - p) > 0:
        print("Yes")
    else:
        print("No")
Problem p03076 (python)

Fixed submission:
num = [int(input()) for _ in range(5)]
num2 = [n if n % 10 == 0 else n - (n%10) + 10  for n in num]

c = []
for i, j  in enumerate(num):
    n = j
    for k,l in enumerate(num2):
        if  k == i:
            continue
        else:
            n += l
    c.append(n)

print(int(min(c)))

Buggy submission (verdict: Runtime Error):
import math
 
num = [int(input()) for _ in range(5)]
num2 = [n if n % 10 == 0 else n - (n%10) + 10  for n in num]

c = []
for i, j  in enumerate(num):
	n = j
	for k,l in enumerate(num2):
		if  k == i:
			continue
        else:
			n += l
	c.append(n)

print(min(c))

Buggy submission (verdict: Runtime Error):
import math
 
num = [int(input()) for _ in range(5)]
num2 = [n if n % 10 == 0 else n - (n%10) + 10  for n in num]

c = []
for i, j  in enumerate(num):
    n = j
    for k,l in enumerate(num2):
        if  k == i:
            continue
        else:
            n += l
	c.append(n)
print(min(c))

Buggy submission (verdict: Runtime Error):
import math
 
num = [int(input()) for _ in range(5)]
num2 = [n if n % 10 == 0 else n - (n%10) + 10  for n in num]

c = []
for i, j  in enumerate(num):
    n = j
    for k,l in enumerate(num2):
        if  k == i:
            continue
        else:
            n += l
	c.append(n)
print(min(c))

Buggy submission (verdict: Runtime Error):
import math
 
num = [int(input()) for _ in range(5)]
num2 = [n if n % 10 == 0 else n - (n%10) + 10  for n in num]

c = []
for i, j  in enumerate(num):
    n = j
    for k,l in enumerate(num2):
        if  k == i:
            continue
        else:
            n += l

print(min(c))

Buggy submission (verdict: Runtime Error):
import math

num = [input() for _ in range(5)]
num2 = sorted([list(i)[-1] for i in num],reverse = False)

num3 = [n for n in num2 if n != "0" ]



C = 0
c = 1

for i in num:
	j = list(i)[-1]
  
	if j == num3[0] and c == 1:
		C += int(i)
		c += 1
	elif c>1:
		if int(j) >= 5 or int(j) == 0:
			C += round(int(i),-1)
			#print(round(C))
			
                  
		elif 0< int(j) < 5:
			C += round(int(i),-1)+10		
        
        
	else:
		if int(j) >= 5 or int(j) == 0:
			C += round(int(i),-1)
			#print(round(C))
			
                  
		elif 0< int(j) < 5:
			C += round(int(i),-1)+10	
		#	print(round(C))


print(C)

Buggy submission (verdict: Runtime Error):
import math

num = [input() for _ in range(5)]
num2 = sorted([list(i)[-1] for i in num],reverse = False)

num3 = [n for n in num2 if n != "0" ]



C = 0

for i in num:
	j = list(i)[-1]
  
	if j == num3[0]:
		C += int(i)
		
        
        
	else:
		if int(j) >= 5 or int(j) == 0:
			C += round(int(i),-1)
			#print(round(C))
			
                  
		elif 0< int(j) < 5:
			C += round(int(i),-1)+10	
		#	print(round(C))


print(C)
Problem p04029 (python)

Fixed submission:
N = int(input())

C = 0

for i in range(1,N+1):
    C += i

print(C)

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

def Couter(n):
    return n + Couter(n-1)

Couter(N)
Problem p04043 (python)

Fixed submission:
num  = [int(n) for n in input().rstrip().split()]

if num.count(5) == 2 and num.count(7) == 1:
    print("YES")

else:
    print("NO")

Buggy submission (verdict: Runtime Error):
from itertools import permutations

Num = [int(n) for n in input().rstrip().split()]

D = [int(n) for n in input().rstrip().split()]

for i in range(Num[0],10000):
    if len(set([str(n) for n in D]) & set(str(i))) == 0:
        print(i)
        break

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

if num.count(5) == 2 and num.count(7) == 1:
    print("YES")

else:
    print("NO")
Problem p04045 (python)

Fixed submission:
Num = [int(n) for n in input().rstrip().split()]

D = [int(n) for n in input().rstrip().split()]

for i in range(Num[0],100000):
    if len(set([str(n) for n in D]) & set(str(i))) == 0:
        print(int(i))
        break

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

D = [int(n) for n in input().rstrip().split()]

for i in rang:e(Num[0],10000):
    if len(set([str(n) for n in D]) & set(str(i))) == 0:
        print(int(i))
        break

Buggy submission (verdict: Runtime Error):
Num = [int(n) for n in input().rstrip().split()][0]

D = [int(n) for n in inut().rstrip().split()]

numberlist = [n if n not in D for n in range(9)]

anslist = []

for num in numberlist:
    if num >= Num:
        anslist.append(num)
    else:pass

print(min(anslist))
Problem p03545 (python)

Fixed submission:
import operator

vals = input()
nums = list(map(int, tuple(vals)))

def dump(a,b,c):
    if a == operator.add:
        a = '+'
    else:
        a = '-'
    if b == operator.add:
        b = '+'
    else:
        b = '-'
    if c == operator.add:
        c = '+'
    else:
        c = '-'
    print(vals[0] + a + vals[1] + b + vals[2] + c + vals[3] + '=7')

for a in (operator.add, operator.sub):
    for b in (operator.add, operator.sub):
        for c in (operator.add, operator.sub):
            if c(b(a(nums[0], nums[1]), nums[2]), nums[3]) == 7:
                dump(a, b, c)
                exit(0)

Buggy submission (verdict: Runtime Error):
def dump(a,b,c):
    if a == operator.add:
        a = '+'
    else:
        a = '-'
    if b == operator.add:
        b = '+'
    else:
        b = '-'
    if c == operator.add:
        c = '+'
    else:
        c = '-'
    print(vals[0] + a + vals[1] + b + vals[2] + c + vals[3] + '=7')

for a in (operator.add, operator.sub):
    for b in (operator.add, operator.sub):
        for c in (operator.add, operator.sub):
            if c(b(a(nums[0], nums[1]), nums[2]), nums[3]) == 7:
                dump(a, b, c)
                exit(0)
Problem p03796 (python)

Fixed submission:
import math

N = int(input())

num = math.factorial(N)

k, r = divmod(num, 10**9 + 7)
print(r)

Buggy submission (verdict: Runtime Error):
FACTOR = 10 ** 9 + 7

num = 1
for i in range(1, N+1):
    num *= i
    k, r = divmod(num, FACTOR)
    num = r

k, r = divmod(num, FACTOR)
print(r)
Problem p02601 (python)

Fixed submission:
a,b,c = map(int,input().split())
k = int(input())
count = 0
while a >= b:
  count += 1
  b *= 2
while b >= c:
  count += 1
  c *= 2
print(['No','Yes'][count<=k])

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
k = int(input())
count = 0
while a >= b:
  count += 1
  b *= 2
while b >= c:
  count += 1
  c *= 2
return(['No','Yes'][count<=k])

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
k = int(input())
count = 0
while A >= B:
  count += 1
  B *= 2
while B >= C:
  count += 1
  C *= 2
return(['No','Yes'][count<=k])

Buggy submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
k = int(input())
count = 0
while A >= B:
  count += 1
  B *= 2
while B >= C:
  count += 1
  C *= 2
return(['Yes', 'No'][count<=k])
Problem p02606 (python)

Fixed submission:
L, R, d = map(int, input().split())
 
count = 0
for i in range(L, R+1):
    if i % d == 0:
        count+=1
 
print(count)

Buggy submission (verdict: Runtime Error):
L, R, d = map(int, input().split())

count = 0
for i in range(L, R+1):
  if i % d == 0:
    count += 1
    
return count

Buggy submission (verdict: Runtime Error):
ans = 0
for i in range(L, R):
  if i % d == 0:
    ans += 1
return ans
Problem p02619 (python)

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

D = int(input())
c = list(map(int, input().split()))

s = []
for d in range(D):
    s.append(list(map(int, input().split())))

def get_objective_function(output):
    objective_function = 0
    last = [[-1 for i in range(26)] for d in range(D)]

    for d in range(D):
        objective_function += s[d][output[d]]

        last[d][output[d]] = d
        if d < D-1:
            for i in range(26):
                last[d+1][i] = max(last[d][i], last[d+1][i])

        for i in range(26):
            objective_function -= c[i] * (d-last[d][i])
        print(objective_function)

    point = max(10 ** 6 + objective_function, 0)

## outputの作成
# IOに基づくパターン
output = []
for _ in range(D):
    output.append(int(input())-1)

# 最大効用での戦略
#output = []
#for d in range(D):
#    output.append(s[d].index(max(s[d])))
#for d in output:
#    print(d+1)

## 目的関数の確認
get_objective_function(output)

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

D = int(input())
c = list(map(int, input().split()))

s = []
for d in range(D):
    s.append(list(map(int, input().split())))

def get_objective_function(output):
    objective_function = 0
    last = [[-1 for i in range(26)] for d in range(D)]

    for d in range(D):
        objective_function += s[d][output[d]]

        last[d][output[d]] = d
        if d < D-1:
            for i in range(26):
                last[d+1][i] = max(last[d][i], last[d+1][i])

        for i in range(26):
            objective_function -= c[i] * (d-last[d][i])
        print(objective_function)

    point = max(10 ** 6 + objective_function, 0)


output = [0, 16, 12, 13, 12]

# 最大効用での戦略
#output = []
#for d in range(D):
#    output.append(s[d].index(max(s[d])))
#for d in output:
#    print(d+1)

get_objective_function(output)
Problem p02761 (python)

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


def solve(N: int, M: int, s: "List[int]", c: "List[int]"):
    s = [x-1 for x in s]
    answer = 'x' * N
    head_flag = False
    for i in range(M):
        if list(answer)[s[i]] == 'x':
            answer = answer[:s[i]] + str(c[i]) + answer[s[i]+1:]
        else:
            if str(c[i]) != answer[s[i]]:
                print(-1)
                return
        if s[i] == 0 and c[i]==0:
            head_flag = True
    answer = ''.join(answer)
    answer = answer.replace('x', '0')
    answer = int(answer)
    answer = str(answer)
    if len(answer) != N and head_flag ==True:
        print(-1)
    elif len(answer) < N:
        answer = '1' + '0' * (N - len(answer) - 1) + answer
        print(answer)
    elif len(answer) == N:
        print(answer)
    else:
        print(-1)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    s = [int()] * (M)  # type: "List[int]"
    c = [int()] * (M)  # type: "List[int]"
    for i in range(M):
        s[i] = int(next(tokens))
        c[i] = int(next(tokens))
    solve(N, M, s, c)

if __name__ == '__main__':
    main()

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


def solve(N: int, M: int, s: "List[int]", c: "List[int]"):
    s = [x-1 for x in s]
    answer = 'x' * N
    for i in range(M):
        if list(answer)[s[i]] == 'x':
            answer = answer[:s[i]] + str(c[i]) + answer[s[i]+1:]
        else:
            if str(c[i]) != answer[s[i]]:
                print(-1)
                return
        if s[i] == 0 and c[i]==0:
            head_flag = True
    answer = ''.join(answer)
    answer = answer.replace('x', '0')
    answer = int(answer)
    answer = str(answer)
    if len(answer) != N and head_flag ==True:
        print(-1)
    elif len(answer) < N:
        answer = '1' + '0' * (N - len(answer) - 1) + answer
        print(answer)
    elif len(answer) == N:
        print(answer)
    else:
        print(-1)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    s = [int()] * (M)  # type: "List[int]"
    c = [int()] * (M)  # type: "List[int]"
    for i in range(M):
        s[i] = int(next(tokens))
        c[i] = int(next(tokens))
    solve(N, M, s, c)

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

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


def solve(A: int, B: int, T: int):
    count = 0
    for i in range(1,T+1,1):
        if i%A == 0:
            count += B
    print(count)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, B, T)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
import math
import random



def gcd(x, y):
    if y == 0:
        return x
    else:
        return gcd(y, x % y) #再帰定義

def solve(N, A):
    left = [A[0]]
    right = [A[N-1]]
    for i in range(1, N):
        left.append(gcd(left[i-1], A[i]))
    for i,j in zip(range(1,N),range(N-2, -1, -1)):
        right.append(gcd(right[i-1], A[j]))

    result = -1
    max_value = -1

    for i in range(N):
        if i == 0:
            current_value = right[N-2]
        elif i == N-1:
            current_value = left[N-2]
        else:
            current_value = gcd(left[i-1], right[N-i-2])
        if current_value > max_value:
            max_value = current_value
    print(max_value)

# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(N) ]  # type: "List[int]"
    solve(N, A)

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

Fixed submission:
#!/usr/bin/env python3
import sys
import math
import random


def gcd(x, y):
    if y == 0:
        return x
    else:
        return gcd(y, x % y) #再帰定義

def solve(N, A):
    left = [A[0]]
    right = [A[N-1]]
    for i in range(1, N):
        left.append(gcd(left[i-1], A[i]))
    for i,j in zip(range(1,N),range(N-2, -1, -1)):
        right.append(gcd(right[i-1], A[j]))

    result = -1
    max_value = -1

    for i in range(N):
        if i == 0:
            current_value = right[N-2]
        elif i == N-1:
            current_value = left[N-2]
        else:
            current_value = gcd(left[i-1], right[N-i-2])
        if current_value > max_value:
            max_value = current_value
    print(max_value)

# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(N) ]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
import math
import random



def solve(N, A):
    left = [A[0]]
    right = [A[N-1]]
    for i in range(1, N):
        left.append(math.gcd(left[i-1], A[i]))
    for i,j in zip(range(1,N),range(N-2, -1, -1)):
        right.append(math.gcd(right[i-1], A[j]))

    result = -1
    max_value = -1

    for i in range(N):
        if i == 0:
            current_value = right[N-2]
        elif i == N-1:
            current_value = left[N-2]
        else:
            current_value = math.gcd(left[i-1], right[N-i-2])
        if current_value > max_value:
            max_value = current_value
    print(max_value)

# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(N) ]  # type: "List[int]"
    solve(N, A)

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

Fixed submission:
#coding:utf-8

D = str(input())

if D == '22':
    print('Christmas Eve Eve Eve')
elif D == '23':
    print('Christmas Eve Eve')
elif D == '24':
    print('Christmas Eve')
elif D == '25':
    print('Christmas')

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

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

h=[]
for i in range(N):
    h_i = int(input())
    h.append(h_i)

h = sorted(h)

min_val = 100000000000
for i in range(N-K+1):
    min_val = min(abs(h[i+K-1] - h[i]), min_val)
print(min_val)

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

N = input()

p = []
max_val = -1
for i in range(N):
    p_i = input()
    p.append(p_i)
    max_val = max(max_val, p_i)

sum = 0
flag = 0
for p_i in p:
    if p_i == max_val and flag==0:
        sum += p_i * 0.5
        flag = 1
    else:
        sum += p_i
print(int(sum))
Problem p03241 (python)

Fixed submission:
#coding:utf-8
import math
N, M = map(int, input().split())
yakusu = []
for i in range(1, min(int(M / N) + 1, int(math.sqrt(M)) + 1)):
    if M % i == 0:
        yakusu.append(i)
        if int(M / i) * N <= M:
            yakusu.append(int(M / i))
print(max(yakusu))

Buggy submission (verdict: Runtime Error):
#coding:utf-8
import math
N, M = map(int, input().split())
yakusu = []
for i in range(2, min(int(M / N) + 1, int(math.sqrt(M)) + 1)):
    if M % i == 0:
        yakusu.append(i)
        if int(M / i) * N < M:
            yakusu.append(int(M / i))
print(max(yakusu))
Problem p02657 (python)

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

print(a*b)

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