Submission #20,825

20825

2026-01-09 16:08:55

python3

Wrong answer 28/50

78ms

8436 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+1])

	Sum	Test	Verdict		Time	Memory
base	28/50
		1	Accepted	0/0	16ms	3116 KiB
		2	Wrong answer	0/0	76ms	8272 KiB
		3	Partially correct	1/2	16ms	3136 KiB
		4	Partially correct	1/2	17ms	3324 KiB
		5	Partially correct	1/2	17ms	3124 KiB
		6	Partially correct	1/2	17ms	3072 KiB
		7	Accepted	2/2	17ms	3076 KiB
		8	Partially correct	2/4	18ms	3520 KiB
		9	Partially correct	2/4	25ms	3892 KiB
		10	Partially correct	2/4	39ms	5644 KiB
		11	Partially correct	2/4	37ms	5448 KiB
		12	Partially correct	2/4	52ms	6608 KiB
		13	Accepted	4/4	64ms	7872 KiB
		14	Partially correct	2/4	68ms	7772 KiB
		15	Partially correct	2/4	68ms	8264 KiB
		16	Partially correct	2/4	78ms	8264 KiB
		17	Partially correct	2/4	76ms	8436 KiB