250422026-02-17 15:05:44Samiko4321Leggyorsabb pénzkeresés (50)python3Time limit exceeded 6/50300ms14676 KiB
N,P = map(int,input().split())
F = list(map(int,input().split()))

nap = N

for i in range(N):
    osszeg = 0
    for j in range(i,N):
        osszeg += F[j]
        if osszeg >= P:
            if j - i + 1 < nap:
                nap = j - i + 1

print(nap)
SubtaskSumTestVerdictTimeMemory
base6/50
1Accepted0/014ms3056 KiB
2Time limit exceeded0/0293ms14464 KiB
3Accepted2/217ms2876 KiB
4Accepted2/216ms2872 KiB
5Accepted2/217ms3296 KiB
6Time limit exceeded0/2284ms4168 KiB
7Time limit exceeded0/2284ms4144 KiB
8Time limit exceeded0/2300ms4144 KiB
9Time limit exceeded0/2282ms4148 KiB
10Time limit exceeded0/2300ms4148 KiB
11Time limit exceeded0/2300ms14572 KiB
12Time limit exceeded0/2291ms14616 KiB
13Time limit exceeded0/2282ms14612 KiB
14Time limit exceeded0/2284ms14616 KiB
15Time limit exceeded0/2287ms14612 KiB
16Time limit exceeded0/2300ms14616 KiB
17Time limit exceeded0/2287ms14616 KiB
18Time limit exceeded0/2287ms14616 KiB
19Time limit exceeded0/2291ms14532 KiB
20Time limit exceeded0/2300ms14616 KiB
21Time limit exceeded0/2289ms14616 KiB
22Time limit exceeded0/2287ms14616 KiB
23Time limit exceeded0/2300ms14616 KiB
24Time limit exceeded0/2282ms14484 KiB
25Time limit exceeded0/2286ms14620 KiB
26Time limit exceeded0/2284ms14676 KiB
27Time limit exceeded0/2300ms14612 KiB