256682026-02-24 15:20:27Samiko4321Sorozat generáláspython3Accepted 50/5061ms3520 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:
        tav = i - lista.index(X)
        break
    lista.append(X)
print(tav)

eleje = lista[:len(lista)-tav]


egesz = (N-len(eleje))//tav
maradek = (N-len(eleje))%tav
periodus = [1]*len(eleje) + [egesz]*tav
for i in range(maradek):
    periodus[len(eleje)+i] += 1

masolat = []

for x in range(len(lista)):
    masolat.append([lista[x],periodus[x]])

masolat.sort(key=lambda x:-x[0])

osszeg = 0
x = 0
while osszeg < K:
    osszeg += masolat[x][1]
    x += 1

print(masolat[x-1][0])
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/017ms3104 KiB
2Accepted0/028ms3288 KiB
3Accepted2/217ms3100 KiB
4Accepted2/217ms3188 KiB
5Accepted2/217ms3124 KiB
6Accepted2/217ms3184 KiB
7Accepted2/217ms3128 KiB
8Accepted4/417ms3168 KiB
9Accepted4/417ms3252 KiB
10Accepted4/418ms3284 KiB
11Accepted4/417ms3128 KiB
12Accepted4/417ms3232 KiB
13Accepted4/448ms3520 KiB
14Accepted4/446ms3456 KiB
15Accepted4/435ms3400 KiB
16Accepted4/450ms3472 KiB
17Accepted4/461ms3484 KiB