Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
if A > 100000000000 or B > 100000000000 or K > 100000000000:
    A = 0
    B = 0
else:
    C = max(0,A-K)
    B = max(0,(A+ B) - K)
print(C,B)

Fixed submission:
a, b, k = map(int, input().split())
print(max(0, a - k), max(0, b - max(0, k - a)))

Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
if A >= 1000000000000 or B >= 1000000000000 or K >= 1000000000000:
    A = 0
    B = 0
else:
    C = max(0,A-K)
    B = max(0,(A+ B) - K)
print(C,B)

Fixed submission:
a, b, k = map(int, input().split())
print(max(0, a - k), max(0, b - max(0, k - a)))

Buggy python submission (verdict: Runtime Error):
A,B,K = map(int,input().split())
if A or B or K >= 100000000000
  A = 0 B = 0 
for _ in range(K):
  if A >= 1:
    A -= 1
  elif B >= 1:
    B -= 1
  else:
    break
print(A,B)

Fixed submission:
a, b, k = map(int, input().split())
print(max(0, a - k), max(0, b - max(0, k - a)))
Buggy python submission (verdict: Runtime Error):
S = {1,2,3}
A = tuple(int(input()))
B = tuple(int(input()))
print(int(S-A-B))

Fixed submission:
S = {1,2,3}
A = {int(input())}
B = {int(input())}
C = S - A - B
V = C.pop()
print(V)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S,T = input().split()
q = None
for u in S :
  for d in T:
    q += u
    q += d
    break
print(q)    

Fixed submission:
N = int(input())
S,T = input().split()
S = list(S)
T = list(T)
q = ''
for u in S :
  for d in T:
    q += u
    q += d
    T.remove(T[0])
    break
print(q)
Buggy python submission (verdict: Runtime Error):
A = list(map(int,input.split()))
if sum(A) <= 21:
    print("win")
else:
    print("bust")
    

Fixed submission:

A = list(map(int,input().split()))
if sum(A) <= 21:
    print("win")
else:
    print("bust")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
A = []
for i in range(S):
  if chr(ord(S[i])+N) <= 90:
    A.append(ord(S[i]+N)
  else :
    A.append(ord(S[i]+N-26)
    

Fixed submission:
N = int(input())
S = input()
A = ''
for i in range(len(S)):
    if ord(S[i])+N <= 90:
        A += chr(ord(S[i])+N)
    
    else:
        A += chr(ord(S[i])+N-26)
        
print(A)
Buggy python submission (verdict: Runtime Error):

  import sympy
A= sympy.factorint(int(input()))
X = list(A)
E = max(X)
if sum(list(A.values()))>2:
  print("NO")
elif E > 9:
  print("No")
else:
  print("Yes")

Fixed submission:
N = int(input())
t = 0
for i in range(1,10):
  if N % i == 0:
    if N / i >= 10:
      continue
    else:
      t = 1
      break
  else:
    continue
if t >0:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
S = int(input())
if S%2==0:
    print(0.5)
else:
    print(((N+1)/2)/N)

Fixed submission:
S = int(input())
if S%2==0:
    print(0.5)
else:
    print(((S+1)/2)/S)

Buggy python submission (verdict: Runtime Error):
S = int(input())
if S%2=0:
    print(0.5)
else:
    print(((N+1)/2)/N)

Fixed submission:
S = int(input())
if S%2==0:
    print(0.5)
else:
    print(((S+1)/2)/S)
Buggy python submission (verdict: Runtime Error):
N,K =map(int,input().split())
height = [for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)
    

Fixed submission:
N,K =map(int,input().split())
height = [int(i) for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)
Buggy python submission (verdict: Runtime Error):
S = list(input())
for s in len(S):
  if s % 2 == 1:
    if S[s] == "L":
      print("No")
      break
  else:
    if S[s] == "R":
      print("No")
      break
else:
  print("Yes")
      
    

Fixed submission:
S = list(input())
for s in range(len(S)):
  if s % 2 == 0:
    if S[s] == "L":
      print("No")
      break
  else:
    if S[s] == "R":
      print("No")
      break
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A = B:
    print(1)
elif B = 1:
    print(0)
else:
    print((B-1)//(A-1)+1)

Fixed submission:
A,B = map(int,input().split())
if round((B-1)%(A-1)) == 0:
  print((B - 1)//(A - 1))
else:
  print((B-1)//(A-1)+1)

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A = B:
    print(1)
elif B = 1:
    print(0)
else
    print((B-1)//(A-1)+1)

Fixed submission:
A,B = map(int,input().split())
if round((B-1)%(A-1)) == 0:
  print((B - 1)//(A - 1))
else:
  print((B-1)//(A-1)+1)

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if B>A:
    print(B//A +1)
elif B = 1:    
    print(0)
else:
    print(1)

Fixed submission:
A,B = map(int,input().split())
if round((B-1)%(A-1)) == 0:
  print((B - 1)//(A - 1))
else:
  print((B-1)//(A-1)+1)
Buggy python submission (verdict: Runtime Error):
a = input()
s = input()
if a >= 3200
    print(s)
else 
    print("red")
  

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

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

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

Buggy python submission (verdict: Runtime Error):
if a ＞＝　3200
    print(s)
elif
    print("red")

Fixed submission:
a  = int(input())
s = str(input())
if a >= 3200 :
    print(s)
else :
    print("red")
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input())
if A + B >= A - B:
    if A + B>=A * B:
        print(A + B)
    else :
        print(A * B)
else :
    if A - B >= A * B:
        print(A - B)
    else:
        print(A * B)


Fixed submission:
A,B=map(int,input().split())
if A + B >= A - B:
    if A + B>=A * B:
        print(A + B)
    else :
        print(A * B)
else :
    if A - B >= A * B:
        print(A - B)
    else:
        print(A * B)
Buggy python submission (verdict: Runtime Error):
K,X = map(int,input().split())
A = X-K+1
B = X + K
for i in range(A,B)
    print(i)

Fixed submission:
K,X = map(int,input().split())
A = X-K+1
B = X + K
for i in range(A,B):
    print(i)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a - b > c
    print(0)
else
    print(c-a+b)


Fixed submission:
a,b,c = map(int,input().split())
if a - b > c:
    print(0)
else:
    print(c-a+b)
Buggy python submission (verdict: Runtime Error):
N =int(input())
if N >=10 and N<=99:
  print(9)
elif N >=100 and N<=999:
  print(N-90)
elif N >= 1000 and N<= 9999:
  print(900)
elif N >= 10000 and N<= 99999:
  print(N-90-9000)
elif N = 100000:
  print(9 + 900 + 90000)
else:
  print(N)

Fixed submission:
N =int(input())
if N >=10 and N<=99:
  print(9)
elif N >=100 and N<=999:
  print(N-90)
elif N >= 1000 and N<= 9999:
  print(9 + 900)
elif N >= 10000 and N<= 99999:
  print(N-90-9000)
elif N == 100000:
  print(9 + 900 + 90000)
else:
  print(N)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if (a + b)%2 = 0:
    print((a+b)/2)
else:
    print("IMPOSSIBLE") 
    

Fixed submission:
a,b = map(int,input().split())
if (a + b)%2 == 0 :
    print(round((a+b)/2))
else:
    print("IMPOSSIBLE")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if (a + b)%2 = 0:
    print((a+b)/2)
else:
    print("impossible") 
    

Fixed submission:
a,b = map(int,input().split())
if (a + b)%2 == 0 :
    print(round((a+b)/2))
else:
    print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
N,D = map(int,input().split())

if N & (D*2 + 1 ) = 0:
    print(N/(D*2 + 1))
else :
    print(round(N//(D*2 + 1)+1))
    

Fixed submission:
N,D = map(int,input().split())
 
if N % (D*2 + 1 ) == 0:
    print(round(N/(D*2 + 1)))
else :
    print(round(N//(D*2 + 1)+1))
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split)
if N*A>=B:
    print(N*A)
else:
    print(B)
    

Fixed submission:
N,A,B = map(int,input().split())
if N*A>=B:
    print(B)
else:
    print(N*A)
Buggy python submission (verdict: Runtime Error):
a = list(map(str,input()))
if a[0] = a[1] and a[2] = a[3] and a[0] != a[2]:
    print("Yes")
elif a[0] = a[3] and a[1] = a[2] and a[0] != a[1]:
    print("Yes")
elif a[0] = a[2] and a[1] = a[3] and a[0] != a[1]:
    print("Yes")
else:
    print("No")
  
    
    
        
    

Fixed submission:
a = list(map(str,input()))
if a[0] == a[1] and a[2] == a[3] and a[0] != a[2]:
    print("Yes")
elif a[0] == a[3] and a[1] == a[2] and a[0] != a[1]:
    print("Yes")
elif a[0] == a[2] and a[1] == a[3] and a[0] != a[1]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a=input()
b = input()
c = input()
d = input()
e = input()
k = input()
if e - a > k:
  print("Yay!")
else:
  print(":(")
  


Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a > k:
  print(":(")
else:
  print("Yay!")
Buggy python submission (verdict: Runtime Error):
b = input()
c = {"A":T,"C":G}
print(c[b])

Fixed submission:
b = input()
c = {"A":"T","C":"G" ,"T":"A","G":"C"}
print(c[b])
Buggy python submission (verdict: Runtime Error):
H,W =map(int,input().split())
h,m =map(int,input().split())
print(H*W-h*W-w*H+h*W)

Fixed submission:
H,W =map(int,input().split())
h,w =map(int,input().split())
print(H*W-h*W-w*H+h*w)

Buggy python submission (verdict: Runtime Error):
H,W =map(int,input().split())
h,m =map(int,input().split())
print(H*W-h*W-w*H+h*W)

Fixed submission:
H,W =map(int,input().split())
h,w =map(int,input().split())
print(H*W-h*W-w*H+h*w)

Buggy python submission (verdict: Runtime Error):
H,W =map(int,input().split())
h,m =map(int,input(),split())
print(H*W-h*W-w*H+h*W)


Fixed submission:
H,W =map(int,input().split())
h,w =map(int,input().split())
print(H*W-h*W-w*H+h*w)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
print("TBD")

Fixed submission:
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) == 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
  print("TBD")

Buggy python submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019,int(B) <=4,int(C)<=30:
  print("Heisei")
else:
print("TBD")

Fixed submission:
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) == 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
  print("TBD")

Buggy python submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019,int(B) <=4,int(C)<=30:
  print("Heisei")
else int(A)>=2019:
print("TBD")

Fixed submission:
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) == 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
  print("TBD")

Buggy python submission (verdict: Runtime Error):
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) = 2019,int(B) <=4,int(C)<=30:
  print("Heisei")
elif int(A)>=2019:
print("TBD")

Fixed submission:
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) == 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
  print("TBD")

Buggy python submission (verdict: Runtime Error):
A,B,C = map(str,input().split())
if A <= 2018:
  print("Heisei")
elif B <=3:
  print("Heisei")
elif C <=29:
  print("Heisei")
else:
  print("TBG")
  


Fixed submission:
A,B,C = map(str,input().split("/"))
if int(A) <= 2018:
  print("Heisei")
elif int(A) == 2019 and int(B) <=4 and int(C)<=30:
  print("Heisei")
else:
  print("TBD")
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if round(A % B) = 0:
  print(A + B)
else:
  print(A-B)
  

Fixed submission:
A,B = map(int,input().split())
if round(B%A) == 0:
  print(A + B)
else:
  print(B-A)

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A % B = 0:
  print(A + B)
else:
  print(A-B)
  

Fixed submission:
A,B = map(int,input().split())
if round(B%A) == 0:
  print(A + B)
else:
  print(B-A)
Buggy python submission (verdict: Runtime Error):
A=list(map(int,input().split()))
A = A.sort()
print(A[1]*A[2]/2)
 

Fixed submission:
A=list(map(int,input().split()))
A.sort()
print(round(A[0]*A[1]/2))

Buggy python submission (verdict: Runtime Error):
A=list(map(int,input().split()))
A = A.sort
print(A[1]*A[2]/2)



Fixed submission:
A=list(map(int,input().split()))
A.sort()
print(round(A[0]*A[1]/2))
Buggy python submission (verdict: Runtime Error):
A = input()
if A = 1:
  print("Hello world")
if A = 2:
  B = int(input())
  C = int(input())
  print(A+B)
  
  
  

Fixed submission:
A = int(input())
if A == 1:
  print("Hello World")
if A == 2:
  B = int(input())
  C = int(input())
  print(B + C)
Buggy python submission (verdict: Runtime Error):
n=input();s=input()
print(s.count('ABC')

Fixed submission:
n=input();s=input()
print(s.count('ABC'))
Buggy python submission (verdict: Runtime Error):
s=input();l=len(s)//2-1;c=0
if len(s)==1:
  print(0)
else
  for i in range(l):
    if s[i]!=s[-i-1]:
      c+=1
  print(c)

Fixed submission:
s=input();l=len(s)//2;c=0
for i in range(l):
  if s[i]!=s[-i-1]:
    c+=1
print(c)
Buggy python submission (verdict: Runtime Error):
i=input;s=split;n,k=i().s();l=[int(_) for _ in i().s()];c=0
for _ in l:
  if _>int(~-k):
    c+=1
print(c)

Fixed submission:
i=input;n,k=i().split();l=[int(_) for _ in i().split()];c=0
for _ in l:
  if _>=int(k):
    c+=1
print(c)
Buggy python submission (verdict: Runtime Error):
n,k=[int(i) for i in input().split()];s=input()
print(s[0:k]+s[k].lower()+s[k+1:])

Fixed submission:
n,k=[int(i) for i in input().split()];s=input()
print(s[0:k-1]+s[k-1].lower()+s[k:])
Buggy python submission (verdict: Runtime Error):
nk = list(map(int, input().split()))
p = list(map(int, input().split()))
n = nk[0]
k = nk[1]
maxnum = 0
for i in range(n-k):
    if p[i+k] >= p[i]:
        maxnum = i+k

ans = (sum(p[maxnum-k+1:maxnum+1])+k)/2
print(ans)

Fixed submission:
alc = input().split()
nums = list(map(int, input().split()))
choose = input()

ans0 = nums[0] - int(alc[0]==choose)
ans1 = nums[1] - int(alc[1]==choose)
print(ans0, ans1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

ans = 'YES'

for i in range(n):
    for j in range(i+1, n-i):
        if a[i] == a[j]:
            ans = 'NO'
            break

print(ans)


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 'YES'
for i in range(n-1):
    if a[i] == a[i+1]:
        ans = 'NO'
        break

print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
ans = 'YES'
for i in range(n):
    for j in range(j, n-i):
        if a[i] == a[j]:
            ans = 'NO'
            break

print(ans)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 'YES'
for i in range(n-1):
    if a[i] == a[i+1]:
        ans = 'NO'
        break

print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a*b%2 == 1:
    print("Odd")
elif a*b%2 == 0:
    print("Even")

Fixed submission:
a, b = map(int, input().split())
if a*b%2 == 1:
    print("Odd")
else:
    print("Even")
Buggy python submission (verdict: Runtime Error):
int = input().split()

N = int[0]
R = int[1]

if N >=10 :
  print(R)
else:
  print(100*(10-N))
  
  

Fixed submission:
input_data = input().split()
 
N = int(input_data[0])
R = int(input_data[1])
 
if N >= 10 :
  print(R)
else:
  print(R+100*(10-N))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num_list = list(map(int, input().split()))

break_flag = 0
for i in range(len(num_list)):
    if num_list.count(num_list[i]) >= 2:
        break_flag = 1
        break

if break_flag == 1:
    print("NO")
else:
    print("YES")

Fixed submission:
import collections

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

c = collections.Counter(num_list)
if max(c.values()) == 1:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
_d = {}
d = {}
for i in range(N-2):
    if S[i] == S[i-1] and i >= 1: continue
    for j in range(i+1, N-1):
        _st = ''.join([S[i], S[j]])
        if _st in _d: continue
        else: _d[_st] = True
        for k in range(j+1, N):
            st = ''.join([S[i], S[j], S[k]])
            d[st] = True
print(len(d))

Fixed submission:
N = int(input())
S = input()
d = {}
k1 = [0 for i in range(10)]
for i in range(N-2):
    if k1[int(S[i])] != 0: continue
    k1[int(S[i])] += 1
    k2 = [0 for i in range(10)]
    for j in range(i+1, N-1):
        if k2[int(S[j])] != 0: continue
        k2[int(S[j])] += 1
        for k in range(j+1, N):
            st = ''.join([S[i], S[j], S[k]])
            d[st] = True
print(len(d))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()
d = {}
for i in range(N-2):
    for j in range(i+1, N-1):
        for k in range(j+1, N):
            st = ''.join([S[i], S[j], S[k]])
            d[st] = True
print(len(d))


Fixed submission:
N = int(input())
S = input()
d = {}
k1 = [0 for i in range(10)]
for i in range(N-2):
    if k1[int(S[i])] != 0: continue
    k1[int(S[i])] += 1
    k2 = [0 for i in range(10)]
    for j in range(i+1, N-1):
        if k2[int(S[j])] != 0: continue
        k2[int(S[j])] += 1
        for k in range(j+1, N):
            st = ''.join([S[i], S[j], S[k]])
            d[st] = True
print(len(d))
Buggy python submission (verdict: Runtime Error):
H,A = (int(x) for x input().split())

if not H <= 10^4 && H >= 1:
  return False
if not A <= 10^4 && H >= 1:
  return False

int count = 0
while H >= 0:
  count=+
  H = H - A

print(count)

Fixed submission:
import math

H,A = map(int,input().split())
f, i = math.modf(H/A)

if not H <= 10^4 and H >= 1:
  False
if not A <= 10^4 and H >= 1:
  False

if f == 0:
  print(int(i))
if f != 0:
  print(int(i+1))
Buggy python submission (verdict: Runtime Error):
line = list(map(int,input().split()))
if line[0] >= 10:
  print(line[1])
else:
  print(line[1] + (100 * (10 - line[0]))

Fixed submission:
line = list(map(int,input().split()))
if line[0] >= 10:
  print(line[1])
else:
  print(line[1] + (100 * (10 - line[0])))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if 1<=a<=9 and 1<=b<=9:
  print(a*b)
else:
  print(-1)

Fixed submission:
arr = input().split()
a = int(arr[0])
b = int(arr[1])

#b = int(input())
if 1<=a<=9 and 1<=b<=9:
  print(a*b)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
N, R = map(int, input().split())
print(R+(100*(10-K)))

Fixed submission:
N, R = map(int, input().split())
if N>10: N=10
print(R+(100*(10-N)))
Buggy python submission (verdict: Runtime Error):
MOD = 1000000007

n, a, b = map(int, input().split())

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def xgcd(a, b):
	x0, y0, x1, y1 = 1, 0, 0, 1
	while b != 0:
		q, a, b = a // b, b, a % b
		x0, x1 = x1, x0 - q * x1
		y0, y1 = y1, y0 - q * y1
	return a, x0, y0

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def modinv(a, m):
	g, x, y = xgcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def combination(n, r):
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
		ans %= MOD
	for i in range(1, r + 1):
		ans *= modinv(i, MOD)
		ans %= MOD
	return ans

ans = 0
ans += pow(2, n, MOD)
 - 1
ans += MOD - combination(n, a)
ans += MOD - combination(n, b)
ans %= MOD

print(ans)


Fixed submission:
MOD = 1000000007

n, a, b = map(int, input().split())

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def xgcd(a, b):
	x0, y0, x1, y1 = 1, 0, 0, 1
	while b != 0:
		q, a, b = a // b, b, a % b
		x0, x1 = x1, x0 - q * x1
		y0, y1 = y1, y0 - q * y1
	return a, x0, y0

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def modinv(a, m):
	g, x, y = xgcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def combination(n, r):
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
		ans %= MOD
	for i in range(1, r + 1):
		ans *= modinv(i, MOD)
		ans %= MOD
	return ans

ans = 0
ans += pow(2, n, MOD) - 1
ans += MOD - combination(n, a)
ans += MOD - combination(n, b)
ans %= MOD

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
MOD = 1000000007

n, a, b = map(int, input().split())

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def xgcd(a, b):
	x0, y0, x1, y1 = 1, 0, 0, 1
	while b != 0:
		q, a, b = a // b, b, a % b
		x0, x1 = x1, x0 - q * x1
		y0, y1 = y1, y0 - q * y1
	return a, x0, y0

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def modinv(a, m):
	g, x, y = xgcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def combination(n, r):
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
		ans %= MOD
	for i in range(1, r + 1):
		ans *= modinv(i, MOD)
		ans %= MOD
	return ans

ans = 0
ans += 2 ** n - 1
ans += MOD - combination(n, a)
ans += MOD - combination(n, b)
ans %= MOD

print(ans)


Fixed submission:
MOD = 1000000007

n, a, b = map(int, input().split())

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def xgcd(a, b):
	x0, y0, x1, y1 = 1, 0, 0, 1
	while b != 0:
		q, a, b = a // b, b, a % b
		x0, x1 = x1, x0 - q * x1
		y0, y1 = y1, y0 - q * y1
	return a, x0, y0

# https://tex2e.github.io/blog/crypto/modular-mul-inverse
def modinv(a, m):
	g, x, y = xgcd(a, m)
	if g != 1:
		raise Exception('modular inverse does not exist')
	else:
		return x % m

def combination(n, r):
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
		ans %= MOD
	for i in range(1, r + 1):
		ans *= modinv(i, MOD)
		ans %= MOD
	return ans

ans = 0
ans += pow(2, n, MOD) - 1
ans += MOD - combination(n, a)
ans += MOD - combination(n, b)
ans %= MOD

print(ans)
Buggy python submission (verdict: Runtime Error):
a, b, h = map(int, raw_input().split())
print (a + b) * h / 2

Fixed submission:
print (input() + input()) * input() / 2
Buggy python submission (verdict: Runtime Error):
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-k)
  print(ans)


Fixed submission:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-N)
  print(ans)

Buggy python submission (verdict: Runtime Error):
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]
ans = 0

if N  >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-k)
  print(ans)


Fixed submission:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-N)
  print(ans)

Buggy python submission (verdict: Runtime Error):
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]
ans = 0

if N  <= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-k)
  print(ans)


Fixed submission:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-N)
  print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
R = int(input())
ans = 0

if N < 10:
  ans = R + 100*(10-N)
  print(ans)
else:
  ans = R
  print(R)


Fixed submission:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-N)
  print(ans)

Buggy python submission (verdict: Runtime Error):
N = input()
R = input()
ans = 0

if N < 10:
  ans = R + 100*(10-N)
  print(ans)
else:
  ans = R
  print(R)

Fixed submission:
l=[int(x) for x in input().split()]
N=l[0]
R=l[1]

if N >= 10:
  ans = R
  print(ans)
else:
  ans = R + 100*(10-N)
  print(ans)