Submission #5956647

Source Code Expand

N,X = map(int,input().split())
L = [0] + [int(x) for x in input().split()]

D = [0] * (N+2)
answer = 1
for n in range(2,N+2):
  D[n] = D[n-1] + L[n-1]
  if D[n] <= X:
    answer += 1
    
print(answer)

Submission Info

Submission Time
Task B - Bounding
User maspy
Language Python (3.4.3)
Score 200
Code Size 211 Byte
Status AC
Exec Time 20 ms
Memory 3064 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 17
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 19 ms 3060 KiB
02.txt AC 19 ms 2940 KiB
03.txt AC 19 ms 3060 KiB
04.txt AC 20 ms 3060 KiB
05.txt AC 19 ms 2940 KiB
06.txt AC 19 ms 2940 KiB
07.txt AC 19 ms 3060 KiB
08.txt AC 19 ms 3060 KiB
09.txt AC 19 ms 2940 KiB
10.txt AC 19 ms 3060 KiB
11.txt AC 19 ms 3060 KiB
12.txt AC 19 ms 2940 KiB
13.txt AC 19 ms 3060 KiB
14.txt AC 19 ms 2940 KiB
15.txt AC 19 ms 3060 KiB
s1.txt AC 19 ms 3064 KiB
s2.txt AC 19 ms 3060 KiB