Kertoma

import math

syöttö = input()
summa = 0
numerot = syöttö.split()
oNumerot = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
feikkiNumerot = [0] * 10
isoin = 0
for s in range(0, 10):
    feikkiNumerot[s] = int(numerot[s])

for h in range(0, 10):
    summa += feikkiNumerot[h]
    if feikkiNumerot[h] > isoin:
        isoin = feikkiNumerot[h]



def findDigits(n):
    # factorial of -ve number
    if (n < 0):
        return 0;

    # base case
    if (n <= 1):
        return 1;

    # Use Kamenetsky formula to
    # calculate the number of digits
    x = ((n * math.log10(n / math.e) +
          math.log10(2 * math.pi * n) / 2.0));

    return math.floor(x) + 1;

valittuNumero = 0
if isoin <= 100:
    for x in range(1, 1000):

        nollacount = 0
        tNumerot = [0] * 10
        väli = str(math.factorial(x))
        for i in range(0, 10):
            tNumerot[i] = väli.count(str(i))
            if (tNumerot[i] > feikkiNumerot[i]):
                break

            i += 1
        if (tNumerot == feikkiNumerot):
            valittuNumero = x
            break
        x += 1
else:
    for x in range(1, 210000):
        lM = findDigits(x)
        if (summa == lM):
            valittuNumero = x
            break



print(valittuNumero)

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED