Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#A,B,K = [int(i) for i in input().rstrip().split()]
A,B,K = list(map(int, input().rstrip().split()))

#nums=[i for i in range(A,B+1)]
nums=list(range(A,B+1))

if K <= len(nums)//2:
  print(*(nums[:K] + nums[-K:]),sep="\n")
else:
  print(*nums,sep="\n")


Fixed submission:
s = input().strip()

s_set=set(s)
print("Yes" if len(s_set)==3 else "No")
Buggy python submission (verdict: Runtime Error):
#A,B,K = [int(i) for i in input().rstrip().split()]
A,B,K = list(map(int, input().rstrip().split()))

#nums=[i for i in range(A,B+1)]
nums=list(range(A,B+1))

if K <= len(nums)//2:
  print(*(nums[:K] + nums[-K:]),sep="\n")
else:
  print(*nums,sep="\n")


Fixed submission:
A,B,K = [int(i) for i in input().rstrip().split()]

if K <= (B-A+1)/2:
  print(*( list(range(A,A+K)) + list(range(B-K+1,B+1)) ),sep="\n")
else:
  print(*list(range(A,B+1)),sep="\n")

Buggy python submission (verdict: Runtime Error):
#A,B,K = [int(i) for i in input().rstrip().split()]
A,B,K = list(map(int, input().rstrip().split()))

#nums=[i for i in range(A,B+1)]
nums=list(range(A,B+1))

if K <= len(nums)/2:
  print(*(nums[:K] + nums[-K:]),sep="\n")
else:
  print(*nums,sep="\n")


Fixed submission:
A,B,K = [int(i) for i in input().rstrip().split()]

if K <= (B-A+1)/2:
  print(*( list(range(A,A+K)) + list(range(B-K+1,B+1)) ),sep="\n")
else:
  print(*list(range(A,B+1)),sep="\n")

Buggy python submission (verdict: Runtime Error):
A,B,K = [int(i) for i in input().rstrip().split()]

nums=list(range(A,B+1))

if K <= len(nums)/2:
  print(*(nums[:K] + nums[-K:]),sep="\n")
else:
  print(*nums,sep="\n")


Fixed submission:
A,B,K = [int(i) for i in input().rstrip().split()]

if K <= (B-A+1)/2:
  print(*( list(range(A,A+K)) + list(range(B-K+1,B+1)) ),sep="\n")
else:
  print(*list(range(A,B+1)),sep="\n")

Buggy python submission (verdict: Time Limit Exceeded):
A,B,K = [int(i) for i in input().rstrip().split()]

nums=[i for i in range(A,B+1)]

if K <= len(nums)/2:
  print(*(nums[:K] + nums[-K:]),sep="\n")
else:
  print(*nums,sep="\n")

Fixed submission:
A,B,K = [int(i) for i in input().rstrip().split()]

if K <= (B-A+1)/2:
  print(*( list(range(A,A+K)) + list(range(B-K+1,B+1)) ),sep="\n")
else:
  print(*list(range(A,B+1)),sep="\n")
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

N,M = list(map(int, input().rstrip().split()))
#-----

delta = [(-1,-1) , (0,-1), (1,-1),
         (-1, 0) , (0, 0), (1, 0),
         (-1, 1) , (0, 1), (1, 1)]


ans=0
for y in range(N):
    for x in range(M):
        
        check_cnt=0
        for d in delta:
            check_x = x + d[0]
            check_y = y + d[1]
            
            if 0 <= check_x <= (M-1) and 0 <= check_y <= (N-1):
                check_cnt += 1
        
        if check_cnt % 2 == 1:
            ans += 1

print(ans)


Fixed submission:
# -*- coding: utf-8 -*-

N,M = list(map(int, input().rstrip().split()))
#-----

ans = abs(N-2) * abs(M-2)
print(ans)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from collections import Counter
from collections import deque

H,W = list(map(int, input().rstrip().split()))
S_list = [list(input().rstrip()) for i in range(H)]
#-----

def checkRoute(matrix):
    # queue = [ ( (row, column),step ) ]
    # deque = [ ( (int, int   ),int ) ]
    queue = deque([  ( (1,1),1 )  ])

    delta = [(1,0),(-1,0),(0,1),(0,-1)]
    visited = set()
    
    while queue:
        (r,c),step = queue.popleft()
        
        for d in delta:
            next_r = r + d[0]
            next_c = c + d[1]
            
            if (next_r == H) and (next_c == W):
                return step+1
            
            if (1 <= next_r <= H) and (1 <= next_c <= W) and \
               (next_r, next_c) not in visited  and \
               matrix[next_r][next_c] == ".":
            
                queue.append( ( (next_r, next_c), step+1 ) )
                visited.add( (next_r, next_c) )


#-----
# add dummy node(Black area) around the original data
for i in range(len(S_list)):
    S_list[i] = ["#"] + S_list[i][:] + ["#"]
    
S_list = [["#"]*(W+2)] + S_list[:] + [["#"]*(W+2)]
#-----

cnt_dic = Counter( sum(S_list,[]) )
min_step = checkRoute(S_list)
print( cnt_dic["."] - min_step )


Fixed submission:
# -*- coding: utf-8 -*-
from collections import Counter
from collections import deque

H,W = list(map(int, input().rstrip().split()))
S_list = [list(input().rstrip()) for i in range(H)]
#-----

def checkRoute(matrix):
    # queue = [ ( (row, column),step ) ]
    # deque = [ ( (int, int   ),int ) ]
    queue = deque([  ( (1,1),1 )  ])

    delta = [(1,0),(-1,0),(0,1),(0,-1)]
    visited = set()
    
    while queue:
        (r,c),step = queue.popleft()
        
        for d in delta:
            next_r = r + d[0]
            next_c = c + d[1]
            
            if (next_r == H) and (next_c == W):
                return step+1
            
            if (1 <= next_r <= H) and (1 <= next_c <= W) and \
               (next_r, next_c) not in visited  and \
               matrix[next_r][next_c] == ".":
            
                queue.append( ( (next_r, next_c), step+1 ) )
                visited.add( (next_r, next_c) )

    return -1

#-----
# add dummy node(Black area) around the original data
for i in range(len(S_list)):
    S_list[i] = ["#"] + S_list[i][:] + ["#"]
    
S_list = [["#"]*(W+2)] + S_list[:] + [["#"]*(W+2)]
#-----

cnt_dic = Counter( sum(S_list,[]) )
min_step = checkRoute(S_list)

if min_step != -1:
    print( cnt_dic["."] - min_step )
else:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-


def check(a_list :list, X :int) -> int:
    count=0
    for num in a_list:
        diff = num - X
        if abs(diff) <=1:
            count += 1
    
    return count
   
#----------
N = int(input().strip())
a_list = list(map(int, input().rstrip().split()))
#----------
a_set=set(a_list)

count = 0
for X in a_set:
    tmp_count=check(a_list,X)
    
    if tmp_count > count:
        count = tmp_count
        result_X = X
    
print(count)


Fixed submission:
# -*- coding: utf-8 -*-


N = int(input().strip())
a_list = list(map(int, input().rstrip().split()))
#----------
a_set=set(a_list)
count_dic={}
for X in a_set:
    count_dic[str(X)] = 0
    count_dic[str(X+1)] = 0
    count_dic[str(X-1)] = 0

count = 0
for X in a_list:
    count_dic[str(X)] += 1
    count_dic[str(X+1)] += 1
    count_dic[str(X-1)] += 1
    
print(max(count_dic.values()))

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-


def check(a_list :list, X :int) -> int:
    count=0
    for num in a_list:
        diff = num - X
        if abs(diff) <=1:
            count += 1
    
    return count
   
#----------
N = int(input().strip())
a_list = list(map(int, input().rstrip().split()))
#----------
a_max=max(a_list)
a_min=min(a_list)

count = 0
for X in range( a_min, (a_max+1) ):
    tmp_count=check(a_list,X)
    
    if tmp_count > count:
        count = tmp_count
        #result_X = X
    
print(count)


Fixed submission:
# -*- coding: utf-8 -*-


N = int(input().strip())
a_list = list(map(int, input().rstrip().split()))
#----------
a_set=set(a_list)
count_dic={}
for X in a_set:
    count_dic[str(X)] = 0
    count_dic[str(X+1)] = 0
    count_dic[str(X-1)] = 0

count = 0
for X in a_list:
    count_dic[str(X)] += 1
    count_dic[str(X+1)] += 1
    count_dic[str(X-1)] += 1
    
print(max(count_dic.values()))
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

N,M = list(map(int, input().rstrip().split()))
#-----

divisor = 10**9 + 7

cnt=1
diff = abs(N-M)
if diff >=2:
    print("0")
    sys.exit()
else:
    for num in [N,M]:
        for i in range(1,num+1):
            cnt = (cnt * i) % divisor

    if diff == 0:
        cnt = (cnt * 2) % divisor

print(cnt)


Fixed submission:
# -*- coding: utf-8 -*-
import sys

N,M = list(map(int, input().rstrip().split()))
#-----

divisor = 10**9 + 7

cnt=1
diff = abs(N-M)
if diff >=2:
    print("0")
    sys.exit()
else:
    for num in [N,M]:
        for i in range(1,num+1):
            cnt = (cnt * i) % divisor

    if diff == 0:
        cnt = (cnt * 2) % divisor

print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-


#----------
N,C,K = list(map(int, input().rstrip().split()))

T_list = [int(input().strip()) for _ in range(N)]
T_list.sort()

#----------
num_bus=0
i=0
while i < len(T_list):

    # Busに何人乗せられるか時刻を比較
    member_bus=0
    break_flg=False
    for j in range(C):
        if (i+j) < len(T_list):
            if T_list[i+j] <= (T_list[i] + K):
                member_bus += 1

    num_bus += 1
    i = i + member_bus
            

print(num_bus)


Fixed submission:
# -*- coding: utf-8 -*-


#----------
N,C,K = list(map(int, input().rstrip().split()))

T_list = [int(input().strip()) for _ in range(N)]
T_list.sort()

#----------
num_bus=0
i=0
while i < len(T_list):

    # Busに何人乗せられるか時刻を比較
    member_bus=0
    break_flg=False
    for j in range(C):
        if (i+j) < len(T_list):
            if T_list[i+j] <= (T_list[i] + K):
                member_bus += 1
            else:
                break_flg=True
        else:
            break_flg=True
        
        if break_flg:
            break

    num_bus += 1
    i = i + member_bus
            

print(num_bus)
Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n, k = map(int, input().split())
p = np.array(list(int(i) for i in input().split()))
pp = (1 + p) / 2
# print(p)
# print(pp)
ans = 0.00

for i in range(0, n - k + 1):
	ans = max(np.sum(pp[i : (i + k)]), ans)
print('{:.10f}'.format(ans))


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n,k = map(int, input().split())
p = (1.00 + np.array(list(int(i) for i in input().split()))) / 2
temp = np.sum(p[:k])
ans = temp

for i in range(k, n):
	temp += (p[i] - p[i - k])
	ans = max(ans, temp)

print('{:.10f}'.format(ans))

Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n, k = map(int, input().split())
p = list(float(i) for i in input().split())
ans = 0

for i in range(0, n - k + 1):
  temp = 0
  for j in range(0, k):
    temp += (1.00 + p[i + j]) / 2
  ans = max(ans, temp)
print('{:.10f}'.format(ans))


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n,k = map(int, input().split())
p = (1.00 + np.array(list(int(i) for i in input().split()))) / 2
temp = np.sum(p[:k])
ans = temp

for i in range(k, n):
	temp += (p[i] - p[i - k])
	ans = max(ans, temp)

print('{:.10f}'.format(ans))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
print(int(a / math.gcd(a,b) * b))


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

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

a,b = map(int, input().split())
print(int(a / gcd(a,b) * b))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b,c = map(int, input().split())
if a + b + c >= 22:
  print('bust')
else:
  print('win')


Fixed submission:
a,b,c = map(int, input().split())
if a + b + c >= 22:
  print('bust')
else:
  print('win')
Buggy python submission (verdict: Runtime Error):
# AtCoderでsympyがimportできるか

import math
import statistics
import numpy as np
import sympy as sym
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)

Buggy python submission (verdict: Runtime Error):
import sympy as sym

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

a,b = map(int, input().split())
if a > 9 or b > 9:
  print('-1')
else:
  print(a * b)


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n = int(input())
for a in range(1, 10):
  for b in range(1, 10):
    if(a * b == n):
      print('Yes')
      exit(0)
print('No')
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np

n = int(input())
h = list(int(i) for i in input().split())

i = 0
ans = 0
cnt = 0
while i + 1 < n:
  if h[i] >= h[i + 1]:
    cnt += 1
  else:
    if ans < cnt:
      ans = cnt
    cnt = 0
  i += 1

if ans < cnt:
  ans = cnt
print(ans)


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

cnt = 0
s = input()
t = input()
for i in range(3):
  if s[i] == t[i]:
    cnt += 1;
print(cnt)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n,d = map(int, input().split())
print((n + d * 2) // (d * 2 + 1)

Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n,d = map(int, input().split())
print((n + d * 2) // (d * 2 + 1))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

s = input()
ans = 0
for i in range(n):
  for j in range(i, n):
    if all('ACGT'.count(c) == 1 for c in s[i : j + 1]):
      ans = max(ans, j - i + 1)
print(ans)


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

s = input()
length = 0
ans = 0
for ch in s:
    if ch in ('A','C','G','T'):
        length += 1
        ans = max(ans, length)
    else:
        length = 0
print(ans)

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

s = input()
ans = 0
for i in range(n):
  for j in range(i, n):
    if all('ACGT'.count(c) == 1 for c in S[i : j + 1]):
      ans = max(ans, j - i + 1)
print(ans)


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

s = input()
length = 0
ans = 0
for ch in s:
    if ch in ('A','C','G','T'):
        length += 1
        ans = max(ans, length)
    else:
        length = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
d = int(input())
if d == 25:
	print('Christmas')
elif d == 24:
	print('Christmas Eve')
elif d == 23:
	print('Christmas Eve Eve')
else d == 22:
	print('Christmas Eve Eve Eve')


Fixed submission:
d = int(input())
if d == 25:
	print("Christmas")
elif d == 24:
	print("Christmas Eve")
elif d == 23:
	print("Christmas Eve Eve")
else:
	print("Christmas Eve Eve Eve")
Buggy python submission (verdict: Runtime Error):
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>

void cookie(int *p1,int *p2){
	if(*p1 % 2)	--(*p1);
	*p1 /= 2;
	*p2 += *p1;
	return;
}

int main(int argc, char const *argv[])
{	
	int a,b,k;
	scanf("%d%d%d",&a,&b,&k);
	for (int i = 1; i <= k; ++i)
	{
		if(i % 2)	cookie(&a,&b);
		else cookie(&b,&a);
	}
	printf("%d %d\n",a,b);
}

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

def cookie(p1,p2):
	if p1 % 2 == 1:
		p1 -= 1
	p1 /= 2
	p2 += p1
	return p1,p2

a,b,k = map(int, input().split())
for i in range(k):
	if i % 2 == 0:
		a,b = cookie(a,b)
	else:
		b,a = cookie(b,a)
print("{} {}".format(int(a),int(b)))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
	print('Yes')
else:
	print('No')

Fixed submission:
a,b = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
	print("Yes")
else:
	print("No")


Fixed submission:
a,b = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if a % 2 == 1 && b % 2 == 1:
	print("Yes")
else:
	print("No")

Fixed submission:
a,b = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
	print('Yes')
else:
	print('No')

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
d = "Yes" if (a % 2 == 1 and b % 2 == 1) else "No"
print(d)

Fixed submission:
a,b = map(int, input().split())
if a % 2 == 1 and b % 2 == 1:
	print('Yes')
else:
	print('No')
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

# fact(int)
def fact(n):
  if(n == 1):
    return 1
  else:
    return (n * fact(n - 1))

# gcd(int,int)
def gcd(a,b):
  if a == 0:
    return b
  elif b == 0:
    return a
  else:
    return gcd(b,a % b)

# lcm(int,int)
def lcm(a,b):
  return (a * b / gcd(a,b))

# qsort(array[])
def qsort(seq):
  if len(seq) < 1:
      return seq
  pivot = seq[0]
  left = []
  right = []
  for x in range(1, len(seq)):
    if seq[x] <= pivot:
        left.append(seq[x])
    else:
        right.append(seq[x])
  left = qsort(left)
  right = qsort(right)
  foo = [pivot]
  return (left + foo + right)

#  = map(int, input().split())
#  = int(input())
#  = raw_input().split()
#  = list(int(i) for i in input().split())  

n = int(input())
a = int(input())
if n % 500 <= a:
  print('Yes')
else:
  print('No')


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n = int(input())
a = int(input())
if n % 500 <= a:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
# , = map(int, input.split())
#  = int(input())
x,a,b = map(int, input().split())
print((x - a) % b)

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

x = int(input())
a = int(input())
b = int(input())
print((x - a) % b)
Buggy python submission (verdict: Runtime Error):
a,b = map(str, input().split())
if a < b:
	prinf('<')
elif a > b:
	print('>')
else:
	print('=')


Fixed submission:
a,b = map(str, input().split())
if a == b:
	print('=')
elif a < b:
	print('<')
else:
	print('>')

Buggy python submission (verdict: Runtime Error):
a,b = map(str,input())
if a < b:
	prinf('<')
elif a > b:
	print('>')
else:
	print('=')

Fixed submission:
a,b = map(str, input().split())
if a == b:
	print('=')
elif a < b:
	print('<')
else:
	print('>')
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n,m,k = map(int, input().split())
for i in range(n):
  for j in range(m):
    if i * (m - j) + j * (n - i) == k:
      print('Yes')
      exit(-1)
print('No')


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n,m,k = map(int, input().split())
for i in range(n + 1):
  for j in range(m + 1):
    if n * j + m * i - 2 * i * j == k:
      print('Yes')
      exit(0)
print('No')

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n,m,k = map(int, input.split())
for i in range(n):
  for j in range(m):
    if i * (m - j) + j * (n - i) == k:
      print('Yes')
    else:
      print('No')


Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

n,m,k = map(int, input().split())
for i in range(n + 1):
  for j in range(m + 1):
    if n * j + m * i - 2 * i * j == k:
      print('Yes')
      exit(0)
print('No')
Buggy python submission (verdict: Runtime Error):
n,m = map(int, input.split())
print((n - 1)*(m - 1))

Fixed submission:
n,m = map(int, input().split())
print(int((n - 1) * (m - 1)))
Buggy python submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

int main(int argc, char const *argv[]){
	int r,g,b;
	cin >> r >> g >> b;
	if((100 * r + 10 * g + b) % 4 == 0)	cout << "YES\n" << endl;
	else puts("NO\n");
}

Fixed submission:
r,g,b = map(int, input().split(' '))
temp = 100 * r + 10 * g + b
if temp % 4 == 0:
	print("YES")
else:
	print("NO")
Buggy python submission (verdict: Runtime Error):
n = map(int(input()))
a = list(map(int, input().split()))
print(max(a) - min(a))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
print(max(a) - min(a))

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

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
print(max(a) - min(a))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n = int(input())
p = 600 * (n // 15) + 800 * (n - n // 15)
print(c)



Fixed submission:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n = int(input())
p = 600 * (n // 15) + 800 * (n - n // 15)
print(p)
Buggy python submission (verdict: Runtime Error):
x = input()
if x =< 599:
    print("8")
elif x=< 799:
    print("7")
elif x=< 999:
    print("6")
elif x=< 1199:
    print("5")
elif x=< 1399:
    print("4")
elif x=< 1599:
    print("3")
elif x=< 1799:
    print("2")
else:
    print("1")

Fixed submission:
x = int(input())
if x <= 599:
    print("8")
elif x <= 799:
    print("7")
elif x <= 999:
    print("6")
elif x <= 1199:
    print("5")
elif x <= 1399:
    print("4")
elif x <= 1599:
    print("3")
elif x <= 1799:
    print("2")
else:
    print("1")
Buggy python submission (verdict: Runtime Error):
a = int(input())
return a + a ** 2 + a ** 3

Fixed submission:
a = int(input())
b = a + a ** 2 + a ** 3
print(b)

Buggy python submission (verdict: Runtime Error):
a = input()
return a + a ** 2+ a ** 3

Fixed submission:
a = int(input())
b = a + a ** 2 + a ** 3
print(b)

Buggy python submission (verdict: Runtime Error):
return a + a ** a + a ** a ** a

Fixed submission:
a = int(input())
b = a + a ** 2 + a ** 3
print(b)

Buggy python submission (verdict: Runtime Error):
a = input()
return a + a ** a + a ** a ** a

Fixed submission:
a = int(input())
b = a + a ** 2 + a ** 3
print(b)