Problem p02990 (python)

Fixed submission:
import math
n,k=map(int,input().split()) 

def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

mod_num = 10 ** 9 + 7
for i in range(1, k+1):
    if i > n - k + 1:
        print(0)
    else:
        print(comb(n-k+1, i) * comb(k-i+(i-1), i-1) % mod_num)

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int,input().split()) 
lst=list()

def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

mod_num = 10 ** 9 + 7
for i in range(1, k+1):
    if i > N - K + 1:
        print(0)
    else:
        print(comb(n-k+1, i) * comb(k-i+(i-1), i-1) % mod_num)

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int,input().split()) 
lst=list()

def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, k+1):
    if i > N - K + 1:
        print(0)
    else:
        print(comb(n-k+1, i) * comb(k-i+(i-1), i-1)%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int,input().split()) 
lst=list()

def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, k+1):
    if i > N - K + 1:
        lst.append(0)
    else:
        lst.append(comb(n-k+1, i) * comb(k-i+(i-1), i-1))  

for i in range(k):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int,input().split()) 
lst=list()

def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, k+1):
    if i > N - K + 1:
        lst.append(int(0))
    else:
        lst.append(comb(n-k+1, i) * comb(k-i+(i-1), i-1))  

for i in range(k):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int,input().split()) 
lst=list()

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, k+1):
    if n-k>i:
        lst.append(combinations_count(n-k+1, i) * combinations_count(k-i+(i-1), i-1))  
    elif n-k==i:
        lst.append(combinations_count(K-1,i-1))
    else:
        lst.append(int(0))

for i in range(k):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int, input().split()) 
lst=list()

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, k+1):
    if n-k>i:
        lst.append(combinations_count(n-k+1, i) * combinations_count(k-i+(i-1), i-1))
    
    if n-k==i:
        lst.append(combinations_count(K-1,i-1))

for i in range(k):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
n,k=map(int, input().split()) 
lst=list()

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, k+1):
    lst.append(combinations_count(n-k+1, i) * combinations_count(k-i+(i-1), i-1))
        
for i in range(k):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
N,K=map(int, input().split()) 
lst=list()

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    lst.append(int(combinations_count(N-K+1, i)) * int(combinations_count(K-i+(i-1), i-1)))
        
for i in range(K):
    print(lst[i]%(10**9+7))

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

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    print((combinations_count(N-K+1, i) * combinations_count(K-i+(i-1), i-1))%(10**9+7))

Buggy submission (verdict: Runtime Error):
from math import factorial
N,K=map(int, input().split()) 

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    print((combinations_count(N-K+1, i) * combinations_count(K-i+(i-1), i-1))%(10**9+7))

Buggy submission (verdict: Runtime Error):
from math import factorial
N,K=map(int, input().split()) 
lst=list(K)

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    lst.append((combinations_count(N-K+1, i)) * (combinations_count(K-i+(i-1), i-1)))
        
for i in range(K):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
from math import factorial
N,K=map(int, input().split()) 
lst=[]

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    lst.append((combinations_count(N-K+1, i)) * (combinations_count(K-i+(i-1), i-1)))
        
for i in range(K):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
N,K=map(int, input().split()) 
lst=[]

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    lst.append((combinations_count(N-K+1, i)) * (combinations_count(K-i+(i-1), i-1)))
        
for i in range(K):
    print(lst[i]%(10**9+7))

Buggy submission (verdict: Runtime Error):
import math
N,K=map(int, input().split()) 
lst=[]

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

for i in range(1, K+1):
    lst.append(combinations_count(N-K+1, i) * combinations_count(K-i+(i-1), i-1) )
        
for i in range(K):
    print(lst[i]%(10**9+7))