202602026-01-05 18:09:47algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 0/5079ms32000 KiB
# UUID: 51a85abc-d669-4993-9c60-022e8d8447bf
n,x =list(map(int, input().split()))
A =list(map(int, input().split()))
o=0
c=2
j=0
o=A[1]+A[0]
for i in range(1,n-1):
    while o >=x:
        o-=A[j]
        j+=1
        c-=1
print(c)
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/039ms19624 KiB
2Runtime error0/076ms32000 KiB
3Wrong answer0/239ms19544 KiB
4Wrong answer0/243ms19408 KiB
5Wrong answer0/239ms19320 KiB
6Wrong answer0/254ms21476 KiB
7Wrong answer0/246ms21496 KiB
8Wrong answer0/248ms21480 KiB
9Wrong answer0/254ms21476 KiB
10Wrong answer0/254ms21556 KiB
11Runtime error0/267ms32000 KiB
12Runtime error0/267ms32000 KiB
13Runtime error0/279ms32000 KiB
14Runtime error0/275ms32000 KiB
15Runtime error0/267ms32000 KiB
16Runtime error0/267ms32000 KiB
17Runtime error0/275ms32000 KiB
18Runtime error0/268ms32000 KiB
19Runtime error0/276ms32000 KiB
20Runtime error0/265ms32000 KiB
21Runtime error0/276ms32000 KiB
22Runtime error0/275ms32000 KiB
23Runtime error0/267ms32000 KiB
24Runtime error0/264ms32000 KiB
25Runtime error0/276ms32000 KiB
26Runtime error0/275ms32000 KiB
27Runtime error0/267ms32000 KiB