problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03000 | s577339499 | Accepted | N, X = map(int,input().split())
L = list(map(int,input().split()))
D = [0 for i in range(N+1)]
for i in range(N):
D[i+1]=D[i]+L[i]
cnt = 0
for i in range(N+1):
if D[i]<=X:
cnt+=1
print(cnt) |
p03000 | s127663772 | Accepted | n, x = map(int, input().split())
L = list(map(int, input().split()))
reach = 0
for i, v in enumerate(L):
reach += v
if reach > x:
print(i + 1)
exit()
print(n + 1) |
p03000 | s829537879 | Accepted | import sys
def solve():
input = sys.stdin.readline
N, X = map(int, input().split())
L = [int(l) for l in input().split()]
count = 1
now = 0
for i, l in enumerate(L):
now += l
if now <= X: count += 1
print(count)
return 0
if __name__ == "__main__":
solve() |
p03000 | s318452732 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
p = 0
i = 0
ans = 1
for i in range(N):
p += L[i]
if p > X:
break
ans += 1
print(ans)
|
p03000 | s778975442 | Accepted | N, X = map(int, input().split())
L = [int(x) for x in input().split()]
D = 0
ans = 1
for i in range(N):
D += L[i]
if D <= X:
ans += 1
else:
break
print(ans) |
p03000 | s238878389 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
ans=0
d=0
if d<=X:
ans+=1
for x in range(N):
d=d+L[x]
if d<=X:
ans+=1
print(ans) |
p03000 | s877177900 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
t = 0
cnt = 1
for i in range(N):
if t+L[i] <= X:
t+= L[i]
cnt += 1
else:
break
print(cnt) |
p03000 | s916416714 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
count = 1
p = 0
for i in L:
if p + i <= X:
count += 1
p += i
else:
break
print(count) |
p03000 | s550560760 | Accepted | n,x=map(int,input().split())
L=list(map(int,input().split()))
ans=1
d=0
for i in range(n):
d+=L[i]
if d<=x:
ans+=1
print(ans) |
p03000 | s490024189 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
D = 0
A = 0
if D <= X:
A += 1
for i in L:
D += i
if D <= X:
A += 1
print(A) |
p03000 | s585100753 | Accepted | f=lambda:map(int,input().split())
_,x=f();c,d=1,0
for i in f():
d+=i
if d>x: break
c+=1
print(c) |
p03000 | s335964063 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
List = [0]*(N+1)
for i in range(1,N+1):
List[i] = List[i-1] + L[i-1]
import bisect
# A = [i for i in List if i <=X]
# print(len(A))
print(bisect.bisect_left(List,X+1))
|
p03000 | s257319130 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
jump = [0]
num = 0
for i in range(N):
num += L[i]
jump.append(num)
ans = 0
for i in jump:
if i <= X:
ans += 1
print(ans)
|
p03000 | s393817803 | Accepted | N,X=map(int, input().split())
L=list(map(int, input().split()))
ans=1
now=0
for l in L:
now+=l
if now<=X:
ans+=1
print(ans) |
p03000 | s461388359 | Accepted | n,x = map(int, input().split())
L = list(map(int, input().split()))
l = [0] * (n+1)
for i in range(1,n+1):
l[i] = l[i-1] + L[i-1]
ans = 0
for a in l:
if a <= x: ans += 1
print(ans) |
p03000 | s709942350 | Accepted | import bisect as bi
I=lambda:list(map(int,input().split()))
n,x=I()
l=I()
ans=0
t=0
for i in range(1,n):
l[i]+=l[i-1]
an=bi.bisect(l,x)
print(an+1)
|
p03000 | s218503758 | Accepted | # import itertools
# import math
def solve(N, X, L):
ans = 1
now = 0
for ll in L:
now += ll
if now <= X:
ans += 1
return ans
# N = int(input())
# S = input()
N, X = map(int, input().split())
L = list(map(int, input().split()))
# P = []
# S = []
# for i in range(N):
# ... |
p03000 | s472020248 | Accepted | miis=lambda:map(int,input().split())
lmiis=lambda:list(map(int,input().split()))
n,x=miis()
l=lmiis()
dis=0
ans=1
for i in l:
if dis+i<=x:
ans+=1
dis+=i
else:
break
print(ans) |
p03000 | s024027664 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
ans = 1
bound = 0
for l in L:
bound += l
if bound > X:
break
ans += 1
print(ans)
|
p03000 | s186329945 | Accepted | n, x = map(int, input().split())
L = list(map(int, input().split()))
count = 0
sum = 0
for i in L:
sum += i
if sum <= x:
count += 1
else:
continue
print(count+1)
|
p03000 | s279038087 | Accepted | N, X = map(int, input().split())
L_li = list(map(int, input().split()))
ans = 1
d = 0
for i in range(N):
d = d + L_li[i]
if d > X :
break
ans += 1
print(ans)
|
p03000 | s405310620 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
D=0
cnt=1
for i in L:
D += i
if D<=X:cnt+=1
print(cnt) |
p03000 | s831927778 | Accepted | N,X=map(int, input().split())
L=list(map(int, input().split()))
L.append(0)
d = 0
count = 0
#跳ねる直前からスタート
for i in range(1, N+2):
if d <= X:
count = count + 1
d = d + L[i-1]
print(count) |
p03000 | s388441663 | Accepted | N, X = map(int, input().split())
Ls = list(map(int, input().split()))
D = 0
ans = 1
for L in Ls:
D += L
if D > X:
break
ans += 1
print(ans)
|
p03000 | s174835156 | Accepted | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, X = lr()
L = lr()
cnt = 1
cur = 0
for l in L:
cur += l
if cur > X:
break
cnt += 1
answer = cnt
print(answer)
|
p03000 | s317570445 | Accepted | def ll():
return list(map(int,input().split()))
def l():
return int(input())
n,x = ll()
l = ll()
d = 0
count=0
for i in range(n):
d +=l[i]
if d<=x:
count+=1
print(count+1) |
p03000 | s110023266 | Accepted | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n,x = iim()
L = iil()
ans = 1
dis = 0
for item in L:
dis += item
if dis <= x:
ans += 1
els... |
p03000 | s078809984 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
bound = [0]
for i in range(n):
bound.append(bound[i]+l[i])
ans = sum(i<=x for i in bound)
print(ans)
|
p03000 | s420491464 | Accepted | n,y=map(int,input().split())
lst=list(map(int,input().split()))
lst=[0]+lst
cnt=0
sum_lst=0
for i in range(n+1):
sum_lst+=lst[i]
if sum_lst<=y:
cnt+=1
print(cnt) |
p03000 | s022703960 | Accepted | n,x=map(int,input().split())
arr=list(map(int,input().split()))
d=0
ans=1
for a in arr:
d+=a
if d <= x:
ans+=1
print(ans)
|
p03000 | s388758724 | Accepted | n,x = map(int,input().split())
l = list(map(int,input().split()))
s = 1
c = 0
for i in range(n):
c += l[i]
if x >= c:
s += 1
else:
break
print(s)
|
p03000 | s758471397 | Accepted | N, X = list(map(int, input().split()))
L = list(map(int, input().split()))
ans = 1
t = 0
for i in L:
t += i
if t <= X:
ans += 1
print(ans)
|
p03000 | s391104016 | Accepted | N,X=map(int,input().split())
p=0
cnt=1
for i in map(int,input().split()):
p+=i
if (X<p):break
cnt+=1
print(cnt) |
p03000 | s397322982 | Accepted | N,X = map(int,input().split())
L = [int(i) for i in input().split()]
D = 0
for i in range(N) :
D = L[i]+D
# print(i,D)
if D>X :
print(i+1)
exit()
print(N+1) |
p03000 | s598975948 | Accepted | N,X = map(int,input().split())
l=[0]
l += list(map(int,input().split()))
sum=0
for i in range(N+1):
sum += l[i]
if sum>X:
print(i)
exit()
print(N+1)
|
p03000 | s741221615 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
curr_bounce = 0
cnt = 1
for i in range(N):
curr_bounce += L[i]
if curr_bounce > X:
break
else:
cnt += 1
print(cnt) |
p03000 | s543813583 | Accepted | # AtCoder
N, X = map(int, input().split())
L = list(map(int, input().split()))
def cumsum(xs):
result = [xs[0]]
for x in xs[1:]:
result.append(result[-1] + x)
return result
count = 1
cs = cumsum(L)
for i in cs:
if X >= i:
count += 1
print(count)
|
p03000 | s899435657 | Accepted | N, X = map(int, input().split())
L = map(int, input().split())
D = 0
ans = 1
for l in L:
D = D + l
if D > X:
break
ans += 1
print(ans) |
p03000 | s970102397 | Accepted | #!/usr/bin/env python3
# https://atcoder.jp/contests/abc130/tasks/abc130_b
n, x = [int(x) for x in input().split()]
li = [int(x) for x in input().split()]
li2 = [0] + [sum(li[:i + 1]) for i, n in enumerate(li)]
li2 = [n for n in li2 if n <= x]
print(len(li2))
|
p03000 | s592385470 | Accepted | n,x = map(int, input().split())
l = list(map(int, input().split()))
d = [0]*(n+1)
for i in range(1,n+1):
d[i] = d[i-1]+l[i-1]
d = sorted(d)
count = 0
for i in range(n+1):
if d[i]>x:
break
count += 1
print(count) |
p03000 | s141586213 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
d = 0
cnt = 1
for i in range(N):
d += L[i]
if d <= X:
cnt += 1
print(cnt)
|
p03000 | s220830007 | Accepted | import bisect
N,X = map(int,input().split())
L =list(map(int,input().split()))
cnt = 0
M = [0]
for i in range(N):
cnt += L[i]
M.append(cnt)
print(bisect.bisect_right(M,X)) |
p03000 | s245068264 | Accepted | # coding: utf-8
from functools import reduce
def solve(X, Ls):
return len(list(filter(
lambda x: x <= X, reduce(lambda x, y: x + [x[-1] + y], Ls, [0]))))
if __name__ == '__main__':
_, X = map(int, input().split())
print(solve(X, map(int, input().split()))) |
p03000 | s353502537 | 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 = accumulate([0] + L)
ans = 0
for s in S:
if s <= X:
ans += 1
else:
break
print(ans)
if __name__ == '__main__':
main()
|
p03000 | s033764393 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, X, *L = map(int, read().split())
ans = 1
d = 0
for l in L:
d += l
if d <= X:
ans += 1
el... |
p03000 | s605187430 | Accepted | def main():
N, X = map(int, input().split())
L = [int(a) for a in input().split()]
bound = 1
D = 0
for i in range(N):
b = D + L[i]
if b <= X:
bound += 1
D = b
print(bound)
main() |
p03000 | s815051676 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
d=0
count=1
for i in range(n):
d=d+l[i]
if d>x:
break
else:
count+=1
print(count)
|
p03000 | s763337765 | Accepted | N, X = [int(i) for i in input().strip().split()]
L = [int(i) for i in input().strip().split()]
pos = 0
res = 1
for i in range(N):
pos += L[i]
if X < pos:
break
res += 1
print(res)
|
p03000 | s882439196 | Accepted | n, x = map(int,input().split())
l = list(map(int,input().split()))
a = [0]
for i in range(n):
tmp = a[i] + l[i]
a.append(tmp)
ans = 0
for i in range(n + 1):
if (a[i] <= x):
ans = ans + 1
print(ans)
|
p03000 | s394189422 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
d=0
ans=1
for i in range(n):
d=d+l[i]
if d<=x:
ans+=1
else:
break
print(ans) |
p03000 | s793694472 | Accepted | N,X=map(int,input().split())
L = list(map(int,input().split()))
zahyo = 0
ans = 1
for i in range(len(L)):
zahyo +=L[i]
if X>=zahyo:
ans += 1
print(ans) |
p03000 | s876554026 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
ans = 1
d = 0
for i in range(1, n+1):
d = d + l[i-1]
if d > x:
break
ans += 1
print(ans) |
p03000 | s236062376 | Accepted | n,x = map(int, raw_input().split(' '))
ais = map(int, raw_input().split(' '))
count,cur,i = 0,0, 0
res = [cur]
while(i < len(ais)):
cur += ais[i]
res.append(cur)
i +=1
print len([e for e in res if e <= x]) |
p03000 | s248144589 | Accepted | n,x = map(int, input().split())
l = list(map(int, input().split()))
now=0
ans=1
for tmp in l:
now+=tmp
if now>x:
break
ans+=1
print(ans) |
p03000 | s093665132 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
D = 0
cnt = 1
for l in L:
D += l
if D > X:
break
else:
cnt += 1
print(cnt) |
p03000 | s427383401 | Accepted | n,x=map(int,input().split())
l=[int(i) for i in input().split()]
d=0
ans=n
for i in range(n):
d=d+l[i]
if d>x:
ans=i
break
print(ans+1) |
p03000 | s180073141 | Accepted | n, x = map(int, input().split())
Ls = list(map(int, input().split()))
ans = 1
temp = 0
for l in Ls:
temp += l
if temp <= x:
ans += 1
print(ans) |
p03000 | s531224202 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
sum_list = [sum(L[:i]) for i in range(N+1)]
count = 0
for i in sum_list:
if i <= X:
count +=1
print(count) |
p03000 | s208860845 | Accepted | import sys
from sys import stdin
n, x = map(int, stdin.readline().split())
count = 1
num = 0
num_list = [0]
l = list(map(int, stdin.readline().split()))
for i in l:
num += i
num_list.append(num)
if(num > x):
print(count)
sys.exit()
else:
count += 1
print(count)
|
p03000 | s478112881 | Accepted | import numpy as np
def main():
n, x = map(int, input().split())
ls = np.array(list(map(int, input().split())))
ans = 1
h = 0
for l in ls:
h += l
if h <= x:
ans += 1
else:
break
print(ans)
if __name__ == "__main__":
main()
|
p03000 | s697149538 | Accepted | n,x=map(int,input().split())
llis=list(map(int,input().split()))
counter=0
ds=0
if ds<=x:
counter+=1
for i in range(0,n):
d=ds+llis[i]
if d<=x:
counter+=1
ds=d
print(counter) |
p03000 | s749384778 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
ans = 1
d = 0
for i in l:
d += i
if d > x:
break
ans += 1
print(ans)
|
p03000 | s391676484 | 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:
cnt+=1
print(cnt) |
p03000 | s658675885 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
count=1
D=0
for i in range(N):
D=D+L[i]
if D > X:
break
else:
count=count+1
print(count) |
p03000 | s500550463 | Accepted | def main():
n,x = list(map(int,input().split()))
l = list(map(int,input().split()))
bound=0
ans=1
for i in range(0,n):
bound+=l[i]
if bound <=x:
ans+=1
print(ans)
main() |
p03000 | s865294360 | Accepted | n, x = map(int, input().split())
a = [0] + list(map(int, input().split()))
ans = 0
for i in range(n):
a[i + 1] += a[i]
for i in range(n + 1):
if a[i] <= x:
ans += 1
print(ans)
|
p03000 | s806128249 | Accepted | #!/usr/bin/env python3
n, x, *l = map(int, open(0).read().split())
a = n+1
i=sum(l)
while a > 1 and i>x:
a -= 1
i-=l[a-1]
print(a)
|
p03000 | s549814972 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
cnt = 1
d = 0
for i in range(n):
d += l[i]
if(x >= d):
cnt += 1
else:
break
print(cnt) |
p03000 | s305677574 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
D = []
D.append(0)
for i in range(0,N):
D.append(D[i]+L[i])
cnt = 0
for d in D:
if d <= X:
cnt += 1
print(cnt) |
p03000 | s279659439 | Accepted | import sys
N, X = map(int, sys.stdin.readline().split())
L = list(map(int, sys.stdin.readline().split()))
ans = 0
for i, l in enumerate(L):
ans += l
if ans > X:
print(i+1)
break
else:
print(N+1) |
p03000 | s286474746 | Accepted | def main():
n, x = map(int, input().split())
l_lst = list(map(int, input().split()))
count = 0
coordinate_lst = [0]
for i in range(n):
coordinate_lst.append(coordinate_lst[i] + l_lst[i])
for i in range(n+1):
if coordinate_lst[i] <= x:
count += 1
print(count)
... |
p03000 | s581026917 | 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 | s593485068 | Accepted | #!/usr/bin/env python3
def main():
N, X = map(int, input().split())
*L, = map(int, input().split())
D = [0]
for i in range(0, N):
D.append(D[i] + L[i])
cnt = 0
for i in range(len(D)):
if D[i] <= X:
cnt += 1
print(cnt)
main() |
p03000 | s579158749 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
sum=0
ans=1
for i in range(n) :
sum+=a[i]
if sum <= x :
ans+=1
print(ans) |
p03000 | s480814282 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 問題：https://atcoder.jp/contests/abc126/tasks/abc130_b
n, x = map(int, input().strip().split())
l = list(map(int, input().strip().split()))
d = 0
i = 0
while i < n:
d += l[i]
if d > x:
break
i += 1
print(i+1)
|
p03000 | s134812541 | Accepted | import bisect
N, X = map(int, input().split())
L = list(map(int, input().split()))
DP = [0] * (N+2)
for i in range(2, N+2):
DP[i] = DP[i-1] + L[i-2]
ans = bisect.bisect_right(DP, X)
print(ans-1)
|
p03000 | s450798854 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
D = L[:]
for i in range(N-1):
D[i+1] += D[i]
cnt = 0
for i in range(N):
if D[i] <= X:
cnt += 1
else:
break
print(cnt+1) |
p03000 | s454409616 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
ans = 1
pos = 0
for i in l:
pos += i
if pos>x:
print(ans)
break
ans += 1
else:
print(ans) |
p03000 | s407471515 | Accepted | n,x = map(int,input().split())
l = [int(s) for s in input().split()]
ans = 1
height = 0
for i in range(n):
height += l[i]
if height <= x:
ans += 1
print(ans) |
p03000 | s652841917 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
cnt = 1
d = 0
for i in range(n):
d += l[i]
if d > x:
print(cnt)
exit()
cnt += 1
print(n + 1) |
p03000 | s511965416 | Accepted | N,X = map(int, input().split())
L = list(map(int, input().split()))
p=0
c=1
for l in L:
p+=l
if p <= X:
c+=1
else:
break
print(c) |
p03000 | s308150436 | Accepted | n,x = map(int,input().split())
l = list(map(int,input().split()))
wa = 0
d = [0]*(n+3)
d[1]=0
d.pop(0)
wa = 1
for i in range(2,n+2):
d[i]=d[i-1]+l[i-2]
if(d[i]>x):
break
wa+=1
print(wa) |
p03000 | s463790333 | Accepted | N, X = map(int, input().split())
L = list(map(int, input().split()))
ans = 1
pd = 0
for l in L:
d = pd + l
pd = d
if d <= X:
ans += 1
else:
break
print(ans) |
p03000 | s018803458 | Accepted | # -*- coding: utf-8 -*-
n, x = map(int, input().split())
ll = list(map(int, input().split()))
d = 0
ans = 1
for l in ll:
d += l
if d > x:
break
ans += 1
print(ans)
|
p03000 | s195448532 | Accepted | n, x = map(int, input().split())
l=list(map(int, input().split()))
dis=0
for i in range(n):
dis += l[i]
if dis > x:
print(i+1)
exit(0)
else:
pass
print(n+1) |
p03000 | s290602977 | Accepted | N,X=map(int,input().split())
L=list(map(int,input().split()))
total=0
count=1
for i in range(N):
total+=L[i]
if total<=X:
count+=1
print(count) |
p03000 | s260689681 | Accepted | import sys
N, X = map(int, input().split())
L = list(map(int, sys.stdin.readline().rsplit()))
d = 0
res = 1
for l in L:
if d + l > X:
break
d += l
res += 1
print(res)
|
p03000 | s020190774 | Accepted | n,x = map(int,input().split())
L = list(map(int,input().split()))
D = 0
c = 0
for i in range(n):
if D <= x:
c += 1
D += L[i]
if D <= x:
print(c+1)
else:
print(c) |
p03000 | s896955921 | Accepted | LI = lambda: list(map(int, input().split()))
N, X = LI()
L = LI()
def main():
ans = 1
d = 0
for l in L:
d += l
if d > X:
break
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03000 | s930875308 | Accepted | n, x = map(int, input().split())
Ls = list(map(int, input().split()))
ans = 1
temp = 0
for l in Ls:
temp += l
if temp <= x:
ans += 1
print(ans) |
p03000 | s377452121 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
ans = 0
bound = 0
for i in l:
bound += i
ans += 1
if bound > x:
break
else:
ans = n + 1
print(ans)
|
p03000 | s318111451 | Accepted | n, x = [int(_) for _ in input().split()]
L = [int(_) for _ in input().split()]
res = 1
d = 0
for l in L:
d += l
res += (d <= x)
print(res)
|
p03000 | s900796226 | Accepted | n,x = map(int,input().split())
l_list = list(map(int,input().split()))
total = 0
ans = 0
#print(l_list)
for i in range(n):
if total <= x:
ans += 1
else:
break
total += l_list[i]
if total <=x:
ans += 1
print(ans)
|
p03000 | s259788442 | Accepted | from itertools import accumulate
from bisect import *
N, X = map(int, input().split())
L = list(tuple(map(int, input().split())))
acc = sorted(list(accumulate(L)) + [0])
n = bisect_right(acc,X)
print(n)
|
p03000 | s875763643 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
b = 0
ans = 1
for i in range(N):
b += L[i]
if b <= X:
ans += 1
else:
break
print(ans) |
p03000 | s566603146 | Accepted | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, ... |
p03000 | s209975703 | 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 | s710579879 | Accepted | n, x = map(int, input().split())
l = list(map(int, input().split()))
d = [0]*(n+1)
counter = 1
for i in range(1,n + 1):
d[i] = d[i - 1] + l[i - 1]
if d[i] <= x:
counter += 1
print(counter)
|
p03000 | s868356569 | Accepted | #import sys
#import math
#import numpy as np
'''a,b= map(int,input().split())'''
#a, b, c = [list(map(int, input().split())) for _ in range(3)]
#li0= [int(x) for x in input().split()]
n,l= map(int, input().split())
#x = [list(map(int, input().split())) for _ in range(n)]
li0= [int(x) for x in input().split()]
ans=1
co... |
p03000 | s377107715 | 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) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.