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

Fixed submission:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
 


def main():
    s = input()
    if s[-1] == "s":
        print(s + "es")
    else:
        print(s + "s")

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
 


def main():
   s = input()
   if s[-1] == "s":
        print(s + "es")
    else:
        print(s + "s")

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
 


def main():
  	s = input()
   	if s[-1] == "s":
        print(s + "es")
   	else:
        print(s + "s")

if __name__ == "__main__":
    main()
Problem p02572 (python)

Fixed submission:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
 

def cumsum(xs):
    pass

def main():
    n = int(input())
    alist = list(map(int, input().split()))
    max_num = 10**9 + 7
    ans = 0
    sum_num = sum(alist)

    for i in range(n-1):
        sum_num -= alist[i]
        ans += alist[i] * sum_num
        

    print(ans%max_num)

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
import numpy 
 
def main():
    n = int(input())
    alist = list(map(int, input().split()))
    max_num = 10**9 + 7
    ans = 0
    for i in range(n):
        ans += numpy.cumsum(alist[:i+1])

    print(ans%max_num)

if __name__ == "__main__":
    main()
Problem p02623 (python)

Fixed submission:
import os
import sys
from collections import defaultdict, Counter, deque
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
    
    n,m,k = map(int, input().split())
    n_list = list(map(int, input().split()))
    m_list = list(map(int, input().split()))

    a_list = [0]
    b_list = [0]

    ans = 0
    num = 0

    for i in range(n):
        a_list.append(a_list[i] + n_list[i])

    for i in range(m):
        b_list.append(b_list[i] + m_list[i])


    
    for i in range(n+1):
        if k < a_list[i]:
            break
        while(b_list[m] > k - a_list[i]):
            m -= 1
        ans = max(ans, i+m)
    print(ans)
            

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter, deque
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
    
    n,m,k = map(int, input().split())
    n_list = list(map(int, input().split()))
    m_list = list(map(int, input().split()))
    i,j,count = 0,0,0

    while(k>=0):

        if count == n+m:
            break

        if i <= n and j <= m:

            if n_list[i] < m_list[j]:
                k -= n_list[i]
                i += 1
            else:
                k -= m_list[j]
                j += 1
              
            if k < 0:
                break
            else:
                count += 1

        else:
            if i > n:
                if j > m:
                    break
                k -= m_list[j]
                j += 1

            elif j > m:
                if i > n:
                    break
                k -= n_list[i]
                i += 1

            if k < 0:
                break
            else:
                count += 1

    print(count)



            

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter, deque
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
    
    n,m,k = map(int, input().split())
    n_list = list(map(int, input().split()))
    m_list = list(map(int, input().split()))
    i,j,count = 0,0,0

    while(k>0):
        if count == n+m:
            break
        if n_list[i] < m_list[j]:
            k -= n_list[i]
            count += 1
            i += 1
        else:
            k -= m_list[j]
            count += 1
            j += 1
        
        if k < 0:
            count -= 1
            break

    print(count)



            

if __name__ == "__main__":
    main()
Problem p02659 (python)

Fixed submission:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy
from decimal import *

def main():
    a,b = map(Decimal, input().split())
    result = a*b
    print(int(result))
    
if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    a,b = map(int, input().split())
    print(floor(a*b))

if __name__ == "__main__":
    main()
Problem p02707 (python)

Fixed submission:
import os

def main():
	n = int(input())
	a_list = list(map(int, input().split()))
	result = [0]*n
	for i in a_list:
		result[i-1] += 1
	for i in result:
		print(i)

if __name__ == "__main__":
	main()

Buggy submission (verdict: Runtime Error):
import os

def main():
        n = int(input())
        a_list = tuple(map(int, input().split()))
        list_set = set(a_list)
        zero_list = [0]*n
        for l in list_set:
                zero_list[i-1] = a_list[i]
        for i in zero_list:
                print(i)

if __name__ == "__main__":
        main()

Buggy submission (verdict: Runtime Error):
import os

def main():
        n = int(input())
        a_list = tuple(map(int, input().split()))
        list_set = set(a_list)
        zero_list = [0]*n
        print(a_list)
        for l in list_set:
                zero_list[i-1] = a_list[i]
        for i in zero_list:
                print(i)
        """
        list_set = set(a_list)
        for i in list_set:
                result[i-1] = a_list.count(i)
        for i in result:
                print(i)
        """

if __name__ == "__main__":
        main()
Problem p02881 (python)

Fixed submission:
import os

def main():
	n = int(input())
	list_a = make_divisors(n)
	min_num = 1000000000000
	for i in range(0,len(list_a),2):
		if n//list_a[i] == list_a[i]:
			min_num = list_a[i] * 2 - 2
			break
		if min_num < (list_a[i] + list_a[i+1] - 2):
			pass
		else:
			min_num = list_a[i] + list_a[i+1] - 2
	print(min_num)
	
			


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    return divisors

	
if __name__ == "__main__":
	main()

Buggy submission (verdict: Runtime Error):
import os

def main():
	n = int(input())
	list_a = make_divisors(n)
	min_num = 1000000000000
	for i in range(0,len(list_a),2):
		if min_num < (list_a[i] + list_a[i+1] - 2):
			pass
		else:
			min_num = list_a[i] + list_a[i+1] - 2
	print(min_num)
	
			


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    return divisors

	
if __name__ == "__main__":
	main()
Problem p02897 (python)

Fixed submission:
import os

def main():
	n = int(input())
	if n%2 == 0:
		print((n//2)/n)
	else:
		print(((n//2)+1)/n)


if __name__ == "__main__":
	main()

Buggy submission (verdict: Runtime Error):
import math

def factorize(n):
    b = 2
    fct = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            fct.append(b)
        b = b + 1
    if n > 1:
        fct.append(n)
    return fct


def main():
	a,b = map(int, input().split())
	num = math.gcd(a,b)
	if num == 1:
		print(1)
		exit()
	result_list = factorize(num)
	print(len(set(result_list)) + 1)			
	


if __name__ == "__main__":
	main()
Problem p02546 (python)

Fixed submission:
s= input()
if s.endswith('s'):
  print(s+'es')
else:
  print(s+'s')

Buggy submission (verdict: Runtime Error):
s= input()
if s.endwith('s'):
  print(s+'es')
else:
  print(s+'s')
Problem p02699 (python)

Fixed submission:
S,W =map(int,input().split())
if(W>=S):
  print("unsafe")
else:
  print("safe")

Buggy submission (verdict: Runtime Error):
S= int(input())
W= int(input())
if(W>=S):
  print("unsafe")
else:
  print("safe")
Problem p02723 (python)

Fixed submission:
S = str(input())

print('Yes' if S[2]==S[3] and S[4]==S[5] else 'No')

Buggy submission (verdict: Runtime Error):
S = str(input()) 
print('YES' if S[2] ==S[3] and 'NO' if S[4]==S[5]
Problem p02753 (python)

Fixed submission:
S = input()
if len(S)==3 and S.count('A')==2 or S.count('B')==2:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
S = input()
if len(S)==3 and S.count('A')==2 or S.count('B')==2:
  print('Yes')
else
print('No')
Problem p02771 (python)

Fixed submission:
A = map(int,input().split())
if len(set(A) ) == 2:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
A = map(int, input().split())
if len(set(A) == 2):
  print("yes")
else:
  print("No")
Problem p02832 (python)

Fixed submission:
num, bricks, count, smash = int(input()), [int(x) for x in input().split(" ")], 1, 0
for x in bricks:
    if count == x: count += 1
    else: smash += 1
print(smash if smash != len(bricks) else 0 if len(bricks) == 1 else -1)

Buggy submission (verdict: Runtime Error):
num, bricks, count, smash = int(input()), [int(x) for x in input().split("")], 1, 0
for x in bricks:
  if count == x: count += 1
  else: smash +=1
print(smash if smash != len(bricks) else 0 if len(bricks) == 1 else -1)
Problem p02577 (python)

Fixed submission:
N = input()

sum_=0
for ni in N:
    sum_ += int(ni)

if sum_%9 == 0:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
from functools import reduce
n = input()

sum_ = reduce(lambda x,y:int(x)+int(y),n)
if sum_%9 == 0:
    print("Yes")
else:
    print("No")
Problem p02759 (python)

Fixed submission:
import math
n = int(input())
print(math.ceil(n/2))

Buggy submission (verdict: Runtime Error):
import math
n  int(input())
print(math.ceil(n/2))
Problem p02773 (python)

Fixed submission:
from collections import Counter
n = int(input())
ls = []
for _ in range(n):
    ls.append(input())
res = []
counter = Counter(ls).most_common()
for x in counter:
    if x[1] == counter[0][1]:
        res.append(x[0])
print("\n".join(sorted(res)))

Buggy submission (verdict: Runtime Error):
for _ in range(n):
    s += input()+" "
ls = s.split()
counter = 0
res = []
for x in ls:
    if ls.count(x) > counter:
        counter = ls.count(x)
for x in set(ls):
    if ls.count(x) == counter:
        res.append(x)
r = sorted(res)
print("\n".join(r))
Problem p02711 (python)

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

if 7 in n:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n =list(map(int, input().strip()))
if 7 in n:
  print(‘Yes’)
else:
  print(‘No’)

Buggy submission (verdict: Runtime Error):
n = input().strip()
m = int(n)
a = int(len(m))
for i in range(a):
  if i == 7:
    print('Yes')
  else:
    print('No')
Problem p02629 (python)

Fixed submission:

def C():
    import math
    n= int(input())

    counter = 0
    for i in range(1,13):
        if int(26*(pow(26,i-1))/(26-1)) <= n < int(26*(pow(26,i))/(26-1)):
            counter = i
            break
    kekka = n - int(26*(pow(26,counter-1))/(26-1))

    alplist=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

    kekkalist = []
    i = counter-1
    while i>= 0 :
        sho = int(kekka / pow(26,i))
        kekka = kekka - pow(26,i)*sho

        i -=1
        if i >= 0:
            kekkalist.append(alplist[sho])
        else:
            kekkalist.append(alplist[sho])


    print("".join(kekkalist))


C()

Buggy submission (verdict: Runtime Error):
import math
n= int(input())


counter = 0
for i in range(1,13):
    if int(26*(pow(26,i-1))/(26-1)) <= n < int(26*(pow(26,i))/(26-1)):
        counter = i
        break
kekka = n - int(26*(pow(26,counter-1))/(26-1)) + 1
syo = int(kekka/26)
amari = kekka%26

alplist=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

lists = []
i = counter-1
while i>= 0 :
    sho = int(kekka / pow(26,i))
    kekka = kekka - pow(26,i)*sho
    i -=1
    if i >= 0:
        lists.append(alplist[sho])
    else:
        lists.append(alplist[sho-1])


print("".join(lists))

Buggy submission (verdict: Runtime Error):
import math
n= int(input())


counter = 0
for i in range(1,13):
    if int(26*(pow(26,i-1))/(26-1)) <= n < int(26*(pow(26,i))/(26-1)):
        counter = i
        break
kekka = n - int(26*(pow(26,counter-1))/(26-1)) + 1
syo = int(kekka/26)
amari = kekka%26

alplist=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

lists = []
i = counter-1
while i>= 0 :
    sho = int(kekka / pow(26,i))
    kekka = kekka - pow(26,i)*sho
    i -=1
    if i >= 0:
        lists.append(alplist[sho])
    else:
        lists.append(alplist[sho-1])


print("".join(lists))

Buggy submission (verdict: Runtime Error):
import math
def C():
    import math
    n= int(input())


    counter = 0
    for i in range(1,13):
        if int(26*(pow(26,i-1))/(26-1)) <= n < int(26*(pow(26,i))/(26-1)):
            counter = i
            break
    kekka = n - int(26*(pow(26,counter-1))/(26-1)) + 1
    syo = int(kekka/26)
    amari = kekka%26

    alplist=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

    lists = []
    i = counter-1
    while i>= 0 :
        sho = int(kekka / pow(26,i))
        kekka = kekka - pow(26,i)*sho
        i -=1
        if i >= 0:
            lists.append(alplist[sho])
        else:
            lists.append(alplist[sho-1])


    print("".join(lists))


C()
Problem p03272 (python)

Fixed submission:
def ABC107_A():
    n,i=map(int,input().split())
    print(n-i+1)

ABC107_A()

Buggy submission (verdict: Runtime Error):
n,i=map(int,input.split())
print(n-i+1)
Problem p02572 (python)

Fixed submission:
def findProductSum(A, n): 
      
    # calculating array sum (a1 + a2 ... + an) 
    array_sum = 0
    for i in range(0, n, 1): 
        array_sum += A[i]
  
    # calcualting square of array sum 
    # (a1 + a2 + ... + an)^2 
    array_sum_square = (array_sum * array_sum )
  
    # calcualting a1^2 + a2^2 + ... + an^2 
    individual_square_sum = 0
    for i in range(0, n, 1): 
        individual_square_sum += (A[i] * A[i]) 
  
    # required sum is (array_sum_square - 
    # individual_square_sum) / 2 
    return (array_sum_square - individual_square_sum) // 2 
n = int(input())
a = [int(x) for x in input().split()]
MOD = 10**9 +7

print(int(findProductSum(a,n))%MOD)

# print(s%MOD)

Buggy submission (verdict: Runtime Error):
import numpy
n = int(input())
a = [int(x) for x in input().split()]
MOD = 10**9 +7
x = numpy.array(a)
result = ((x.sum()**2 - x.dot(x)) // 2)%MOD
        
print(result)
# print(s%MOD)
Problem p03013 (python)

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

s = [0] * (n + 1)
s[-1] = 1
for _ in range(m):
    a = int(input())
    s[a] = None

if s[0] is None and s[1] is None:
    print(0)
    exit()

for i in range(n - 1, -1, -1):
    if s[i] is None:
        continue
    if i + 1 < len(s) and s[i + 1] is not None:
        s[i] += s[i + 1]
    if i + 2 < len(s) and s[i + 2] is not None:
        s[i] += s[i + 2]

print(s[0] % 1000000007)

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

s = [0] * (n + 1)
s[-1] = 1
for _ in range(m):
    a = int(input())
    s[a] = None

if s[0] is None and s[1] is None:
    print(0)
    exit()

for i in range(n - 1, -1, -1):
    if s[i] is None:
        continue
    if i + 1 < len(s) and s[i + 1] is not None:
        s[i] += s[i + 1]
    if i + 2 < len(s) and s[i + 2] is not None:
        s[i] += s[i + 2]

print(s[0] % 1_000_000_007)
Problem p02859 (python)

Fixed submission:
hankei = input()
print(int(hankei)**2)

Buggy submission (verdict: Runtime Error):
hamkei = input()
print(int(hankei)**2)
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")

Buggy submission (verdict: Runtime Error):
a = int(input())
s = input()
if a>=3200:
  print("red")
  else:
    print(s)

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

Fixed submission:
import math
k = int(input())
a, b = list(map(int, input().split()))
mul = math.floor(b/k) * k

if(mul >= a and (mul >= a and mul <= b)):
    print('OK')
else:
    print('NG')

Buggy submission (verdict: Runtime Error):
k = int(input())
a, b = list(map(int, input().split()))
if(k >= a and ((k / b) <= a and (k / b) =< b)):
    print('OK')
else:
    print('NG')
Problem p03307 (python)

Fixed submission:
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n * 2)

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
print(( 2 * n ) // math.gcd(2, n))

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
print(( 2 * n ) //math.gcd(2, n))

Buggy submission (verdict: Runtime Error):
import math
n = int(input())
print(( 2 * n ) //math.gcd(2, n))
Problem p02552 (python)

Fixed submission:
x = int(input())
if x == 0:
  print(1)
if x == 1:
  print(0)

Buggy submission (verdict: Runtime Error):
def in(x):
	if x == 0:
		return 1
    if x == 1:
		return 0
x = int(input())
print(in(x))
Problem p02622 (python)

Fixed submission:
s=str(input())
t=str(input())
length=len(s)
count=0
for i in range(length):
	if s[i]==t[i]:
		pass
	else:
		count+=1
print(count)

Buggy submission (verdict: Runtime Error):
s = str(input())
t = str(input())
count = 0
for i range(len(s)):
  if s[i] == t[i]:
  	pass
  else:
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
s = str(input())
t = str(input())
count = 0
for i range(len(s)+1):
  if s[i] == t[i]:
    pass
  else:
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
s = input()
t = input()
count = 0
for i range(len(s)):
  if s[i] == t[i]:
    pass
  else:
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
s = input()
t = input()
count = 0
for i range(len(s)+1):
  if s[i] == t[i]:
    pass
  else:
    count += 1
print(count)
Problem p02693 (python)

Fixed submission:
k = int(input())
a, b = map(int, input().split())
re = False
for i in range(a, b+1):
    if (i % k) == 0:
        re = True
        break
if re == True:
    print("OK")
else:
    print("NG")

Buggy submission (verdict: Runtime Error):
k = int(input())
a, b = map(input().split())
for i in range(a, b):
    if i % k == 0:
        print("OK")
    else:
        print("NG")
Problem p02699 (python)

Fixed submission:
s, w = (int(x) for x in input().split())
if s > w:
  print("safe")
if w >= s:
  print("unsafe")

Buggy submission (verdict: Runtime Error):
s, w = (for i in input().split())
if s > w:
  print("safe")
if w >= s:
  print("unsafe")

Buggy submission (verdict: Runtime Error):
s, w = int(input().split())
if s > w:
  print("safe")
if w > s:
  print("unsafe")
if s == w:
  print("unsafe")

Buggy submission (verdict: Runtime Error):
s, w = int(input().split())
if s > w:
  print("Safe")
if w > s:
  print("Unsafe")
Problem p02773 (python)

Fixed submission:
#C
#入力
N=int(input())
S=[input() for i in range(N)]

#処理
result={}
for i in S:
    if i in result:
        result[i]+=1
    else:
        result[i]=1

x=max(result.values())

Z=[]
for i in result.items():
    if i[1]==x:
        Z.append(i[0])
Z.sort()
for i in Z:
    print(i)

Buggy submission (verdict: Runtime Error):
#C
#入力
N=int(input())
S=[input() for i in range(N)]

#処理
result={}
for i in S:
    if i in result:
        result[i]+=1
    else:
        result[i]=1

x=max(result.values())
x.sort

for i in result.items():
    if i[1]==x:
        print(i[0])

Buggy submission (verdict: Runtime Error):
n=int(input())
s=[input() for i in range(n)]

d={}

for i in s:
  if i in d:
    d[i]+=1
  else:
    d[i]=1
d=sorted(d.items(),reverse=True)



for i in d.key():
  print(i)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=[input() for i in range(n)]

d={}

for i in s:
  if i in d:
    d[i]+=1
  else:
    d[i]=1
d=sorted(d.items,reverse=True)



for i in d.key:
  print(i)

Buggy submission (verdict: Runtime Error):
n=int(input())
s=[input() for i in range(n)]

d={}

for i in s:
  if i in d:
    d[i]+=1
  else:
    d[i]=0
d=sorted(d.items,reverse=True)



for i in d.key:
  print(i)
Problem p02777 (python)

Fixed submission:
#A
#入力
S,T=input().split()
A,B=map(int,input().split())
U=input()

#処理
if S==U:
    A-=1
elif T==U:
    B-=1
    
print(str(A)+" "+str(B))

Buggy submission (verdict: Runtime Error):
#A
#入力
S,T=input().split()
A,B=input().split()
U=input()

#処理
if S==U:
    A-=1
elif T==U:
    B-=1
    
print(str(A)+" "+str(B))
Problem p03272 (python)

Fixed submission:
a,b=map(int,input().split())
t=a-b+1
print(t)

Buggy submission (verdict: Runtime Error):
a,b=input(),input()
c=int(a)-int(b)+1
print(c)

Buggy submission (verdict: Runtime Error):
(a,b)=input(),input()
c=int(a)-int(b)+1
print(c)

Buggy submission (verdict: Runtime Error):
(a,b)=input(),input()
c=int(a)-int(b)+1
print(c)

Buggy submission (verdict: Runtime Error):
(a,b)=input(),input()
c=int(a)-int(b)+1
print(c)

Buggy submission (verdict: Runtime Error):
(a,b)=input(),input()
c=int(a)-int(b)+1
print(c)

Buggy submission (verdict: Runtime Error):
(a,b)=input(),input()
c=a-b+1
print(c)

Buggy submission (verdict: Runtime Error):
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(a, b):
      c=a-b+1
    return(c)
# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    [str_a, str_b] = line.split(' ')
    return (int(str_a), int(str_b))

def main():
    a, b = readQuestion()
    answer = solve(a, b)
    print(answer)
    
if __name__ == '__main__':
    main()