Kortit II

import sys

sys.setrecursionlimit(10000)
def yli(n, m):
    number1 = 1
    number2 = 1
    for i in range(min(m, n-m)):
        number1 *= (n-i)
        number2 *= i+1
    return number1/number2
kertomat = {}
def kertoma(n):
    if n == 0:
        return 1
    elif n in kertomat:
        return kertomat[n]
    else:
        return kertoma(n-1)*n

an = {}
def a(n, r):
    if r == 1 or n == 1:
        return 1
    if (n, r) in an:
        return an[(n, r)]
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
    an[(n, r)] = ans
    return ans


def calculateInputCombinations(input):
    [sticks, awins, bwins] = map(int, input.split(" "))
    draws = sticks - awins - bwins
    if draws<0:
        print(0)
        return
    if (awins==0 or bwins==0) and sticks != draws:
        print(0)
        return
    drawCombinations = yli(sticks, draws)
    n=sticks-draws
   
    print(int((drawCombinations*kertoma(sticks))%(10**9+7)*a(n, min(awins, bwins))))

n = int(input())
inputs = []
for i in range(n):
    inputs.append(input())
for i in inputs:
    calculateInputCombinations(i)

Test 1

Group: 1, 2, 3, 4, 5

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 50, in <module>
    calculateInputCombinations(i)
  File "input/code.py", line 43, in calculateInputCombinations
    print(int((drawCombinations*kertoma(sticks))%(10**9+7)*a(n, min(awins, bwins))))
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  [Previous line repeated 15850 more times]
  File "input/code.py", line 24, in a
    if (n, r) in an:
RecursionError: maximum recursion depth exceeded

Test 2

Group: 2, 3, 4, 5

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 50, in <module>
    calculateInputCombinations(i)
  File "input/code.py", line 43, in calculateInputCombinations
    print(int((drawCombinations*kertoma(sticks))%(10**9+7)*a(n, min(awins, bwins))))
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  [Previous line repeated 15850 more times]
  File "input/code.py", line 24, in a
    if (n, r) in an:
RecursionError: maximum recursion depth exceeded

Test 3

Group: 3, 4, 5

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 50, in <module>
    calculateInputCombinations(i)
  File "input/code.py", line 43, in calculateInputCombinations
    print(int((drawCombinations*kertoma(sticks))%(10**9+7)*a(n, min(awins, bwins))))
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  [Previous line repeated 15850 more times]
  File "input/code.py", line 24, in a
    if (n, r) in an:
RecursionError: maximum recursion depth exceeded

Test 4

Group: 4, 5

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 50, in <module>
    calculateInputCombinations(i)
  File "input/code.py", line 43, in calculateInputCombinations
    print(int((drawCombinations*kertoma(sticks))%(10**9+7)*a(n, min(awins, bwins))))
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  File "input/code.py", line 26, in a
    ans = r*a(n-1, r) + (n-r)*a(n-1, r-1) + (n-1)*a(n-2, r-1)
  [Previous line repeated 15850 more times]
  File "input/code.py", line 24, in a
    if (n, r) in an:
RecursionError: maximum recursion depth exceeded

Test 5

Group: 5

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 50, in <module>
    calculateInputCombinations(i)
  File "input/code.py", line 43, in calculateInputCombinations
    print(int((drawCombinations*kertoma(sticks))%(10**9+7)*a(n, min(awins, bwins))))
OverflowError: int too large to convert to float

Test 6

Group: 5

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 50, in <module>
    calculateInputCombinations(i)
  File "input/code.py", line 40, in calculateInputCombinations
    drawCombinations = yli(sticks, draws)
  File "input/code.py", line 10, in yli
    return number1/number2
OverflowError: integer division result too large for a float