problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03000 | s727593403 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
cnt = 1
di = 0
for li in L:
di += li
if di > X:
break
cnt += 1
print(cnt) |
p03000 | s456568838 | Accepted | N,X=list(map(int,input().split()))
L=list(map(int,input().split()))
cnt=1
d=0
for i in L:
d+=i
if d<=X:
cnt+=1
print(cnt)
|
p03000 | s069685749 | Accepted | # Bounding
# https://atcoder.jp/contests/abc130/tasks/abc130_b
from sys import stdin, stdout
n, x = map(int, stdin.readline().split())
l = list(map(int, stdin.readline().split()))
coordinates = [0]
for i in range(1, n + 1):
next_coordinate = coordinates[i - 1] + l[i - 1]
if next_coordinate > x:
break
... |
p03000 | s529940077 | Accepted | # 入力の高速化
import sys
input = sys.stdin.readline
N, X = map(int, input().split())
L = [int(x) for x in input().split()]
ans = 1
point = 0
for i in range(N) :
point += L[i]
if point <= X :
ans += 1
print(ans)
|
p03000 | s107068351 | Accepted | import sys
N, X = map(int, input().split())
L = input().split()
L = [int(i) for i in L]
d =0
count=1
for i in range(N):
d = d+L[i]
if d > X:
print(count)
sys.exit()
count+=1
print(count)
|
p03000 | s808691265 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
tx=0
ans=1
for i in range(n):
tx+=l[i]
if tx<=x: ans+=1
else: break
print(ans) |
p03000 | s216265835 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
cnt = 1
p = 0
for i in range(N):
p += L[i]
if p <= X:
cnt += 1
print(cnt) |
p03000 | s940780413 | Accepted | z = list(map(int, input().split()))
l = list(map(int, input().split()))
count = 0
t = 0
for i in range(0, z[0]+1):
if (i-1) >= 0:
count += l[i-1]
if count <= z[1]:
t += 1
print(t)
|
p03000 | s960847514 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
d = 0
for i in range(n):
if d > x:
print(i)
exit(0)
d += l[i]
if d > x:
print(n)
else:
print(n + 1)
|
p03000 | s781808191 | Accepted | N,X = list(map(int, input().split()))
L = list(map(int, input().split()))
L.insert(0,0)
cou = 0
BP = 0
for i in range(N + 1):
BP += L[i]
if BP <= X:
cou += 1
else:
print(cou)
exit()
print(cou) |
p03000 | s785446742 | Accepted | # 初期入力
import sys
input = sys.stdin.readline
N,X = (int(x) for x in input().split())
L = list(map(int, input().split()))
d =[0]*(N+1)
count =1
for i in range(N):
d[i+1] =d[i] +L[i]
if d[i+1] <= X:
count +=1
else:
break
print(count) |
p03000 | s545878903 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
L = [0] + l
a = 0
count = 1
for i in l:
a += i
if a <= x:
count += 1
print(count) |
p03000 | s632545627 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return lis... |
p03000 | s695013751 | Accepted | N, X = map(int, input().split())
Llist = list(map(int, input().split()))
now = 0
ans = 1
for i in range(N):
now += Llist[i]
if now <= X:
ans += 1
print(ans)
|
p03000 | s776510191 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
import itertools
l=[0]+l
li = list(itertools.accumulate(l))
a=[li[i] for i in range(len(li)) if li[i]<=x]
print(len(a)) |
p03000 | s571910513 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
x = 0
ans = 1
for i in range(N):
x += L[i]
if x <= X:
ans += 1
print(ans) |
p03000 | s596228153 | Accepted | N, X = map(int, input().split())
L = [int(x) for x in input().split()]
ans = 1
D = 0
for i in range(N):
D += L[i]
if D <= X:
ans += 1
print(ans) |
p03000 | s901323718 | Accepted | import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))
n,x=inp()
l=linp()
d=0
ans=1
for i in range(1,n+1):
d=l[i-1]+d
if d<=x:ans+=1
print(ans)
|
p03000 | s791550602 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
d = 0
counter = 1
for i in range(n):
d += l[i]
if d <= x:
counter += 1
print(counter) |
p03000 | s751407357 | Accepted | N, X = list(map(int, input().split()))
L = list(map(int, input().split()))
za = 0
for count in range(N):
za += L[count]
if za > X:
break
else:
count += 1
print(count+1) |
p03000 | s375416295 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
count = 1
d = 0
for li in l:
d += li
if d > x:
break
count += 1
print(count) |
p03000 | s298764788 | Accepted | # ABC130B
n, x = map(int, input().split())
l = list(map(int, input().split()))
s = 0
for i in range(n):
s += l[i]
if s > x:
print(i+1)
break
else:
print(n+1)
|
p03000 | s981155275 | Accepted | def main():
N, X = map(int, input().split())
L = list(map(int, input().split()))
D = 0
for cnt in range(2, N + 2):
D += L[cnt - 2]
if D > X:
cnt -= 1
break
print(cnt)
if __name__ == "__main__":
main()
|
p03000 | s328339135 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
D = 0
counter = 1
for i in range(N):
D = D + L[i]
if D <= X:
counter += 1
else:
break
print(counter) |
p03000 | s923238339 | Accepted | n, x = map(int, input().split())
cnt = 1
now = 0
for l in map(int, input().split()):
now += l
if now > x:
break
cnt += 1
print(cnt) |
p03000 | s614359029 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
D = 0
ans = 1
for i in L:
D += i
if D <= X:
ans += 1
print(ans) |
p03000 | s184289667 | Accepted | n, x = map(int,input().split())
l = list(map(int,input().split()))
y = 0
ans = 1
for i in l:
y = y + i
if y <= x:
ans = ans + 1
print(ans) |
p03000 | s094535463 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
cnt = 1
d = 0
for i in range(N):
d = d + L[i]
if d <= X:
cnt += 1
print(cnt)
|
p03000 | s196442672 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
L=[]; cnt=0
L.append(0)
for i in range(n):
L.append(L[i]+l[i])
for i in L:
if i<=x: cnt+=1
else: break
print(cnt) |
p03000 | s081448341 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
d = 0
cnt = 1
for i in range(n):
d = d + l[i]
if d > x:
break
cnt += 1
print(cnt)
|
p03000 | s329729056 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
ans=1
place=0
for i in l:
place+=i
if place>x:
break
ans+=1
print(ans) |
p03000 | s426215367 | Accepted | X, N = list(map(int,input().split()))
L = list(map(int,input().split()))
import numpy as np
l = np.cumsum(L)
print(len(l[l<=N])+1) |
p03000 | s781874667 | Accepted | n, x = map(int, input().split())
L = list(map(int, input().split()))
ans = 1
D_i = 0
for l in L:
D_i += l
if D_i <= x:
ans += 1
print(ans)
|
p03000 | s224001394 | Accepted | n, x = map(int,input().split())
l = [int(i) for i in input().split()]
d = [0] * (n+1)
for i in range(1, n+1):
d[i] = d[i-1] + l[i-1]
ans = len([i for i in d if i <= x])
print(ans) |
p03000 | s683844328 | Accepted | k=0
s=0
a,b=map(int,input().split())
L=list(map(int,input().split()))
for i in range(a):
s+=L[i]
if s<=b:
k+=1
print(k+1) |
p03000 | s111347838 | Accepted | n,x = map(int,input().split())
L = list(map(int,input().split()))
sum = 0
count = 1
for j in range(n):
sum += L[j]
if sum <= x:
count += 1
else:
pass
print(count) |
p03000 | s399473217 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
bound_count = 1
d = 0
for i in range(N):
d += L[i]
if X < d:
break
else:
bound_count += 1
print(bound_count) |
p03000 | s448599790 | Accepted | r=input().split()
N=int(r[0])
X=int(r[1])
d=[int(s) for s in input().split()]
ans=1
le=0
for i in range(N):
le+=d[i]
if le>X:
print(ans)
break
elif i==N-1:
print(N+1)
else:
ans+=1 |
p03000 | s492018071 | Accepted | import bisect
N,X=map(int,input().split())
L=list(map(int,input().split()))
for i in range(N-1):L[i+1]+=L[i]
print(bisect.bisect_left(L,X+1)+1) |
p03000 | s561805655 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
D = 0
count = 0
for i in range(N+1):
if D <= X:
count += 1
if i != N:
D = D + L[i]
print(count) |
p03000 | s232478175 | Accepted | def resolve():
n, x = map(int, input().split())
l = list(map(int, input().split()))
bound = [0]
for i in range(1, n+1):
bound.append(l[i-1]+bound[i-1])
ans = 0
for i in range(n+1):
if bound[i] <= x:
ans += 1
print(ans)
resolve() |
p03000 | s761927580 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
total = 0
count = 0
for i in l:
total += i
if total <= x:
count += 1
print(count + 1) |
p03000 | s939984211 | Accepted | import itertools
N, X = map(int, input().split())
l = list(map(int, input().split()))
l.insert(0,0)
l_acc = list(itertools.accumulate(l))
answer = [x for x in l_acc if x<=X]
print(len(answer)) |
p03000 | s402431592 | Accepted | n,x=map(int,input().split())
l=[0]+list(map(int,input().split()))
from itertools import accumulate
d=list(accumulate(l))
# print(l)
# print(d)
ans=0
for dd in d:
if dd<=x:
ans+=1
print(ans)
|
p03000 | s201022953 | Accepted | def getint():
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
return a
num,lim = getint()
l = getint()
sumup = 0
k = True
for i in range(num):
sumup = sumup + l[i]
if sumup > lim:
print(i+1)
k = False
break
if k ==True:
print(num+1) |
p03000 | s447906270 | Accepted | N, X = map(int, input().split())
Ls = [int(i) for i in input().split()]
Ds = [0]
for i, l in enumerate(Ls):
Ds.append(Ds[i] + l)
ans = 0
for d in Ds:
if d <= X:
ans += 1
print(ans)
|
p03000 | s049788741 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
ans=1
D=0
for i in range(N):
D=D+L[i]
if D<=X:
ans+=1
else:
break
print(ans) |
p03000 | s518954172 | Accepted | n, x=map(int,input().split())
l=list(map(int, input().split()))
ans=1
cnt=0
for i in range(n):
cnt+=l[i]
if cnt > x:
break
else:
ans+=1
print(ans) |
p03000 | s376566478 | Accepted | A,B=map(int,input().split(' '))
l=list(map(int,input().split(' ')))
ans=0
count=1
for i in l:
ans+=i
if ans<=B:
count+=1
print(count)
|
p03000 | s124074038 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
S = [0]
for i in range(N):
S.append(S[i] + L[i])
ans = 0
for j in range(N+1):
if S[j] <= X:
ans += 1
print(ans) |
p03000 | s178433569 | Accepted | n, x = map(int,input().split())
l = list(map(int, input().split()))
s = 0
count = 1
for i in l:
s += i
if s > x:
break
count += 1
print(count)
|
p03000 | s666808738 | Accepted | def solve():
N, M = map(int, input().split())
A = list(map(int, input().split()))
l = [0]
d = 0
for a in A:
d += a
l.append(d)
c = 0
for a in l:
if a <= M:
c += 1
return c
print(solve()) |
p03000 | s007008586 | Accepted | N, X = map(int,input().split())
L = list(map(int,input().split()))
D = [0]
ans = 1
for i in range(0,N):
D.append(D[i]+L[i])
if D[i+1] > X:
break
else:
ans += 1
print(ans)
|
p03000 | s729054620 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
D = 0
result = [0]
for i in range(N):
D = D + L[i]
if D>X:
print(i+1)
quit()
print(N+1)
|
p03000 | s223384085 | Accepted | N,X=list(map(int, input().split()))
L=list(map(int, input().split()))
c=1
x=0
for i in range(N):
x+=L[i]
if x<=X:
c+=1
print(c)
|
p03000 | s023793279 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
cnt = 1
a = 0
for i in range(0, len(l)):
a += l[i]
if a <= x:
cnt += 1
print(cnt) |
p03000 | s353465691 | Accepted | n,x=map(int,input().split())
a = list(map(int,input().split()))
p = 1
f = 0
for i in a:
f += i
if f <= x:
p += 1
else:
break
print(p) |
p03000 | s330085318 | Accepted | n, x = [int(i) for i in input().split()]
l_list = [int(i) for i in input().split()]
ans = 1
d = 0
for l in l_list:
d += l
if d > x:
break
ans += 1
print(ans) |
p03000 | s582584041 | Accepted | def solve():
n, x = map(int, input().split())
l = list(map(int, input().split()))
d = 0
count = 1
for i in range(1, n+1):
d = d + l[i-1]
if d > x:
print(count)
exit()
count += 1
print(count)
if __name__ == '__main__':
solve()
|
p03000 | s677589062 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().spl... |
p03000 | s178959398 | Accepted | n,x=[int(x) for x in input().split()]
l=[int(x) for x in input().split()]
d=0
cnt=1
for i in range(n):
d=d+l[i]
if d<=x:
cnt+=1
print(cnt) |
p03000 | s031660476 | Accepted | n, x = map(int, input().split())
l_l = map(int, input().split())
z = 0
cnt = 1
for i in l_l:
z += i
if z <= x:
cnt += 1
else:
break
print(cnt) |
p03000 | s446106168 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
xlist = [0]
num = 0
for i in l:
num += i
xlist.append(num)
cnt = 0
for j in xlist:
if j <= x:
cnt += 1
print(cnt) |
p03000 | s283880517 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
D = 0
ans = 1
for i in range(1, N+1):
D = D+L[i-1]
if D <= X:
ans += 1
else:
break
print(ans) |
p03000 | s697201815 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
count = 1
point = 0
for i in range(0,N,1):
point = point + L[i]
if X >= point:
count+=1
else:
break
print(count)
|
p03000 | s843576162 | Accepted | class Solution:
def solve(self, N: int, X: int, L) -> str:
count = 1
distance = 0
for l in L:
distance += l
if distance > X:
break
count += 1
return count
if __name__ == '__main__':
# standard input
N, X = map(int, in... |
p03000 | s228986087 | Accepted |
from itertools import accumulate
n,x=map(int,input().split())
l=list(map(int,input().split()))
b = list(accumulate(l)) # 累積和のリスト
b_n=[int(i) for i in b if i<=x]
print(len(b_n)+1) |
p03000 | s668756171 | Accepted | N, X = map(int,input().split(" "))
L = [int(i) for i in input().split(" ")]
D = 0
count = 1
for i in range(N):
D+=L[i]
if D<=X:
count+=1
print(count) |
p03000 | s069580367 | Accepted | n, x = map(int, input().split())
ns = list(map(int, input().split()))
d = 0
count = 1
for i in range(n):
if d + ns[i] <= x:
d += ns[i]
count += 1
else:
break
print(count) |
p03000 | s615561686 | Accepted | N,X=map(int,input().split())
L=[int(x) for x in input().split()]
D=[0]*(N+1)
for i in range(1,N+1):
D[i]=D[i-1]+L[i-1]
ans=0
for d in D:
if d<=X:
ans+=1
print(ans)
|
p03000 | s767044630 | Accepted | N, X = [int(i) for i in input().split()]
LS = [int(i) for i in input().split()]
s = 0
cnt = 1
for l in LS:
s += l
if s <= X:
cnt += 1
else:
break
print(cnt)
|
p03000 | s922787499 | Accepted | mi = lambda : map(int, input().split())
li = lambda : list(map(int, input().split()))
import numpy as np
n, x = mi()
l = li()
hane = [0]
for i in range(n):
d = hane[-1]
hane.append(int(d+l[i]))
hane = np.array(hane)
ans = np.count_nonzero(hane <= x)
print(ans) |
p03000 | s395073736 | Accepted | N, X = map(int, input().split())
L = [int(i) for i in input().split()]
bound = 1
d = 0
for l in L:
if d + l > X:
break
else:
bound += 1
d += l
print(bound) |
p03000 | s946806671 | Accepted | n,x = map(int,input().split())
l = list(map(int,input().split()))
sum = 0
ans = 0
for i in l:
sum += i
if sum <= x:
ans += 1
print(ans+1) |
p03000 | s561122705 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
#0start
cnt = 1
suml = 0
for i in range(n):
suml += l[i]
if suml <= x:
cnt += 1
print(cnt)
|
p03000 | s600728317 | Accepted | n, x = map(int,input().split())
l = list(map(int,input().split()))
d = 0
count = 1
for i in range(n):
d += l[i]
if d <= x:
count += 1
else:
print(count)
quit()
print(count) |
p03000 | s532789316 | Accepted | N,X=map(int,input().split())
l=list(map(int,input().split()))
d=0
cnt=1
while True:
d+=l[cnt-1]
if d>X:
print(cnt)
break
cnt+=1
if cnt==N+1:
print(N+1)
break
else:
print(cnt) |
p03000 | s264272542 | Accepted | n,x=list(map(int, input().split()))
l=list(map(int, input().split()))
res = 1
hane = 0
for i in range(n):
hane += l[i]
if hane <= x: res +=1
else : break
print(res)
|
p03000 | s145770110 | Accepted | n,x=map(int,input().split())
L=list(map(int,input().split()))
f=0
for i in range(n+1):
if sum(L[a] for a in range(i))<=x:
f+=1
print(f)
|
p03000 | s853390042 | Accepted | n,x=map(int,input().split())
l=[0]*n
l[:]=map(int,input().split())
d=0
for ii in range(n):
d+=l[ii]
if d>x:
print(ii+1)
exit()
print(n+1) |
p03000 | s622801271 | Accepted | n ,x = map(int,input().split())
l = [int(k) for k in input().split()]
d = 0
cnt = 1
for i in range(n):
d += l[i]
if d <= x:cnt += 1
print(cnt) |
p03000 | s612665685 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
cnt = 1
dist = 0
for i in range(N):
dist += L[i]
if dist > X: break
cnt += 1
print(cnt) |
p03000 | s153778343 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
d = [0]*(n+1)
for i in range(n):
d[i+1] = d[i] + l[i]
ans = 0
for j in range(n+1):
if d[j] <= x:
ans += 1
else:
break
print(ans) |
p03000 | s283498849 | Accepted | def main():
N, X = (int(i) for i in input().split())
L = [int(i) for i in input().split()]
from itertools import accumulate
S = list(accumulate([0] + L))
ans = 0
for s in S:
if X < s:
break
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p03000 | s838641792 | Accepted | n, x = map(int, input().split())
L = list(map(int, input().split()))
D = [0] * (n + 1)
for i in range(n):
D[i + 1] = D[i] + L[i]
from bisect import bisect_left, bisect_right
idx = bisect_right(D, x)
print(len(D[:idx])) |
p03000 | s738015265 | Accepted | read = lambda: list(map(int, input().split()))
n, x = read()
l = read()
s = 0
ans = 1
for ind, d in enumerate(l):
s += d
if s > x:
break
ans += 1
print(ans) |
p03000 | s868858250 | Accepted | N, X = list(map(int, input().split()))
L = list(map(int, input().split()))
D = 0
a = 1
for i in range(N):
D = D + L[i]
if D <= X:
a += 1
else:
break
print(a) |
p03000 | s540367541 | Accepted | N, X = map(int, input().split())
Llist = list(map(int, input().split()))
for i in range(N+1):
if sum(Llist[:i]) > X:
print(i)
exit()
else:
print(i+1)
|
p03000 | s836619513 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
S=[0]
sum_L=0
for i in range(N):
sum_L+=L[i]
S.append(sum_L)
counter=0
for i in range(N+1):
if S[i]<=X:
counter+=1
print(counter)
|
p03000 | s296388471 | Accepted | n, x = map(int, input().split())
l = [int(i) for i in input().split()]
d, cnt = 0, 1
for li in l:
d += li
if d <= x:
cnt += 1
print(cnt) |
p03000 | s646015013 | Accepted | n, x = map(int, input().split())
L = list(map(int, input().split()))
D = [0] * (n + 1)
ans = 1
for i in range(1, n + 1):
D[i] = D[i - 1] + L[i - 1]
if D[i] <= x:
ans = ans + 1
else:
break
print(ans) |
p03000 | s255363306 | Accepted | n, x = map(int, input().split())
list = list(map(int, input().split()))
jump_point = [0]
tmp = 0
for point in list:
tmp += point
jump_point.append(tmp)
ans = 0
for i in jump_point:
if i <= x:
ans += 1
print(ans) |
p03000 | s095037224 | Accepted | n,x,*l=map(int,open(0).read().split())
print(sum(x >= sum(l[:i+1])for i in range(n))+1) |
p03000 | s636449450 | Accepted | N,X = map(int,input().split())
L = [int(i) for i in input().split()]
D = 0
count = 1
for n in L:
D += n
if D > X or count > N + 1:
break
count += 1
print(count) |
p03000 | s120219527 | Accepted | line = input()
X, Y = [int(n) for n in line.split()]
line = input()
numbers = [int(n) for n in line.split()]
predicted_value = 1
for num in numbers:
if Y - num >= 0:
predicted_value += 1
Y -= num
else:
break
print(predicted_value) |
p03000 | s454361015 | Accepted | def main():
N, X = map(int, input().split())
L = map(int, input().split())
d = 0
ans = 1
for l in L:
d += l
if d <= X:
ans += 1
else:
break
print(ans)
if __name__ == '__main__':
main()
|
p03000 | s830282092 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
cnt = 0
if sum(L) <= X:
print(N+1)
else:
for i in range(N+1):
if cnt <= X:
cnt += L[i]
else:
print(i)
break |
p03000 | s225904133 | Accepted | n,x = map(int,input().split())
l = list(map(int,input().split()))
cnt = 1
t = 0
for v in l:
t += v
if t>x:
break
cnt += 1
print(cnt) |
p03000 | s715722329 | Accepted | N,X = map(int,input().split())
L = list(input().split())
A = 0
count = 1
for i in range(N):
A += int(L[i])
if A <= X:
count += 1
print(count) |
p03000 | s992149218 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
cumlate = [0]*(n+1)
for i in range(n):
cumlate[i+1] = cumlate[i] + l[i]
if x < cumlate[i+1]:
print(i+1)
exit()
else:
print(n+1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.