256642026-02-24 14:32:32Samiko4321Sorozat generáláspypy3Time limit exceeded 30/50398ms26096 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])
SubtaskSumTestVerdictTimeMemory
base30/50
1Accepted0/043ms19348 KiB
2Accepted0/0234ms25504 KiB
3Accepted2/239ms19388 KiB
4Accepted2/259ms21576 KiB
5Accepted2/263ms21748 KiB
6Accepted2/257ms21560 KiB
7Accepted2/250ms21452 KiB
8Accepted4/461ms21472 KiB
9Accepted4/470ms22052 KiB
10Accepted4/498ms23216 KiB
11Accepted4/493ms23528 KiB
12Accepted4/4108ms24184 KiB
13Time limit exceeded0/4398ms25320 KiB
14Time limit exceeded0/4370ms25068 KiB
15Time limit exceeded0/4361ms26096 KiB
16Time limit exceeded0/4375ms25316 KiB
17Time limit exceeded0/4381ms24808 KiB