Submission #19,500

19500

2025-12-11 10:54:25

python3

Accepted 50/50

226ms

7508 KiB

M,X,A,B,N,K = map(int,input().split())
T = []
for _ in range(N):
    X = X * A + B
    UjX = str(X)
    if len(str(X)) < 4*M:
        UjX = "0"*(4*M-len(str(X))) + str(X)
    X = int(UjX[M:3*M])
    T.append(X)

periodus = []
for X in T:
    if X not in periodus:
        periodus.append(X)
    else:
        i = 0
        while periodus[i] != X:
            i += 1
        print(len(periodus)-i)
        break
T.sort()
print(T[len(T)-K])

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	17ms	3312 KiB
		2	Accepted	0/0	181ms	7508 KiB
		3	Accepted	2/2	17ms	3124 KiB
		4	Accepted	2/2	26ms	3020 KiB
		5	Accepted	2/2	25ms	2980 KiB
		6	Accepted	2/2	21ms	2940 KiB
		7	Accepted	2/2	25ms	3160 KiB
		8	Accepted	4/4	32ms	3456 KiB
		9	Accepted	4/4	57ms	3808 KiB
		10	Accepted	4/4	115ms	5056 KiB
		11	Accepted	4/4	90ms	5128 KiB
		12	Accepted	4/4	120ms	6104 KiB
		13	Accepted	4/4	179ms	7008 KiB
		14	Accepted	4/4	224ms	7044 KiB
		15	Accepted	4/4	226ms	7492 KiB
		16	Accepted	4/4	202ms	7480 KiB
		17	Accepted	4/4	218ms	7484 KiB