Submission #20,831

20831

2026-01-09 16:40:38

python3

Accepted 50/50

79ms

8388 KiB

m, start, a, b, steps, k = map(int, input().split())

def gen(gm, gs, ga, gb, gst):
    n = gs
    pows = {1: 10, 2: 100, 3: 1000,
           4: 10000, 6: 1000000, 8: 100000000, 12: 1000000000000}
    for i in range(gst):
        n = ga * n + gb
        n = (n // pows[gm]) % pows[2*gm]
        yield n

seq = gen(m, start, a, b, steps)
seen = {}
l = list(seq)
for idx, el in enumerate(l):
    if el not in seen:
        seen[el] = idx
    else:
        print(idx - seen[el])
        break

print(sorted(l)[-k])

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	16ms	3136 KiB
		2	Accepted	0/0	75ms	8272 KiB
		3	Accepted	2/2	16ms	3308 KiB
		4	Accepted	2/2	17ms	3116 KiB
		5	Accepted	2/2	17ms	3124 KiB
		6	Accepted	2/2	17ms	3320 KiB
		7	Accepted	2/2	17ms	3124 KiB
		8	Accepted	4/4	20ms	3380 KiB
		9	Accepted	4/4	27ms	4064 KiB
		10	Accepted	4/4	39ms	5660 KiB
		11	Accepted	4/4	37ms	5600 KiB
		12	Accepted	4/4	48ms	6548 KiB
		13	Accepted	4/4	67ms	8008 KiB
		14	Accepted	4/4	65ms	7972 KiB
		15	Accepted	4/4	71ms	8260 KiB
		16	Accepted	4/4	75ms	8284 KiB
		17	Accepted	4/4	79ms	8388 KiB