CSES - Aalto Competitive Programming 2025 - wk1 - Wed

Submission details
Task:	LumberUolevi
Sender:	aalto25a_005
Submission time:	2025-09-03 17:34:44 +0300
Language:	Python3 (CPython3)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.02 s	details
#2	ACCEPTED	0.02 s	details
#3	ACCEPTED	0.02 s	details
#4	ACCEPTED	0.02 s	details
#5	ACCEPTED	0.02 s	details
#6	ACCEPTED	0.02 s	details
#7	ACCEPTED	0.02 s	details
#8	ACCEPTED	0.02 s	details
#9	ACCEPTED	0.02 s	details
#10	ACCEPTED	0.02 s	details
#11	ACCEPTED	0.02 s	details
#12	ACCEPTED	0.02 s	details
#13	ACCEPTED	0.02 s	details
#14	ACCEPTED	0.02 s	details
#15	ACCEPTED	0.02 s	details
#16	ACCEPTED	0.02 s	details
#17	ACCEPTED	0.02 s	details
#18	ACCEPTED	0.02 s	details
#19	ACCEPTED	0.02 s	details
#20	ACCEPTED	0.02 s	details
#21	ACCEPTED	0.02 s	details
#22	ACCEPTED	0.02 s	details
#23	ACCEPTED	0.02 s	details
#24	ACCEPTED	0.02 s	details
#25	ACCEPTED	0.02 s	details
#26	ACCEPTED	0.02 s	details
#27	ACCEPTED	0.02 s	details
#28	ACCEPTED	0.02 s	details
#29	ACCEPTED	0.02 s	details
#30	ACCEPTED	0.02 s	details
#31	ACCEPTED	0.02 s	details
#32	ACCEPTED	0.02 s	details
#33	ACCEPTED	0.02 s	details
#34	ACCEPTED	0.02 s	details
#35	ACCEPTED	0.02 s	details
#36	ACCEPTED	0.02 s	details
#37	ACCEPTED	0.02 s	details
#38	ACCEPTED	0.02 s	details
#39	ACCEPTED	0.02 s	details
#40	ACCEPTED	0.02 s	details
#41	ACCEPTED	0.02 s	details
#42	ACCEPTED	0.02 s	details
#43	ACCEPTED	0.02 s	details
#44	ACCEPTED	0.02 s	details
#45	ACCEPTED	0.02 s	details
#46	ACCEPTED	0.02 s	details
#47	ACCEPTED	0.02 s	details
#48	ACCEPTED	0.02 s	details
#49	ACCEPTED	0.02 s	details
#50	ACCEPTED	0.02 s	details
#51	ACCEPTED	0.04 s	details
#52	ACCEPTED	0.03 s	details
#53	ACCEPTED	0.03 s	details
#54	ACCEPTED	0.02 s	details
#55	ACCEPTED	0.03 s	details
#56	ACCEPTED	0.03 s	details
#57	ACCEPTED	0.04 s	details
#58	ACCEPTED	0.03 s	details
#59	ACCEPTED	0.07 s	details
#60	ACCEPTED	0.04 s	details
#61	ACCEPTED	0.06 s	details
#62	ACCEPTED	0.05 s	details
#63	ACCEPTED	0.06 s	details

Code

import sys

dbg = 1


# strict int
def sint(x):
    if x.is_integer():
        return int(x)
    raise ValueError


def ep(*args, **kwargs):
    if dbg:
        print(*args, file=sys.stderr, **kwargs)


def p(**kwargs):
    print(", ".join([f"{k} = {v}" for (k, v) in kwargs.items()]), file=sys.stderr)


[n, k] = [int(x) for x in input().split(" ")]
p(n=n, k=k)
trees = [i for i in range(1, n + 1)]
p(trees=trees)

if k == 1:
    ep("we cut the tree at the end with n kilos to fill one truck")
    print(n)
elif k == n:
    ep("we cut all trees")
    print(*trees)
elif k % 2 == 1:
    s0 = sint((k - 1) / 2)
    s1 = sint(((k - 1) / 2) + 1)
    assert s0 + s1 == k
    ep(f"k is odd, we cut {s0} from the start and {s1} from the end")
    s0a = trees[:s0]
    s1a = trees[-s1:]
    assert len(s0a) == s0 and len(s1a) == s1
    p(start=s0a, end=s1a)
    s = s0a + s1a
    p(sum=sum(s))
    print(*s)
elif k % 2 == 0:
    s = sint(k / 2)
    ep(
        f"k is even, we cut {s} from the start and {s} from the end (except the last one)"
    )
    s0a = trees[:s]
    s1a = trees[-s - 1 : -1]
    p(start=s0a, end=s1a)
    s = s0a + s1a
    p(sum=sum(s))
    print(*s)
else:
    raise RuntimeError

Test details

Test 1

Verdict: ACCEPTED

input
`1 1` view save

correct output
`1` view save

user output
`1` view save

Error:

n = 1, k = 1
trees = [1]
we cut the tree at the end with n kilos to fill one truck

Test 2

Verdict: ACCEPTED

input
`2 1` view save

correct output
`2` view save

user output
`2` view save

Error:

n = 2, k = 1
trees = [1, 2]
we cut the tree at the end with n kilos to fill one truck

Test 3

Verdict: ACCEPTED

input
`2 1` view save

correct output
`2` view save

user output
`2` view save

Error:

n = 2, k = 1
trees = [1, 2]
we cut the tree at the end with n kilos to fill one truck

Test 4

Verdict: ACCEPTED

input
`3 2` view save

correct output
`1 2` view save

user output
`1 2` view save

Error:

n = 3, k = 2
trees = [1, 2, 3]
k is even, we cut 1 from the start and 1 from the end (exce...

Test 5

Verdict: ACCEPTED

input
`3 3` view save

correct output
`1 2 3` view save

user output
`1 2 3` view save

Error:

n = 3, k = 3
trees = [1, 2, 3]
we cut all trees

Test 6

Verdict: ACCEPTED

input
`4 1` view save

correct output
`4` view save

user output
`4` view save

Error:

n = 4, k = 1
trees = [1, 2, 3, 4]
we cut the tree at the end with n kilos to fill one truc...

Test 7

Verdict: ACCEPTED

input
`4 4` view save

correct output
`1 2 3 4` view save

user output
`1 2 3 4` view save

Error:

n = 4, k = 4
trees = [1, 2, 3, 4]
we cut all trees

Test 8

Verdict: ACCEPTED

input
`5 1` view save

correct output
`5` view save

user output
`5` view save

Error:

n = 5, k = 1
trees = [1, 2, 3, 4, 5]
we cut the tree at the end with n kilos to fill one t...

Test 9

Verdict: ACCEPTED

input
`5 5` view save

correct output
`1 2 3 4 5` view save

user output
`1 2 3 4 5` view save

Error:

n = 5, k = 5
trees = [1, 2, 3, 4, 5]
we cut all trees

Test 10

Verdict: ACCEPTED

input
`6 1` view save

correct output
`6` view save

user output
`6` view save

Error:

n = 6, k = 1
trees = [1, 2, 3, 4, 5, 6]
we cut the tree at the end with n kilos to fill on...

Test 11

Verdict: ACCEPTED

input
`10 6` view save

correct output
`1 2 3 5 9 10` view save

user output
`1 2 3 7 8 9` view save

Error:

n = 10, k = 6
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
k is even, we cut 3 from the start a...

Test 12

Verdict: ACCEPTED

input
`10 5` view save

correct output
`1 2 3 4 10` view save

user output
`1 2 8 9 10` view save

Error:

n = 10, k = 5
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
k is odd, we cut 2 from the start an...

Test 13

Verdict: ACCEPTED

input
`10 5` view save

correct output
`1 2 3 4 10` view save

user output
`1 2 8 9 10` view save

Error:

n = 10, k = 5
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
k is odd, we cut 2 from the start an...

Test 14

Verdict: ACCEPTED

input
`10 6` view save

correct output
`1 2 3 5 9 10` view save

user output
`1 2 3 7 8 9` view save

Error:

n = 10, k = 6
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
k is even, we cut 3 from the start a...

Test 15

Verdict: ACCEPTED

input
`10 10` view save

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

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

Error:

n = 10, k = 10
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
we cut all trees

Test 16

Verdict: ACCEPTED

input
`11 3` view save

correct output
`1 2 8` view save

user output
`1 10 11` view save

Error:

n = 11, k = 3
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
k is odd, we cut 1 from the star...

Test 17

Verdict: ACCEPTED

input
`11 10` view save

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

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

Error:

n = 11, k = 10
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
k is even, we cut 5 from the st...

Test 18

Verdict: ACCEPTED

input
`11 1` view save

correct output
`11` view save

user output
`11` view save

Error:

n = 11, k = 1
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
we cut the tree at the end with...

Test 19

Verdict: ACCEPTED

input
`12 11` view save

correct output
`1 2 3 4 5 7 8 9 10 11 12` view save

user output
`1 2 3 4 5 7 8 9 10 11 12` view save

Error:

n = 12, k = 11
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
k is odd, we cut 5 from the...

Test 20

Verdict: ACCEPTED

input
`12 1` view save

correct output
`12` view save

user output
`12` view save

Error:

n = 12, k = 1
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
we cut the tree at the end w...

Test 21

Verdict: ACCEPTED

input
`20 11` view save

correct output
`1 2 3 4 5 6 7 8 9 15 20` view save

user output
`1 2 3 4 5 15 16 17 18 19 20` view save

Error:

n = 20, k = 11
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 22

Verdict: ACCEPTED

input
`20 9` view save

correct output
`1 2 3 4 5 6 7 12 20` view save

user output
`1 2 3 4 16 17 18 19 20` view save

Error:

n = 20, k = 9
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 23

Verdict: ACCEPTED

input
`21 10` view save

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

user output
`1 2 3 4 5 16 17 18 19 20` view save

Error:

n = 21, k = 10
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 24

Verdict: ACCEPTED

input
`22 13` view save

correct output
`1 2 3 4 5 6 7 8 9 10 12 21 22` view save

user output
`1 2 3 4 5 6 16 17 18 19 20 21 ...` view save

Error:

n = 22, k = 13
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 25

Verdict: ACCEPTED

input
`20 20` view save

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

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

Error:

n = 20, k = 20
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 26

Verdict: ACCEPTED

input
`20 5` view save

correct output
`1 2 3 4 10` view save

user output
`1 2 18 19 20` view save

Error:

n = 20, k = 5
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 27

Verdict: ACCEPTED

input
`23 21` view save

correct output
`1 2 3 4 5 6 7 8 9 10 13 14 15 ...` view save

user output
`1 2 3 4 5 6 7 8 9 10 13 14 15 ...` view save

Error:

n = 23, k = 21
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 28

Verdict: ACCEPTED

input
`24 2` view save

correct output
`1 23` view save

user output
`1 23` view save

Error:

n = 24, k = 2
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 29

Verdict: ACCEPTED

input
`20 18` view save

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

user output
`1 2 3 4 5 6 7 8 9 11 12 13 14 ...` view save

Error:

n = 20, k = 18
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 30

Verdict: ACCEPTED

input
`25 1` view save

correct output
`25` view save

user output
`25` view save

Error:

n = 25, k = 1
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 31

Verdict: ACCEPTED

input
`123 68` view save

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

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

Error:

n = 123, k = 68
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19...

Test 32

Verdict: ACCEPTED

input
`201 84` view save

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

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

Error:

n = 201, k = 84
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19...

Test 33

Verdict: ACCEPTED

input
`200 88` view save

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

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

Error:

n = 200, k = 88
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19...

Test 34

Verdict: ACCEPTED

input
`202 112` view save

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

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

Error:

n = 202, k = 112
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 1...

Test 35

Verdict: ACCEPTED

input
`200 194` view save

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

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

Error:

n = 200, k = 194
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 1...

Test 36

Verdict: ACCEPTED

input
`204 46` view save

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

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

Error:

n = 204, k = 46
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19...

Test 37

Verdict: ACCEPTED

input
`205 184` view save

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

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

Error:

n = 205, k = 184
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 1...

Test 38

Verdict: ACCEPTED

input
`200 16` view save

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

user output
`1 2 3 4 5 6 7 8 192 193 194 19...` view save

Error:

n = 200, k = 16
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19...

Test 39

Verdict: ACCEPTED

input
`207 181` view save

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

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

Error:

n = 207, k = 181
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 1...

Test 40

Verdict: ACCEPTED

input
`201 3` view save

correct output
`1 2 198` view save

user output
`1 200 201` view save

Error:

n = 201, k = 3
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,...

Test 41

Verdict: ACCEPTED

input
`1123 617` view save

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

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

Error:

n = 1123, k = 617
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 42

Verdict: ACCEPTED

input
`2201 918` view save

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

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

Error:

n = 2201, k = 918
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 43

Verdict: ACCEPTED

input
`3200 1396` view save

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

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

Error:

n = 3200, k = 1396
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 44

Verdict: ACCEPTED

input
`2202 1213` view save

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

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

Error:

n = 2202, k = 1213
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 45

Verdict: ACCEPTED

input
`1200 1161` view save

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

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

Error:

n = 1200, k = 1161
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 46

Verdict: ACCEPTED

input
`5204 1156` view save

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

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

Error:

n = 5204, k = 1156
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 47

Verdict: ACCEPTED

input
`6205 5541` view save

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

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

Error:

n = 6205, k = 5541
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 48

Verdict: ACCEPTED

input
`3200 245` view save

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

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

Error:

n = 3200, k = 245
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 49

Verdict: ACCEPTED

input
`7207 6295` view save

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

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

Error:

n = 7207, k = 6295
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,...

Test 50

Verdict: ACCEPTED

input
`9201 96` view save

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

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

Error:

n = 9201, k = 96
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 1...

Test 51

Verdict: ACCEPTED

input
`51123 28058` view save

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

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

Error:

n = 51123, k = 28058
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1...

Test 52

Verdict: ACCEPTED

input
`32201 13429` view save

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

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

Error:

n = 32201, k = 13429
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1...

Test 53

Verdict: ACCEPTED

input
`23200 10116` view save

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

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

Error:

n = 23200, k = 10116
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1...

Test 54

Verdict: ACCEPTED

input
`12202 6721` view save

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

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

Error:

n = 12202, k = 6721
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18...

Test 55

Verdict: ACCEPTED

input
`21200 20502` view save

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

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

Error:

n = 21200, k = 20502
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1...

Test 56

Verdict: ACCEPTED

input
`35204 7816` view save

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

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

Error:

n = 35204, k = 7816
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18...

Test 57

Verdict: ACCEPTED

input
`46205 41255` view save

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

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

Error:

n = 46205, k = 41255
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1...

Test 58

Verdict: ACCEPTED

input
`63200 4823` view save

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

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

Error:

n = 63200, k = 4823
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18...

Test 59

Verdict: ACCEPTED

input
`87207 76170` view save

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

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

Error:

n = 87207, k = 76170
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1...

Test 60

Verdict: ACCEPTED

input
`99201 1030` view save

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

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

Error:

n = 99201, k = 1030
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18...

Test 61

Verdict: ACCEPTED

input
`100000 54883` view save

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

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

Error:

n = 100000, k = 54883
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,...

Test 62

Verdict: ACCEPTED

input
`100000 41703` view save

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

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

Error:

n = 100000, k = 41703
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,...

Test 63

Verdict: ACCEPTED

input
`100000 43601` view save

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

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

Error:

n = 100000, k = 43601
trees = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,...

Aalto Competitive Programming 2025 - wk1 - Wed

LumberUolevi

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Tasks

Submissions (aalto25a_005)