problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p03000 | u344959886 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL = [int(i) for i in input().split()] \n\na=0\nfor i in range(N+1):\n a+=i\n if a > X:\n ans=i\n break\n\nprint(i)\n ', 'N,X=map(int,input().split())\nL = [int(i) for i in input().split()] \nans=N+1\na=0\nfor i in range(N):\n a+=L[i]\n if a > X:\n ... | ['Wrong Answer', 'Accepted'] | ['s476754721', 's386080821'] | [2940.0, 2940.0] | [17.0, 17.0] | [163, 175] |
p03000 | u345483150 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nb=0\ncnt=0\nfor i in l:\n b+=i\n cnt+=1\n if b>x:\n print(cnt)\n break\nprint(n)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nb=0\ncnt=0\nfor i in l:\n b+=i\n cnt+=1\n if b>x:\n print(cnt)\n exit()\nprint(n+1)'] | ['Wrong Answer', 'Accepted'] | ['s152625864', 's930341729'] | [2940.0, 3060.0] | [18.0, 18.0] | [143, 146] |
p03000 | u347600233 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = [int(i) for i in input().split()]\nd, cnt = 0, 0\nfor li in l:\n d += li\n if d <= x:\n cnt += 1\nprint(cnt)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd, cnt = 0, 1\nfor li in l:\n d += li\n if d <= x:\n cnt += 1\nprint(cn... | ['Wrong Answer', 'Accepted'] | ['s923806119', 's847390481'] | [9132.0, 9160.0] | [27.0, 29.0] | [152, 150] |
p03000 | u350093546 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\na=list(map(int,input()split()))\nsum=0\ncount=1\nfor i in range(x):\n sum+=a[i]\n if sum<=x:\n count+=1\nprint(count)', 'n,x=map(int,input().split())\na=list(map(int,input()split()))\ncount=1\nfor i in range(n):\n if sum(a[:i+1])<=x:\n count+=1\nprint(count)\n', 'n,x=map(int,inp... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s015978046', 's115765753', 's163330540', 's528025020', 's941840261'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [144, 136, 146, 135, 146] |
p03000 | u350909808 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = input().split()\nn,x = int(n), int(x)\nL = [int(x) for x in input().split()]\n\nD = [0 for _ in range(N)]\n\nfor i in range(1, N):\n D[i] = D[i-1] + L[i-1]\n\nres = [True if D[i] <= x else False for i in range(N)]\n\nprint(sum(res))', 'n,x = input().split()\nn,x = int(n), int(x)\nL = [int(x) for x in input().s... | ['Runtime Error', 'Accepted'] | ['s461531241', 's257044367'] | [3064.0, 3064.0] | [17.0, 17.0] | [228, 240] |
p03000 | u351363308 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int,input().split())\n\nL = list(map(int,input().split()))\nx = 0\n\nfor i in range(N):\n if x > X:\n print(i)\n break\n else:\n x += L[i]\nif x-L[len(L)-1] <= X:\n print(N)\n ', 'N,X = map(int,input().split())\n\nL = list(map(int,input().split()))\nd = 0\n\nfor i in range(N... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s156349711', 's504389591', 's837293231', 's307500396'] | [2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [206, 215, 264, 184] |
p03000 | u352402050 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\nS = [0]\n\ni = 0\nwhile i <= N:\n S.append(S[i-1]+L[i])\n i += 1\n \nprint(S)\n ', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nS = [0]\nc = 0\n\ni = 0\nwhile i <= N-1:\n S.append(S[i]+L[i])\n i += 1\n \nj = 0\nwh... | ['Runtime Error', 'Accepted'] | ['s121764913', 's644259574'] | [2940.0, 3060.0] | [17.0, 17.0] | [145, 233] |
p03000 | u355137116 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nint d = 0;\nfor i in range(n):\n if d < x:\n d += l[i]\n else:\n break\n \nprint(i)\n ', 'N, X = list(map(int, input().split()))\nL = list(map(int, input().split()))\nD = 0\nans = 1\n\nfor i in range(N):\n D += L[i]\n if D <= X... | ['Runtime Error', 'Accepted'] | ['s674259262', 's747289856'] | [2940.0, 2940.0] | [17.0, 17.0] | [160, 167] |
p03000 | u356539385 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\na=[]\nfor i in range(N):\n\ta.append(list(map(int,input().split())))\nn=0\nd=0\nwhile n<=N:\n\tif d>X:\n\t\tbreak\n\telse:\n\t\td=d+a[n]\n\t\tn=n+1\n\nprint(n+1)', 'N,X=map(int,input().split())\na=[]\nfor i in range(N):\n\ta.append(map(int,input().split()))\nn=0\nd=0\nwhile n<=N:\n\tif d... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s484481243', 's586330980', 's153625945'] | [3064.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0] | [169, 163, 173] |
p03000 | u357050210 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\nl = [ int(i) for i in input().split() ]\nst = 0\ncnt = 1\nfor i range(0,n):\n st += l[i]\n if st > x:\n break\n cnt += 1\nprint(cnt)', 'n,x = map(int,input().split())\nl = [ int(i) for i in input().split() ]\nst = 0\ncnt = 1\nfor i in range(0,n):\n st += l[i]\n if st > x:\n ... | ['Runtime Error', 'Accepted'] | ['s862547181', 's553229992'] | [2940.0, 2940.0] | [17.0, 17.0] | [161, 165] |
p03000 | u358459248 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\nd = list(map(int,input().split()))\n \nbound = 0\nans = 1\n \nfor i in d:\n bound += i\n if bound >x:\n break\n ans += 1\nprint(ans)\nn,x = map(int,input().split())\nd = list(map(int,input().split()))\n\nbound = 0\nans = 1\n\nfor i in d:\n bound += i\n if boun... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s735338468', 's762719358', 's413634812'] | [3064.0, 2940.0, 2940.0] | [18.0, 18.0, 19.0] | [341, 171, 169] |
p03000 | u358791207 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = int(input().split())\n\ncount = 0\nsum = 0\n\nwhile sum <= x:\n sum += l[count]\n count+=1\nprint(count + 1)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\ncount = 0\nsum = 0\n\nwhile sum <= x:\n sum += l[count]\n count+=1\nprint(count + 1)', 'n, ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s254882618', 's428396601', 's475830238', 's763498928', 's844307682', 's845738834', 's732250321'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0] | [139, 150, 165, 138, 139, 170, 171] |
p03000 | u360613784 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 1\n\nfor i in range(N):\n if sum(L[:i - 1]) <= X:\n D += 1\n\nprint(D)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 1\n\nfor i in range(N):\n if sum(L[:i - 1]) <= X:\n D += 1\n', 'N, X = map... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s044235468', 's496852718', 's560502487', 's732000342'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [147, 138, 149, 177] |
p03000 | u361381049 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ["n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nans = 0\ncnt = 0\nif x > l[0]:\n print('1')\n exit()\nfor i in range(n):\n \n \n cnt += l[i]\n ans += 1\n if cnt > x:\n print(ans)\n exit()\n elif cnt == x:\n print(ans + 1)\n exit()\n \n #print(cnt)\n #print(ans)\nprint(n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s271023182', 's419007441', 's852018412'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [298, 170, 201] |
p03000 | u362563655 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int, input().split())\nl = list(map(int,input().split()))\ncount = 1\nd = 0\nfor i in range(1,N):\n d = d + l[i]\n if d <= x:\n count += 1\nprint(count)', 'N,X = map(int, input().split())\nl = list(map(int,input().split()))\ncount = 1\nd = 0\nfor i in range(N):\n d = d + l[i]\n if d <= X:\n count ... | ['Runtime Error', 'Accepted'] | ['s313470373', 's449104696'] | [2940.0, 2940.0] | [18.0, 17.0] | [159, 158] |
p03000 | u366398972 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\nL = list(map(int,input().split()))\nd = 0\ncnt = 0\nfor l in L:\n\td += l\n\tif(d <= x):\n\t\tcnt += 1\nprint(cnt)', 'n,x = map(int,input().split())\nL = list(map(int,input().split()))\nd = 0\ncnt = 0\nfor l in L:\n\tif(d <= x):\n\t\tcnt += 1\n\td += l\nif(d <= x):\n\t\tcnt += 1\nprint... | ['Wrong Answer', 'Accepted'] | ['s646131904', 's669704346'] | [2940.0, 3060.0] | [17.0, 19.0] | [134, 157] |
p03000 | u368016155 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = [int(_) for _ in input().split()]\n\ncount = 1\nBall = 0\nfor i in range(N):\n ball += L[i]\n if X >= ball:\n count += 1\n else:\n break\nprint(count)', 'N, X = map(int, input().split())\nL = [int(_) for _ in input().split()]\n\ncount = 1\nBall = 0\nfor i in range(N):\n ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s284630222', 's772542887', 's785245516', 's283369985'] | [2940.0, 3060.0, 2940.0, 2940.0] | [19.0, 17.0, 18.0, 17.0] | [186, 185, 186, 186] |
p03000 | u369402805 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = [int(a) for a in input().split()]\nl_list = [int(a) for a in input().split()]\nfor i, l in enumerate(l_list):\n n -= l\n if l < 0:\n print(str(i+1))\n break', 'n, x = [int(a) for a in input().split()]\nl_list = [int(a) for a in input().split()]\nfor i, l in enumerate(l_list):\n x -= l\n ... | ['Wrong Answer', 'Accepted'] | ['s889402133', 's262877674'] | [2940.0, 3064.0] | [17.0, 17.0] | [177, 203] |
p03000 | u370721525 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\ndist = 0\ncnt = 0\nfor i in range(N):\n if dist <= X:\n dist += list[i]\n cnt += 1\n else:\n break;\n \nprint(cnt)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\ndist = 0\ncnt = 1\nfor i in range(N):\n ... | ['Runtime Error', 'Accepted'] | ['s223085650', 's778261254'] | [2940.0, 2940.0] | [17.0, 18.0] | [189, 183] |
p03000 | u374802266 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['a=list(map(int,input().split()))\nL=list(map(int,input().split()))\nN=a[0]\nX=a[1]\nl=[0]\nn=0\nn1=0\nwhile True:\n l.append(L[n]+l[n])\n n=n+1\n if n==N:\n break\nprint(l)\nwhile True:\n if l[n1]<=X:\n n1+=1\n else:\n print(n1)\n break\n if n1==N:\n if X>=l[-1]:\n... | ['Wrong Answer', 'Accepted'] | ['s087708395', 's655038753'] | [3064.0, 3064.0] | [17.0, 18.0] | [404, 395] |
p03000 | u375282392 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\n\nl = list(map(int,input().split()))\n\nk = []\ns = []\nfor i in range(n):\n k[i] += l[i]\n s[i] = k[i]\n\nc = 0\nfor i in s:\n if i <= x:\n c += 1\n\nprint(c)', 'n,x = map(int,input().split())\n\nl = list(map(int,input().split()))\n\nk = 0\ns = []\nfor i in range(n):\n k += l[i... | ['Runtime Error', 'Accepted'] | ['s891110991', 's583930296'] | [3060.0, 3060.0] | [17.0, 18.0] | [182, 180] |
p03000 | u379959788 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# -*-coding: utf-8 -*-\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 0\nfor i in range(1, N+1):\n D += L[i-1]\n print(i+1, D)\n if D > X:\n ans = i\n break\n if i == N - 1:\n ans = i+1\n\nprint(ans)', '# -*-coding: utf-8 -*-\nN, X = map(int, input().split... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s299569666', 's313713965', 's299737127'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [248, 199, 246] |
p03000 | u381713448 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int,input().split())\nL = list(map(int,input().split()))\nNOW = 0\nc = 1\nfor i in L:\n if NOW > X:\n break\n NOW += i\n c += 1\nprint(c)', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\nNOW = 0\nc = 1\n\nfor i in L:\n if NOW + i <= X:\n NOW += i\n c += 1\n else:\n bre... | ['Wrong Answer', 'Accepted'] | ['s301915644', 's704352075'] | [2940.0, 2940.0] | [17.0, 17.0] | [144, 162] |
p03000 | u385825353 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ["n,k=map(int, input().split(' '))\na=list(map(int, input().split(' ')))\nans,s=0,0\nfor i in a:\n if(s<=k) ans+=1\n else break\n s+=i\nprint(ans)\n", "n,k=map(int, input().split(' '))\na=list(map(int, input().split(' ')))\nans,s=0,0\nfor i in a:\n if s<=k: ans+=1\n else break\n s+=i\nprint(ans)", "n,k=map(int, i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s185564339', 's686962609', 's664828239'] | [2940.0, 2940.0, 3060.0] | [17.0, 16.0, 17.0] | [141, 140, 158] |
p03000 | u391442102 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int, input().split())\nL = list(map(int, input().split()))\n\nl = []\ncnt = 0\nl.append(int(0))\nfor i in range(N):\n l.append(l[i]+L[i])\n if l[i] <= X:\n cnt += 1\nif l[-1] <= X:\n cnt += 1\nprint(l)\nprint(cnt)\n \n', 'N,X = map(int, input().split())\nL = list(map(int, input().split()))\n\nl = []\... | ['Wrong Answer', 'Accepted'] | ['s151121725', 's286108497'] | [9060.0, 9112.0] | [29.0, 33.0] | [220, 211] |
p03000 | u393253137 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nL=list(map(int,input().split()))\nans=0\nd=0\nfor i in range(n):\n d += L[i]\n if d>x:break\n ans += 1\nprint(ans)', 'n,x=map(int,input().split())\nL=list(map(int,input().split()))\nans=1\nd=0\nfor i in range(n):\n d += L[i]\n if d>x:break\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s740468110', 's523231857'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 145] |
p03000 | u396391104 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans,d=0,0\n\nfor i in l:\n d+=i\n if d<=x:\n ans+=1\n else:\n break\nprint(ans)\n', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans,d=1,0\n\nfor i in l:\n d+=i\n if d<=x:\n ans+=1\n else:\n break\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s463340676', 's392405056'] | [2940.0, 2940.0] | [17.0, 17.0] | [143, 143] |
p03000 | u402467563 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split())\ndi = 0\nfor i in range(N):\n if di < X:\n di += L[i]\n else:\n print(i)\n break', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\ncount=1\ntmp=0\nfor i in range(N):\n tmp+=L[i]\n if tmp<=X:\n count+=1\nprint(count)'... | ['Runtime Error', 'Accepted'] | ['s534238832', 's881566070'] | [3064.0, 2940.0] | [17.0, 17.0] | [152, 145] |
p03000 | u402891920 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = [int(x) for x in input().split()]\nL = [int(x) for x in input().split()]\n\ncount = 1\nd = [0] * (N+1)\nfor i in range(1, N+1):\n d[i] = d[i-1] + L[i-1]\n if d[i] <= X:count += 1\n\nprint(d)\nprint(count) ', 'N, X = [int(x) for x in input().split()]\nL = [int(x) for x in input().split()]\n\ncount = 1\nd ... | ['Wrong Answer', 'Accepted'] | ['s981152554', 's256453512'] | [3064.0, 3064.0] | [17.0, 19.0] | [208, 199] |
p03000 | u403331159 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\ncnt=0\nd=[0 for _ in range(n+1)]\nd[0]=0\nfor i in range(1,n+1):\n d[i]=d[i-1]+l[i-1]\n if d[i]<=x:\n cnt+=1\nprint(cnt)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\ncnt=1\nd=[0 for _ in range(n+1)]\nd[0]=0\nfor i in ra... | ['Wrong Answer', 'Accepted'] | ['s693549079', 's159627388'] | [3064.0, 3064.0] | [17.0, 17.0] | [188, 188] |
p03000 | u404057606 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\ni=0\np=0\nwhile p<=x or i<n:\n p=p+l[i]\n i+=1\nprint(i)', 'n,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\ni=0\np=0\nwhile i<n:\n p=p+l[i]\n if p>x:\n break\n i+=1\nprint(i+1)'] | ['Runtime Error', 'Accepted'] | ['s381172260', 's163270244'] | [3316.0, 3316.0] | [19.0, 19.0] | [125, 145] |
p03000 | u404678206 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nL=list(map(int,input().split()))\n#print(L)\nD=0\nB=[0]\nC=[]\nfor i in range(len(L)):\n D=D+L[i]\n B.append(D)\nprint(B)\nfor i in range(len(L)):\n if B[i]<=x:\n C.append(i)\n else:\n pass\nprint(C)\nprint(min(n+1,len(C)))', 'n,x=map(int,input().split())\nl_list=list(map(int,i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s218813315', 's448953103', 's162857667'] | [3064.0, 3060.0, 2940.0] | [17.0, 64.0, 17.0] | [247, 151, 153] |
p03000 | u408375121 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\nd = 0\nfor i in range(N):\n d += L[i]\n if X < d:\n print(i + 1)\n break\n else:\n print(N + 1)\n', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nd = 0\ncount = 0\nfor i in range(N):\n d += L[i]\n if X < d:\... | ['Wrong Answer', 'Accepted'] | ['s547326231', 's599475542'] | [2940.0, 2940.0] | [17.0, 17.0] | [170, 212] |
p03000 | u411544692 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nx = 0\ncnt = 0\n\nfor length in L:\n cnt += 1\n x += length\n print(cnt, x)\n if x > X:\n break\n\nprint(cnt)\n', '\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\n\n\n\ncnt = 0\nx = 0\nfor length in L:... | ['Wrong Answer', 'Accepted'] | ['s631284186', 's848890324'] | [3060.0, 3064.0] | [17.0, 18.0] | [189, 255] |
p03000 | u412563426 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\ntemp = 0\nfor i in range(n):\n temp += l[i]\n if temp > x:\n print(i+1)\n break\nprint(n+1)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\ntemp = 0\nfor i in range(n):\n temp += l[i]\n if te... | ['Wrong Answer', 'Accepted'] | ['s030897921', 's827465560'] | [2940.0, 3064.0] | [17.0, 20.0] | [175, 190] |
p03000 | u419951680 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL=[int(x)for x in input().split()]\n\ncount=1\nD=1\nfor i in range(0,N+1):\n if(D>X):\n break\n else:\n D=D+L[i]\n count+=1\n\nprint(count)', 'N,X=map(int,input().split())\nL=[int(x)for x in input().split()]\n\ncount=1\nD=0\nfor i in range(0,N):\n if(D>X):\n... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s218985722', 's401433661', 's859782665', 's329935830'] | [3060.0, 2940.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [184, 187, 182, 231] |
p03000 | u424240341 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=list(map(int, input().split(" ")))\nL=list(map(int, input().split(" ")))\nn=0\nsum=0\nfor l in L:\n sum+=l\n n+=1\n if sum>x:\n break\nn-=1\nprint(n)', 'n,x=list(map(int, input().split(" ")))\nL=list(map(int, input().split(" ")))\nm=0\nsum=0\nfor l in L:\n sum+=l\n m+=1\n if sum>x:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s141114382', 's964808736', 's224282614'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [159, 167, 167] |
p03000 | u425834921 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,\u3000M = input().strip().split()\nN,\u3000M = [int(N),int(M)]\n\narray = list(map(int, input().strip().split()))\n\nsum = []\n\nsum.append(array(0))\n\ni = 1\n\nwhile i < len(array):\n\tsum[i] = sum[i-1] + a[i]\n \nj = 0\n\ncount = 0\n\nwhile sum[j] <= M:\n \tcount =+ 1\n j =+ 1\n \nprint(count)\n \t', 'i... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s166172609', 's211375688', 's265599261', 's418485227', 's422946542', 's464267022', 's505872472', 's685902007', 's016276884'] | [2940.0, 3064.0, 3060.0, 3060.0, 3188.0, 3060.0, 3064.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0, 19.0, 18.0, 18.0, 17.0, 17.0, 17.0] | [281, 248, 214, 147, 254, 215, 260, 223, 206] |
p03000 | u426649993 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, str(input()).split())\nL = list(map(int, input().split()))\n\ncount = 1\nlength = 0\nfor i in range(N):\n if length > X:\n print(count)\n exit()\n length += L[i]\n count += 1\n\nprint(count)\n', 'N, X = map(int, str(input()).split())\nL = list(map(int, input().split()))\n\ncount... | ['Wrong Answer', 'Accepted'] | ['s317531300', 's024993682'] | [2940.0, 2940.0] | [17.0, 18.0] | [218, 218] |
p03000 | u428397309 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# -*- coding: utf-8 -*-\n\nn, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nh = 0 # place\n\nfor i in range(n):\n h += l[i]\n\n if h > x:\n print(i+1)\n break\n\nprint(i+2)\n', '# -*- coding: utf-8 -*-\n\nn, x = map(int, input().split())\nl = list(map(int, input().split())... | ['Wrong Answer', 'Accepted'] | ['s905453632', 's388589294'] | [2940.0, 3064.0] | [17.0, 17.0] | [204, 207] |
p03000 | u428747123 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nans = 1\nsum = 0\n\nfor i in range(N):\n sum += L[i]\n if sum <= X:\n num += 1\n else:\n break\n\nprint(ans)\n\n', '# -*- Coding: utf-8 -*-\nN, X = map(int, input().split())\nL = list(map(int,input().split()))\n\nindex = 0... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s474208196', 's668435658', 's489090522'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [193, 179, 246] |
p03000 | u429368318 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nnums = [int(i) for i in input().split()]\n\npos, jumps, count = 0, 0, 0\nwhile pos <= x and jumps < n:\n pos += nums[jumps]\n jumps += 1\n print(pos)\n\nprint(jumps)', 'n, x = map(int, input().split())\nnums = [int(i) for i in input().split()]\n\npos, jumps, count = 0, 0, 1\... | ['Wrong Answer', 'Accepted'] | ['s347440707', 's457910086'] | [3060.0, 3060.0] | [17.0, 18.0] | [199, 211] |
p03000 | u430726059 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int, input().split())\nl=list(map(int,input().split()))\ncnt=0\nzahyou=0\nfor i in range(n):\n while zahyou<=x:\n cnt+=1\n zahyou+=l[i]\nprint(cnt)', 'n,x=map(int, input().split())\nl=list(map(int, input().split()))\ncnt=0\nfor i in range(n):\n if cnt+l[i]<=x:\n cnt+=1\n cnt+=l[i]\n else:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s902576374', 's979593589', 's071951872'] | [9164.0, 9080.0, 9120.0] | [30.0, 23.0, 28.0] | [154, 160, 166] |
p03000 | u434872492 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int,input().split())\nL = list(map(int,input().split()))\nD = [0] * (N+1)\ncount = 0\nD[0] = 0\nfor i in range(1,N+1):\n D[i] = D[i-1] + L[i-1]\n if D[i] <= X:\n count += 1\nprint(count)\n', 'N, X = map(int,input().split())\nL = list(map(int,input().split()))\nD = [0] * (N+1)\ncount = 1\nD[0] ... | ['Wrong Answer', 'Accepted'] | ['s610000665', 's493445395'] | [3060.0, 3064.0] | [17.0, 17.0] | [202, 201] |
p03000 | u437215432 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# ABC130B\n\nn, x = map(int, input().split())\nl = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n s += l[i]\n if s > x:\n return i+1\nreturn n+1\n', '# ABC130B\n\nn, x = map(int, input().split())\nl = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n s += l[i]\n if s > x:\n... | ['Runtime Error', 'Accepted'] | ['s252744184', 's298764788'] | [2940.0, 2940.0] | [17.0, 18.0] | [163, 188] |
p03000 | u437727817 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\nl = list(map(int,input().split()))\nd = 0\ncnt = 1\nfor i in range(n):\n\td += l[i]\n\tcnt += 1\n\tif x < d:\n\t\tprint(cnt)\n#print(cnt)\n\n\n', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nd = 0\ncnt = 0\nfor i in range(n+1):\n\tif x < d:\n\t\tprint(cnt)\n\tif... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s059319024', 's519564409', 's886775142', 's253516459'] | [2940.0, 3060.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0, 17.0] | [158, 170, 172, 188] |
p03000 | u439392790 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=0\nd=[0]*n\nfor i in range (1,n):\n d[i]=d[i-1]+l[i-1]\n if d[i]<=x:\n ans=ans+1\n else:\n break\nprint(ans)\n', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=1\nd=[0]*n\nfor i in range (2,n+1):\n d[i]... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s027399891', 's707916985', 's112885953'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0] | [190, 192, 148] |
p03000 | u441320782 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL=list(map(int,input().split()))\nD=0\ncount = 0\nfor i in range(N):\n D += L[i]\n count += 1\n if D>X:break', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nD=0\ncount = 1\nfor i in L:\n D += i\n if D>X:break\n count += 1\n \n \nprint(count) '] | ['Wrong Answer', 'Accepted'] | ['s756329996', 's502898537'] | [2940.0, 2940.0] | [17.0, 17.0] | [134, 145] |
p03000 | u442877951 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['d = 0\nd <= 1000\ni = 1', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\ndistance = 0\nbounds = 1\nfor i in range(n): \n distance += l[i]\n if distance <= x:\n bounds += 1\n else:\n break\nprint(bounds)'] | ['Wrong Answer', 'Accepted'] | ['s668755434', 's600628016'] | [2940.0, 3060.0] | [17.0, 17.0] | [21, 209] |
p03000 | u444810750 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['factor_1, factor_2 = list(map(int, input().split()))\n\nL = [s for s in input().split()]\n\nD_pre = 0\ncount = 0\n\nif(D_pre <= factor_2):\n\tcount += 1\n\n\nfor i in range(len(L)):\n\tD_pre = D_pre + int(L.pop(0))\n\t\n\tprint(D_pre)\n\t\n\tif(D_pre <= factor_2):\n\t\tcount += 1\n\nprint(count)', 'factor_1, factor_2... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s149930890', 's361811359', 's370904810', 's721895763'] | [3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [269, 270, 264, 254] |
p03000 | u446841069 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['count=0\nd=0\ni=0\nwhile d<=x:\n if i==0:\n d=0\n if d<=x:\n count=1\n i+=1\n elif count<=n+1:\n d=d+int(a[i-1])\n if d<=x:\n count+=1\n i+=1\n else:\n break;\nprint(count)', 'n,x=map(int,input().split())\na=list(input().split())\ncou... | ['Runtime Error', 'Accepted'] | ['s771869597', 's479798492'] | [3060.0, 3316.0] | [18.0, 21.0] | [240, 318] |
p03000 | u448655578 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, limit = map(int, input().split())\nbounce = int(input().split())\nb = [0]\ncount = 0\nfor i in range(len(bounce)):\n b.append(b[i]+bounce[i])\n \nfor j in range(len(b)):\n if b[j] <= limit:\n count += 1\nprint(count)\n', 'N, limit = map(int, input().split())\nbounce = input().split()\nb = [0]\ncount = 0\nfor... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s223034445', 's247299605', 's914465016', 's947070177', 's355008655'] | [3060.0, 3060.0, 3064.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [216, 203, 207, 211, 216] |
p03000 | u453623947 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nc = 1\nd = 0\nfor x in L:\n d = d + x\n if d <= X :\n ans += 1\n\nprint(ans)', 'n, x = map(int, input().split())\nL = list(map(int, input().split()))\n\nans = 1\nsum_L = 0\nfor j in range(n):\n sum_L += sum_L + L[j]\n if sum_L... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s527790951', 's908166667', 's855004668'] | [2940.0, 2940.0, 3064.0] | [17.0, 18.0, 17.0] | [152, 216, 154] |
p03000 | u457289860 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\narr = list(map(int,input().split()))\nchk = 0\n\nfor i in range(len(arr)-1):\n if i == 0:\n chk = 0\n else:\n chk = chk + arr[i]\n\n if chk <= x:\n count =+ 1\n else:\n print(count)\n exit()\n\n print(count)\n', 'n,x = map(int,input().spli... | ['Runtime Error', 'Accepted'] | ['s343054819', 's714320810'] | [2940.0, 3060.0] | [17.0, 17.0] | [271, 224] |
p03000 | u463602788 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['y = [int(z) for z in input().split()]\nl = [int(z) for z in input().split()]\nd = [0]*(y[0]+1)\nc = 0\nfor i in range(1,y[0]+1):\n d[i] = d[i-1]+l[i-1]\n if (d[i]<=y[1]):\n c+=1\nprint(c)\n', 'y = [int(z) for z in input().split()]\nl = [int(z) for z in input().split()]\nd = [0]*(y[0]+1)\nc = 1\nf... | ['Wrong Answer', 'Accepted'] | ['s242749650', 's958595934'] | [9128.0, 9096.0] | [31.0, 30.0] | [201, 201] |
p03000 | u463950771 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int, input().split())\nL = list(map(int, input().split()))\nD = L[0]\ni = 2\nwhile D <= X and i <= N:\n #print("D, X", D, X)\n D += L[i-1]\n i += 1\n\nprint(i)', 'N,X = map(int, input().split())\nL = list(map(int, input().split()))\nD = [0 for _ in range(N+1)]\nans = 0\nfor i in range(1, N+1):\n ... | ['Wrong Answer', 'Accepted'] | ['s670186339', 's015503023'] | [2940.0, 3064.0] | [17.0, 17.0] | [169, 224] |
p03000 | u466331465 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = list(map(int,input().split()))\nL = list(map(int,input().split()))\nD = [0]*(N+1)\ncnt = 0\nfor i in range(N):\n D[i+1] += D[i] + L[i]\n cnt += 1 if D[i+1]<=X else 0\nprint(cnt)', 'N,X = list(map(int,input().split()))\nL = list(map(int,input().split()))\nD = [0]*(N+1)\ncnt = 0\nfor i in range(N):\n D[i+1] +=... | ['Wrong Answer', 'Accepted'] | ['s410214239', 's633272244'] | [3060.0, 3060.0] | [17.0, 18.0] | [178, 180] |
p03000 | u468972478 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\na = list(map(int, input().split()))\ns = 0\nt = 0\nfor i in range(n):\n s = s + a[i]\n if s <= x:\n t += 1\nprint(t)', 'n, x = map(int, input().split())\na = list(map(int, input().split()))\ns = 0\nt = 1\nfor i in range(n):\n s = s + a[i]\n if s <= x:\n t += 1\nprint(t)'] | ['Wrong Answer', 'Accepted'] | ['s941304126', 's605516973'] | [9168.0, 9116.0] | [30.0, 26.0] | [147, 147] |
p03000 | u470443688 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\n\nli = list(map(int,input().split()))\n\nzahyo = 0\ni = 0\nwhile(zahyo <= x):\n \n zahyo = zahyo + li[i]\n print(zahyo)\n \n if zahyo <= x:\n i = i+1\n if i == n:\n break\n\nprint(i+1)', 'n,x = map(int,input().split())\n\nli = list(map(int,input().split(... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s751181964', 's858969180', 's464050117'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0] | [232, 203, 215] |
p03000 | u471684875 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\n\nd=[0]\nans=0\nfor i in range(n):\n d.append(d[i-1]+l[i-1])\n if d[i]<=x:\n ans+=1\n else:\n ans+=0\n\nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\n\nd=[0]\nans=1\nfor i in range(1,n+1):\n d.app... | ['Wrong Answer', 'Accepted'] | ['s223300469', 's733514410'] | [3060.0, 3060.0] | [19.0, 18.0] | [189, 193] |
p03000 | u475675023 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\ni=0\nwhile(True):\n d+=l[i-1]\n i+=1\n if(!(d<x or i<=n)):\n break\nprint(i)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\ni=0\nwhile(True):\n d+=l[i]\n i+=1\n if(!(d<x or i<=n)):\n break\nprint(i)', 'n,x=map(in... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s358663436', 's925330064', 's120618142'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [142, 140, 129] |
p03000 | u475972508 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['x1 = list(map(int,input().rstrip().split(" ")))\nx2 = list(map(int,input().rstrip().split(" ")))\n\ndef makey(x1,x2):\n total = 0\n for i in range(x1[0]):\n total += x2[i]\n if total > x1[1]:\n return i+1\n return i\ny = makey(x1,x2)\nprint(y)\n', 'x1 = list(map(int,input().rstrip().split(" ")))\nx2 =... | ['Wrong Answer', 'Accepted'] | ['s547161931', 's514830466'] | [3060.0, 3060.0] | [18.0, 17.0] | [249, 249] |
p03000 | u477901663 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=(int(x) for x in input().split())\nlist = input().split()\nlist = [int(s) for s in list]\nlist.insert(0,0)\nz = 0\ncount = 0\n\nfor i in range(n+1):\n if z > x:\n break\n else:\n count = count + 1\n z = z + list[i]\n \nprint(count)\n', 'n,x=(int(x) for x in input().split())\nlist... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s494492150', 's638207931', 's627004782'] | [3060.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [256, 256, 245] |
p03000 | u483005329 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nt=0\nc=0\ne=0\nfor i in range(n):\n t+=l[i]\n c+=1\n if t>x:\n e=c\nprint(e if e!=0 else len(l))', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nt=0\nc=1\nfor i in range(n):\n t+=l[i]\n if t>x:\n break\n c+=1\npri... | ['Wrong Answer', 'Accepted'] | ['s709119732', 's800546061'] | [3060.0, 2940.0] | [17.0, 18.0] | [156, 144] |
p03000 | u486251525 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nsumL = 0\ncount = 0\n\nfor x in range(len(L) + 1):\n if sumL <= X:\n count += 1\n sumL += x\nprint(count)\n', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nsumL = 0\ncount = 0\n\nfor x in range(len(L) + 1... | ['Wrong Answer', 'Accepted'] | ['s102505668', 's162907832'] | [2940.0, 3064.0] | [17.0, 17.0] | [182, 209] |
p03000 | u487044104 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ["N,X = list(map(int,input().split(' ')))\nL = list(map(int,input().split(' ')))[:N]\n\ncount = 1\ni = 0\nd = 0\n\nwhile d <= X and count < N:\n d += L[i]\n i += 1\n count += 1\n\nprint(count)\n", "N,X = list(map(int,input().split(' ')))\nL = list(map(int,input().split(' ')))[:N]\n\ncount = 0\nd = 0\n\nfor l ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s346266212', 's346886621', 's940022132', 's924364549'] | [3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 18.0] | [189, 192, 177, 168] |
p03000 | u489762173 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['import sys\n\nN, X = map(int, (input().split()))\nL = list(map(int, input().split()))\npoint = 0\ncount = 1\n\nfor x in range(0, N):\n point+=L[x]\n if(point<=X):\n count+=1\n if(point>=X):\n print(count)\n sys.exit', 'import sys\n \nN, X = map(int, (input().split()))\nL = list(map(int, ... | ['Wrong Answer', 'Accepted'] | ['s585830821', 's573488591'] | [3060.0, 3064.0] | [17.0, 17.0] | [232, 251] |
p03000 | u492929439 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int,input().split())\n\nL = input().split()\npos = 0\nans = 1\nfor i in range(N):\n print(i)\n pos += int(L[i])\n if(pos <= X):\n ans +=1\n else:\n break\n \nprint(ans)\n', 'N, X = map(int,input().split())\n\nL = input().split()\ncnt = 1\npos = 0\nfor i in range(N):\n if(pos < X):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s021481066', 's219320307', 's852017557'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [178, 214, 167] |
p03000 | u493266819 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL=list(map(int,input().split()))\nI=0\nA=1\nfor i in L:\n I+=i\n if I<=X:\n A+=I\nprint(A)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nI=0\nA=1\nfor i in L:\n I+=i\n if I<=X:\n A+=1\nprint(A)'] | ['Wrong Answer', 'Accepted'] | ['s562755947', 's287081026'] | [3064.0, 2940.0] | [17.0, 17.0] | [125, 125] |
p03000 | u493555013 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int,input().split())\nL = list(map(int,input().split()))\n\nnow = 0\na = 0\nfor i in range(N):\n if now <= X:\n now += L[i]\n a += 1\n else:\n break\n\nif now <= X:\n a += 1\n', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\n\nnow = 0\na = 0\nfor i in rang... | ['Wrong Answer', 'Accepted'] | ['s943546266', 's022497990'] | [2940.0, 3060.0] | [17.0, 17.0] | [201, 210] |
p03000 | u494514222 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int, input().split())\nl = [int(x) for x in input().split()]\n\nans = 0\nd = 0\nd_ = 0\nfor i in range(1, n+1):\n if i == 1:\n ans += 1\n continue\n else:\n d = d_ + l[i-1]\n\n d_ = d\n ans += 1\n\n if d > x:\n break\n\nprint(ans)', 'n,x = map(int, input().split())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s017701004', 's557525571', 's720806538', 's832232323', 's894700597', 's488851450'] | [3064.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [264, 213, 234, 227, 257, 192] |
p03000 | u496942486 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\nl = list(map(int,input().split()))\nhplace = 0\n\nfor i in range(n):\n if i != 0:\n if hplace >= x :\n break\n hplace += l[i-1]\n\nprint(str(i+1))\n', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nhplace = 0\n\nfor i in range(n):\n if i... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s143661205', 's467744849', 's553162984', 's770953483'] | [2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [193, 192, 198, 203] |
p03000 | u499319987 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nsteps = list(int,input().split())\n \nx = 0\ncount = 1\n\nfor i in steps:\n x += i\n if x <= X:\n count += 1\n \nprint(count)', 'N, X = map(int, input().split())\nsteps = list(map(int,input().split()))\n \nx = 0\ncount = 1\n\nfor i in steps:\n x += i\n if x <= X:\n... | ['Runtime Error', 'Accepted'] | ['s527951223', 's491990869'] | [2940.0, 3060.0] | [17.0, 17.0] | [161, 166] |
p03000 | u502731482 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\n\ncnt = 0\nsum = 0\nfor i in range(N):\n sum += L[i]\n if sum > X:\n cnt = i + 1\n break\n elif sum == X:\n cnt = i + 2\n break\n\nprint("sum:{0} cnt:{1}".format(sum, cnt))', '\nN, X = map(int, input().split(... | ['Wrong Answer', 'Accepted'] | ['s700494493', 's136275029'] | [3060.0, 3060.0] | [17.0, 17.0] | [267, 225] |
p03000 | u504988979 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x= input().split()\nb_list= list(map(int, input().split()))\ntemp = 0\ncounter = 0\nfor i in range(n):\n if (temp<=int(x)):\n counter +=1\n temp += b_list[i]\n\nprint(counter)', 'n,x= input().split()\nb_list= list(map(int, input().split()))\ntemp = 0\ncounter = 0\nfor i in range(int(n)):\n temp += b... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s225112090', 's242882731', 's437378958', 's048261631'] | [2940.0, 2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0, 17.0] | [181, 212, 172, 210] |
p03000 | u508426820 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['import sys\nN, X = map(int,input().split())\nx = 0\nL.append(list(map(int,input().split())))\ncount = 1\nfor i in range(N):\n if x + L[i] <= X:\n count = count + 1\n x = x + L[i]\n else:\n print(count)\n sys.exit()\nprint(count)\n', 'import sys\nN, X = map(int,input().split())\nx = 0... | ['Runtime Error', 'Accepted'] | ['s032393180', 's123783295'] | [3060.0, 3060.0] | [17.0, 17.0] | [251, 245] |
p03000 | u509688703 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nD = 0\nnum = 1\n\nwhile num <= N+1:\n if D >= X:\n print(num)\n break\n D = D + L[num-1]\n num += 1\nelse:\n print(N)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nD = 0\nnum = 1\n\nwhile num <= N:\n D = ... | ['Runtime Error', 'Accepted'] | ['s610805646', 's589194568'] | [9184.0, 9180.0] | [36.0, 29.0] | [187, 186] |
p03000 | u509830642 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['import sys\ninput = sys.stdin.readline\ndef print_ans(N, X, lr):\n """Test Case\n >>> print_ans(3, 6, [3, 4, 5])\n 2\n >>> print_ans(4, 9, [3, 3, 3, 3])\n 4\n """\n counter = 1\n ans_sum = 0\n for l in lr:\n if ans_sum > X:\n break\n counter += 1\n ans_sum +=... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s021599339', 's521964321', 's687849200', 's652464411'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [476, 493, 475, 493] |
p03000 | u514118270 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['import itertools\nN,X = list(map(int,input().split()))\nL = list(map(int,input().split()))\nL = list(itertools.accumulate(L))\ncnt = 0\nfor l in L:\n if X < L:\n print(cnt)\n exit()\n cnt += 1\nprint(cnt)', 'import itertools\nN,X = list(map(int,input().split()))\nL = list(map(int,input().split()))... | ['Runtime Error', 'Accepted'] | ['s661151747', 's745357983'] | [3060.0, 3060.0] | [17.0, 18.0] | [214, 218] |
p03000 | u518042385 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nnow=0\nans=1\nfor i in range(n):\n now+=l[i]\n ans+=1\n if now>x:\n print(ans)\n exit()\nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nnow=0\nans=1\nfor i in range(n):\n now+=l[i]\n if now>x:\n print(ans)\n ... | ['Wrong Answer', 'Accepted'] | ['s255834846', 's374382274'] | [3060.0, 2940.0] | [19.0, 17.0] | [162, 163] |
p03000 | u521323621 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nd=[0]\nfor i in range(1, n+1):\n d.append(d[-1]+l[i-1])\n \nprint(d)\n \nprint(len([i for i in d if i <= x]))', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nd=[0]\nfor i in range(1, n+1):\n d.append(d[-1]+l[i-1])... | ['Wrong Answer', 'Accepted'] | ['s929569285', 's309287401'] | [3060.0, 3060.0] | [17.0, 17.0] | [176, 162] |
p03000 | u527379148 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nzahyo = 0\ncount = 1\n\nfor i in range(1, n+1):\n print(i)\n zahyo = zahyo + l[i-1]\n if zahyo <= x:\n count += 1\nprint(count)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\nzahyo = 0\ncount = 1\n\nf... | ['Wrong Answer', 'Accepted'] | ['s674497194', 's099672482'] | [3060.0, 3060.0] | [17.0, 17.0] | [205, 192] |
p03000 | u527993431 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL=list(map(int,input().split()))\ntmp=0\nans=0\nfor i in range(N):\n\tif tmp>X:\n\t\tprint(ans)\n\t\tbreak\n\telse:\n\t\ttmp+=L[i]\n\t\tans+=1\nprint(ans)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\ntmp=0\nans=1\nfor i in range(N):\n\ttmp+=L[i]\n\tif tmp>X:\n\t\tpr... | ['Wrong Answer', 'Accepted'] | ['s415617950', 's882434854'] | [3060.0, 3060.0] | [18.0, 18.0] | [163, 163] |
p03000 | u530383736 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# -*- coding: utf-8 -*-\n\nN,X = list(map(int, input().rstrip().split()))\nL_list = list(map(int, input().rstrip().split()))\n#-----\n\nD=0\nans = len(L_list) + 1\n\nfor i in range(N):\n D = D + L_list[i]\n if D > X:\n ans = i+1\n\nprint(ans)\n', '# -*- coding: utf-8 -*-\n\nN,X = list(map(int, input().rs... | ['Wrong Answer', 'Accepted'] | ['s759895687', 's858735989'] | [2940.0, 2940.0] | [17.0, 17.0] | [242, 253] |
p03000 | u533885955 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['\nN,X = map(int,input().split())\nL = list(map(int,input().split()))\nland = [0]\nfor i in range(N):\n land.append(land[-1]+L[i])\nland.sort()\ncount = 0\nfor l in land:\n if land <= X:\n count+=1\n \nprint(count)', '\nN,X = map(int,input().split())\nL = list(map(int,input().split()))\nland = [0]\... | ['Runtime Error', 'Accepted'] | ['s585230786', 's982679967'] | [3060.0, 3060.0] | [18.0, 18.0] | [229, 226] |
p03000 | u537782349 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['a, b = map(int, input().split())\nd = 0\ne = 0\nfor i in list(map(int, input().split())):\n if d > b:\n break\n else:\n e += i\n d += i\nprint(e)\n', 'a, b = map(int, input().split())\nc = list(map(int, input().split()))\nd = 1\ne = 0\nfor i in c:\n e += i\n if e <= b:\n d += 1\n ... | ['Wrong Answer', 'Accepted'] | ['s598132890', 's263544106'] | [2940.0, 2940.0] | [17.0, 17.0] | [160, 167] |
p03000 | u537892680 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# B - Bounding\n\nN, X = map(int, input().split())\nL = [int(l) for l in input().split()]\nD = 0\ncnt = 0\nfor i in range(N + 1):\n if D <= X:\n cnt += 1\n D = D + L[i]\n\nprint(cnt)\n', '# B - Bounding\n\nN, X = map(int, input().split())\nL = [int(l) for l in input().split()]\nD = 0\ncnt = 1\nfor i in r... | ['Runtime Error', 'Accepted'] | ['s512954205', 's693433833'] | [2940.0, 2940.0] | [17.0, 17.0] | [185, 181] |
p03000 | u542267798 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int,input().split())\nL = [int(i) for i in input().split()]\nD = 0\ncount = 1\nfor n in L:\n D += n\n count += 1\n if D > X or count > N + 1:\n break\nprint(count)', 'N,X = map(int,input().split())\nL = [int(i) for i in input().split()]\nD = 0\ncount = 1\nfor n in L:\n if D > X or count >... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s269308023', 's474210940', 's636449450'] | [2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0] | [180, 180, 180] |
p03000 | u544165468 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int, input().split())\nl = list(map(int, input().split()))\n\nns=0\nans = 1\n\nfor i in range(n):\n ns += l[i]\n if ns <= x:\n ans++\n else:\n break\nprint(ans) ', 'n,x = map(int, input().split())\nl = list(map(int, input().split()))\n\nns=0\nans = 1\n\nfor i in range(n):\n\tns += l[i]\n\tif ns <=... | ['Runtime Error', 'Accepted'] | ['s461044651', 's415997213'] | [2940.0, 2940.0] | [17.0, 17.0] | [169, 166] |
p03000 | u546686251 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\ncount = 0\nlocation = 0\nfor i in range(N):\n if location + L[i] <= X:\n count += 1\n location += L[i]\n else:\n break\nprint(count)\n', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\ncount = 0\n... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s268245191', 's513843373', 's889724622', 's465693837'] | [3064.0, 2940.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [221, 221, 224, 221] |
p03000 | u547608423 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL=list(map(int,input().split()))\n\n\nif L[0]>X:\n print(1)\nelse:\n D=0\n i=0\n count=1\n while D<=X and i<=N-1:\n print(D)\n if D+L[i]<=X:\n D+=L[i]\n i+=1\n count+=1\n else:\n break\n print(count)\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s457105845', 's917759688', 's921932654', 's957571029', 's823227967'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [299, 217, 169, 172, 185] |
p03000 | u549494450 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['a = input().split(" ")\nl = input().split(" ")\nx = int(a[1])\ny = 0\nnum = 1\nfor i in l:\n y += i\n if y <= x:\n num += 1\n else:\n break\nprint(num)', 'a = input().split(" ")\nl = input().split(" ")\nx = int(a[1])\ny = 0\nnum = 1\nfor i in l:\n y += int(i)\n if y <= x:\n num += ... | ['Runtime Error', 'Accepted'] | ['s930199563', 's163859162'] | [3060.0, 3060.0] | [17.0, 17.0] | [163, 168] |
p03000 | u550574002 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['x=int(input().split()[1])\nl=[int(x) for x in input().split()]\ns=[1 for i in [0]*len(l) if sum(l[:i])<=x]\nprint(sum(s))', 'n,x=map(int,input().split())\nl=[int(x) for x in input().split()]\nprint(sum([sum(l[:i])<=x for i in range(n+1)]))'] | ['Wrong Answer', 'Accepted'] | ['s147522517', 's255718062'] | [3060.0, 2940.0] | [17.0, 17.0] | [118, 112] |
p03000 | u550943777 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = list(map(int,input().split()))\ncnt = 0\nif sum(l) <= x:\n print(n+1)\n exit()\nfor i in range(n):\n if cnt > x:\n break\n cnt += l[i]\nprint(i + 1)', 'n, x = map(int, input().split())\nl = list(map(int,input().split())) + [0]\ncnt = 0\nif sum(l) <= x:\n pri... | ['Wrong Answer', 'Accepted'] | ['s462761117', 's429952340'] | [3060.0, 2940.0] | [18.0, 17.0] | [195, 201] |
p03000 | u551216452 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = [0]\ni = 1\ncnt = 1\nwhile X - D[i-1] >= 0:\n D.append(D[i-1]+ L[i-1])\n i += 1\n cnt += 1\n if i == N:\n break\nprint(cnt)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = [0]\ncnt = 1\nfor i in range(1,N+1... | ['Wrong Answer', 'Accepted'] | ['s092087749', 's024954922'] | [3060.0, 3060.0] | [17.0, 17.0] | [194, 173] |
p03000 | u553070631 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\na=0\nfor i in range(n-1):\n a+=1\n d+=l[i]\n print(d)\n if d>x:\n break\n\nif d==x:\n a+=1\n\nprint(a)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\na=1\nfor i in range(n):\n d+=l[i]\n #print(d)\... | ['Wrong Answer', 'Accepted'] | ['s550395386', 's090965332'] | [3060.0, 2940.0] | [17.0, 17.0] | [179, 149] |
p03000 | u556594202 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int,input().split())\nl = list(map(int,input().split()))\n\nsum=0\nfor i in range(N+1):\n sum += l[i]\n if sum>X:\n ans = i+1\nprint(ans)\n', 'N,X = map(int,input().split())\nl = list(map(int,input().split()))\n\nsum=0\nfor i in range(N):\n sum += l[i]\n if sum>X:\n ans = i+1\nprin... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s442469164', 's721298486', 's815012419', 's870873373', 's930916266', 's949299562', 's598975948'] | [8920.0, 9104.0, 9096.0, 9068.0, 9092.0, 8880.0, 9108.0] | [23.0, 26.0, 27.0, 22.0, 25.0, 31.0, 28.0] | [153, 151, 167, 178, 156, 182, 173] |
p03000 | u558699902 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# -*- coding: utf-8 -*-\n"""\nAtCoder A\n"""\n\nimport sys, math, random\nimport numpy as np\n\n# N = int(input())\n# A = list(map(int,input().split())) # N row 1 column\n# A = [int(input()) for _ in range(N)] # 1 row N column\n# S = str(input()) # str(input()) == input() -> \'abc\'\n# S = list(input()) # abc -> [\'a... | ['Wrong Answer', 'Accepted'] | ['s608707530', 's814987780'] | [13600.0, 24384.0] | [169.0, 359.0] | [1178, 1180] |
p03000 | u565387531 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nans = 0\ncount_n = 1\nfor n in range(N):\n ans += L[n]\n if ans > X:\n count_n += 1\n\nprint(count_n)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nsum_l = 0\ncount_n = 1\nfor n in L:\n sum_l += n\n ... | ['Wrong Answer', 'Accepted'] | ['s890925882', 's454170556'] | [2940.0, 2940.0] | [17.0, 17.0] | [177, 174] |
p03000 | u566297428 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\n\nL = list(map(int, input().split()))\nD = 0\ncount = 0\n\nfor i in L:\n D += i\n if D <= X:\n count += 1\nprint(count)\n ', 'N, X = map(int, input().split())\n\nL = list(map(int, input().split()))\nD = 0\ncount = 1\n\nfor i in L:\n D += i\n if D <= X:\n co... | ['Wrong Answer', 'Accepted'] | ['s290059567', 's716125449'] | [9108.0, 9164.0] | [32.0, 30.0] | [159, 159] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.