CSES - Datatähti 2023 alku - Results
Submission details
Task:Kertoma
Sender:Ihminen
Submission time:2022-11-09 18:01:00 +0200
Language:Python3 (CPython3)
Status:READY
Result:46
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED24
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.02 s2, 3details
#8ACCEPTED0.02 s2, 3details
#9ACCEPTED0.02 s2, 3details
#10ACCEPTED0.02 s2, 3details
#11ACCEPTED0.02 s3details
#12ACCEPTED0.03 s3details
#13ACCEPTED0.05 s3details
#14ACCEPTED0.09 s3details
#150.11 s3details
#160.11 s3details

Code

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, 100000):
        lM = findDigits(x)
        if (summa == lM):
            valittuNumero = x
            break



print(valittuNumero)

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:

input
84691 54156 54277 54533 54296 ...

correct output
123123

user output
0

Test 16

Group: 3

Verdict:

input
99098 63339 63878 64182 63904 ...

correct output
142663

user output
0