CSES - Datatähti 2019 alku - Results
Submission details
Task:Kolikot
Sender:tassu
Submission time:2018-10-12 18:44:48 +0300
Language:Python3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.05 s1details
#20.04 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.04 s1details
#8ACCEPTED0.04 s1details
#9ACCEPTED0.04 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.04 s2details
#120.05 s2details
#13ACCEPTED0.04 s2details
#14ACCEPTED0.05 s2details
#15ACCEPTED0.04 s2details
#160.13 s2details
#17ACCEPTED0.05 s2details
#18ACCEPTED0.05 s2details
#19ACCEPTED0.05 s2details
#20ACCEPTED0.04 s2details
#210.35 s3details
#22ACCEPTED0.05 s3details
#23ACCEPTED0.05 s3details
#24ACCEPTED0.11 s3details
#25--3details
#26--3details
#27--3details
#28--3details
#29--3details
#30--3details

Code

import sys


def print_result(amount, stacks):
    print(amount)
    for stack in stacks:
        print(stack, end=" ")


def try_random_skip(skip, coins):
    used = 0
    current = 0
    goal = 1
    stacks = []
    while True:
        used += 1
        current += 1
        if current == goal:
            stacks.append(current)
            current = 0
            goal += 1
            if skip == goal:
                goal += 1
        if used == coins:
            break
    return current, stacks


def try_simplest(initial, step, coins):
    used = 0
    current = 0
    goal = initial
    stacks = []
    while True:
        used += 1
        current += 1
        if current == goal:
            stacks.append(current)
            current = 0
            goal += step
        if used >= coins:
            break

    return current, stacks


def try_all(coins):
    for i in range(1, coins):
        simplest = try_random_skip(i, coins)
        if simplest[0] == 0:
            print_result(len(simplest[1]), simplest[1])
            return

    for i in range(1, coins):
        for j in range(1, coins):
            simplest = try_simplest(i, j, coins)
            if simplest[0] == 0:
                print_result(len(simplest[1]), simplest[1])
                return

    print("failure")


if __name__ == '__main__':
    kolikot = int(input())
    try_all(kolikot)

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
failure

Test 2

Group: 1

Verdict:

input
2

correct output
1

user output
failure

Test 3

Group: 1

Verdict: ACCEPTED

input
3

correct output
2
1 2 

user output
2
1 2 

Test 4

Group: 1

Verdict: ACCEPTED

input
4

correct output
2
1 3 

user output
2
1 3 

Test 5

Group: 1

Verdict: ACCEPTED

input
5

correct output
2
1 4 

user output
2
1 4 

Test 6

Group: 1

Verdict: ACCEPTED

input
6

correct output
3
1 2 3 

user output
3
1 2 3 

Test 7

Group: 1

Verdict: ACCEPTED

input
7

correct output
3
1 2 4 

user output
3
1 2 4 

Test 8

Group: 1

Verdict: ACCEPTED

input
8

correct output
3
1 2 5 

user output
3
1 3 4 

Test 9

Group: 1

Verdict: ACCEPTED

input
9

correct output
3
1 2 6 

user output
3
1 3 5 

Test 10

Group: 1

Verdict: ACCEPTED

input
10

correct output
4
1 2 3 4 

user output
4
1 2 3 4 

Test 11

Group: 2

Verdict: ACCEPTED

input
11

correct output
4
1 2 3 5 

user output
4
1 2 3 5 

Test 12

Group: 2

Verdict:

input
54

correct output
9
1 2 3 4 5 6 7 8 18 

user output
3
1 18 35 

Test 13

Group: 2

Verdict: ACCEPTED

input
55

correct output
10
1 2 3 4 5 6 7 8 9 10 

user output
10
1 2 3 4 5 6 7 8 9 10 

Test 14

Group: 2

Verdict: ACCEPTED

input
56

correct output
10
1 2 3 4 5 6 7 8 9 11 

user output
10
1 2 3 4 5 6 7 8 9 11 

Test 15

Group: 2

Verdict: ACCEPTED

input
123

correct output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
15
1 2 3 4 5 6 7 8 9 10 11 12 14 ...

Test 16

Group: 2

Verdict:

input
819

correct output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
3
1 273 545 

Test 17

Group: 2

Verdict: ACCEPTED

input
820

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 18

Group: 2

Verdict: ACCEPTED

input
821

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 19

Group: 2

Verdict: ACCEPTED

input
999

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 20

Group: 2

Verdict: ACCEPTED

input
1000

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 21

Group: 3

Verdict:

input
1274

correct output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
2
1 1273 

Test 22

Group: 3

Verdict: ACCEPTED

input
1275

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 23

Group: 3

Verdict: ACCEPTED

input
1276

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 24

Group: 3

Verdict: ACCEPTED

input
12345

correct output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 25

Group: 3

Verdict:

input
123456

correct output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 26

Group: 3

Verdict:

input
10000000

correct output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 27

Group: 3

Verdict:

input
100000000

correct output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 28

Group: 3

Verdict:

input
500000000

correct output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 29

Group: 3

Verdict:

input
999999999

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 30

Group: 3

Verdict:

input
1000000000

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)