| Task: | Kertoma | 
| Sender: | okkokko | 
| Submission time: | 2022-11-01 19:41:37 +0200 | 
| Language: | Python3 (PyPy3) | 
| Status: | READY | 
| Result: | 100 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 22 | 
| #2 | ACCEPTED | 24 | 
| #3 | ACCEPTED | 54 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.07 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.07 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.07 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.07 s | 1, 2, 3 | details | 
| #5 | ACCEPTED | 0.07 s | 1, 2, 3 | details | 
| #6 | ACCEPTED | 0.07 s | 1, 2, 3 | details | 
| #7 | ACCEPTED | 0.07 s | 2, 3 | details | 
| #8 | ACCEPTED | 0.07 s | 2, 3 | details | 
| #9 | ACCEPTED | 0.07 s | 2, 3 | details | 
| #10 | ACCEPTED | 0.07 s | 2, 3 | details | 
| #11 | ACCEPTED | 0.07 s | 3 | details | 
| #12 | ACCEPTED | 0.07 s | 3 | details | 
| #13 | ACCEPTED | 0.09 s | 3 | details | 
| #14 | ACCEPTED | 0.11 s | 3 | details | 
| #15 | ACCEPTED | 0.14 s | 3 | details | 
| #16 | ACCEPTED | 0.17 s | 3 | details | 
Code
import math
import timeit
from typing import Callable
def I():
    return map(int, input().split())
# for larger x, x! has an unique number of digits
def binarysearch(func: "Callable[[int],bool]", m=0):
    """search the smallest >=m integer x for which func(x) is true.
     (func must be a function that returns False for all >=m integers less than x,
    and True for all >=m integers greater than or equal to x)"""
    k = 1
    m -= 2  # y>m-2 where y is the greatest integer for which func(y) is False
    while not func(k * 2 + m):
        k *= 2
    #                k//2 < out <= k
    x = k + m
    k //= 2
    while k:
        if not func(x + k):
            x += k
        k //= 2
    return x + 1
def factorial_digits(x):
    a = 1
    b = 1
    for i in range(1, x + 1):
        a *= i
        while a >= 10:
            a /= 10
            b += 1
    return b
def find_factorial_with_digit_amount(x: int):
    """x is the amount of digits y! has. finds y \n
    x has to be 4 or greater"""
    if x < 4:
        raise ValueError
    def func(a: int):
        return factorial_digits(a) >= x
    y = binarysearch(func)
    return y
def find_factorial(appearances):
    digits = sum(appearances)
    if digits <= 3:
        if digits == 1:
            if appearances[1]:
                return 1
            elif appearances[2]:
                return 2
            else:
                return 3
        elif digits == 2:
            return 4
        else:
            if appearances[1]:
                return 5
            else:
                return 6
    else:
        return find_factorial_with_digit_amount(digits)
def main():
    appearances = list(I())
    print(find_factorial(appearances))
main()
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 1 0 0 0 0 0 0 0 | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| 2 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 0 0 0 0 1 0 0 0 | 
| correct output | 
|---|
| 3 | 
| user output | 
|---|
| 3 | 
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 0 0 1 0 1 0 0 0 0 0 | 
| correct output | 
|---|
| 4 | 
| user output | 
|---|
| 4 | 
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 2 0 1 1 0 0 1 0 2 0 | 
| correct output | 
|---|
| 10 | 
| user output | 
|---|
| 10 | 
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 9 3 1 1 2 2 3 1 6 1 | 
| correct output | 
|---|
| 27 | 
| user output | 
|---|
| 27 | 
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 10 4 3 4 3 2 2 4 3 7 | 
| correct output | 
|---|
| 36 | 
| user output | 
|---|
| 36 | 
Test 7
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 71 53 36 30 25 29 42 24 34 29 | 
| correct output | 
|---|
| 199 | 
| user output | 
|---|
| 199 | 
Test 8
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 71 33 46 38 27 45 36 21 35 35 | 
| correct output | 
|---|
| 205 | 
| user output | 
|---|
| 205 | 
Test 9
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 93 38 35 26 43 54 38 25 41 34 | 
| correct output | 
|---|
| 222 | 
| user output | 
|---|
| 222 | 
Test 10
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 33 33 45 36 43 38 54 56 36 | 
| correct output | 
|---|
| 242 | 
| user output | 
|---|
| 242 | 
Test 11
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 3419 1797 1845 1849 1879 1791 ... | 
| correct output | 
|---|
| 5959 | 
| user output | 
|---|
| 5959 | 
Test 12
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 4776 2695 2709 2781 2616 2753 ... | 
| correct output | 
|---|
| 8391 | 
| user output | 
|---|
| 8391 | 
Test 13
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 20097 12282 12229 12214 12406 ... | 
| correct output | 
|---|
| 32001 | 
| user output | 
|---|
| 32001 | 
Test 14
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 47934 29918 29878 29713 29984 ... | 
| correct output | 
|---|
| 71718 | 
| user output | 
|---|
| 71718 | 
Test 15
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 84691 54156 54277 54533 54296 ... | 
| correct output | 
|---|
| 123123 | 
| user output | 
|---|
| 123123 | 
Test 16
Group: 3
Verdict: ACCEPTED
| input | 
|---|
| 99098 63339 63878 64182 63904 ... | 
| correct output | 
|---|
| 142663 | 
| user output | 
|---|
| 142663 | 
