Submission #25,663

2026-02-24 14:32:08

python3

Time limit exceeded 22/50

400ms

5992 KiB

M,X,A,B,N,K = map(int,input().split())

lista = []

tav = 0

for i in range(N):
    X = X*A+B
    jegy = len(str(X))
    uj = "0"*(4*M-jegy) + str(X)
    kozep = uj[M:3*M]
    X = int(kozep)
    if X in lista and tav == 0:
        tav = i - lista.index(X)
    lista.append(X)

lista.sort(reverse=True)

print(tav)

print(lista[K-1])

	Sum	Test	Verdict		Time	Memory
base	22/50
		1	Accepted	0/0	16ms	3084 KiB
		2	Time limit exceeded	0/0	381ms	4336 KiB
		3	Accepted	2/2	16ms	2868 KiB
		4	Accepted	2/2	25ms	3084 KiB
		5	Accepted	2/2	24ms	3124 KiB
		6	Accepted	2/2	21ms	3124 KiB
		7	Accepted	2/2	27ms	2952 KiB
		8	Accepted	4/4	50ms	3424 KiB
		9	Accepted	4/4	115ms	3892 KiB
		10	Time limit exceeded	0/4	351ms	5108 KiB
		11	Accepted	4/4	237ms	5108 KiB
		12	Time limit exceeded	0/4	335ms	5992 KiB
		13	Time limit exceeded	0/4	388ms	3636 KiB
		14	Time limit exceeded	0/4	400ms	3628 KiB
		15	Time limit exceeded	0/4	377ms	3696 KiB
		16	Time limit exceeded	0/4	386ms	3708 KiB
		17	Time limit exceeded	0/4	381ms	3636 KiB