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 | u568595296 | 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 = map(int,input().split())\nans = 0\nnow = 0\nfor i in L:\n now += i\n if now >= X:\n break\n ans +=1\nprint(ans)', 'N, X = map(int,input().split())\nL = map(int,input().split())\nans = 0\nnow = 0\nfor i in L:\n now += i\n ans +=1\n if now > X:\n break\nelse:\n ans += 1... | ['Wrong Answer', 'Accepted'] | ['s760182250', 's596318281'] | [2940.0, 3060.0] | [17.0, 17.0] | [145, 161] |
p03000 | u568693769 | 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()))\niti = 0\ncnt = 1\nfor i in range(n):\n iti += l[i]\n if(iti<=x):\n cnt += 1\nprint(cnt,iti)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\niti = 0\ncnt = 1\nfor i in range(n):\n iti += l[i]\n if(iti<=x):\n ... | ['Wrong Answer', 'Accepted'] | ['s108711669', 's133049155'] | [3060.0, 3060.0] | [18.0, 17.0] | [164, 160] |
p03000 | u569079213 | 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? | ["inp=input().split(' ')\nL=input().split(' ')\nn=int(inp[0])\nl=0;\ncount=1;\nfor i in range(n):\n l+=int(L[i])\n if l<=int(inp[1]):\n count+=1\n else:\n print(count)\nif count==n+1 and l>int(inp[1]):\n print(n)", "inp=input().split(' ')\nL=input().split(' ')\nn=int(inp[0])\nl=0;\ncount=1;\nfor i in range(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s313645277', 's314178803', 's373732263', 's751242179', 's759331460', 's468702387'] | [3064.0, 3060.0, 3064.0, 3064.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [210, 193, 213, 213, 212, 158] |
p03000 | u572002343 | 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, lim = map(int, input().split())\nl = list(map(int, input().split()))\n\ns = 0\nc = 1\nfor i in l:\n s += i\n c += 1\n if (s > lim):\n break\n\nprint(c)', 'N, lim = map(int, input().split())\nl = list(map(int, input().split()))\n\ns = 0\nc = 1\nfor i in l:\n s += i\n if (s > lim):\n break\n c += 1\n\npr... | ['Wrong Answer', 'Accepted'] | ['s449071237', 's140382335'] | [2940.0, 2940.0] | [17.0, 17.0] | [149, 150] |
p03000 | u576375251 | 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())\nlList = [int(i) for i in input().split()]\npoint = 0\ncount = 0\nfor l in lList:\n count = count + 1\n point = point + l\n if point == x:\n if count == 1:\n print(count)\n else:\n print(count+1)\n break\n elif point > x:\n ... | ['Wrong Answer', 'Accepted'] | ['s503195508', 's606632448'] | [3060.0, 3064.0] | [17.0, 17.0] | [347, 406] |
p03000 | u581040514 | 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 = list(map(int, input().split()))\nD = 0\nans = 1\nfor i in range(N):\n if D > X:\n break\n else:\n D += L_list[i]\n ans += 1\nprint(ans)', 'N, X = map(int, input().split())\nL_list = list(map(int, input().split()))\nD = 0\nans = 1\nfor i in range(N)... | ['Wrong Answer', 'Accepted'] | ['s743142642', 's983416721'] | [2940.0, 2940.0] | [17.0, 17.0] | [195, 191] |
p03000 | u586045572 | 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\nlis = list(map(int,input().split()))\ncount = 1\nsm = 0\nfor l in lis:\n sm += l\n count += 1\n if sm >= X:\n break\nprint(count)', 'N, X = map(int,input().split())\n\nlis = list(map(int,input().split()))\ncount = 1\nsm = 0\nfor l in lis:\n sm += l\n if sm > X:\n break\n ... | ['Wrong Answer', 'Accepted'] | ['s482560312', 's377748595'] | [2940.0, 2940.0] | [17.0, 17.0] | [160, 159] |
p03000 | u589753618 | 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\na = 1\n\ns = 0\nfor i in l:\n print(a, s, i)\n s = s + i\n if s > x: break\n a = a + 1\n\nprint(a)\n\n', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\na = 1\n\ns = 0\nfor i in l:\n s = s + i\n if s >... | ['Wrong Answer', 'Accepted'] | ['s572297343', 's085933120'] | [3064.0, 2940.0] | [18.0, 18.0] | [173, 154] |
p03000 | u591322332 | 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\nd=0\n\nfor i in range(n):\n d+=l[i]\n ans+=1\n if(d>x):\n break\n\nif(i=n-1):\n ans-=1\nprint(ans)\n', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\n\na=1\nd=0\n\nfor i in range(n):\n d+=l[i]\n if(d<=x... | ['Runtime Error', 'Accepted'] | ['s293995715', 's615832784'] | [2940.0, 2940.0] | [17.0, 17.0] | [177, 148] |
p03000 | u594781607 | 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 numpy as np\n\nA = input()\nB = input()\n\nN,X = map(int,A.split())\nL = np.array(map(int,B.split( )))\nL_sum = 0\njump = 1\nfor i in range(N+1):\n L_sum += L[i]\n if(L_sum<X):\n jump += 1 \n else:\n jump += 0\n\nprint(jump)', 'import numpy as np\n\nA = input()\nB = input()\n\nN,X = map(int,A.split())... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s507023777', 's521234004', 's712321762', 's117331956'] | [12424.0, 13072.0, 21528.0, 18868.0] | [159.0, 149.0, 301.0, 285.0] | [224, 230, 242, 240] |
p03000 | u597455618 | 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\ntmp = 0\nfor i in range(n):\n if x >= tmp:\n ans += 1\n tmp += l[0]\n else:\n break \n\nprint(ans)', 'n, x= map(int, input().split())\nl = list(map(int, input().split()))\nans = 1\ntmp = 0\nfor i in range(n):\n tmp += l[i]\n ... | ['Wrong Answer', 'Accepted'] | ['s298063384', 's645998491'] | [3064.0, 2940.0] | [17.0, 17.0] | [179, 177] |
p03000 | u598229387 | 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()))\na = 0\nfor i in range(n):\n a += l[i]\n if a > x:\n print(i+1)\n exit()\n else:\n print(n+1)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\na = 0\nd = 1\nfor i in range(n):\n a += l[i]\n ... | ['Wrong Answer', 'Accepted'] | ['s715496342', 's717551047'] | [3060.0, 3068.0] | [18.0, 17.0] | [184, 175] |
p03000 | u600588566 | 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\nif sum(l)<=x:\n print(n+1)\n exit()\n\ni=1\nd=0\nwhile d<=x:\n d+=l[i-1]\n i+=1\nprint(i)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\n\ni=1\nd=0\nwhile d<=x and i<=n:\n d+=l[i-1]\n i+=1\nprint(i)', 'n,x=map(int,inpu... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s165903375', 's188644147', 's927264381'] | [3060.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [151, 123, 149] |
p03000 | u601235270 | 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()))\nold_d = 0\ncount = 1\nfor i in range(1 ,n+1):\n new_d =old_d +l[i-1]\n old_d = new_d\n print(old_d)\n if new_d <= x:\n count +=1\nprint(count)', 'n,x = map(int ,input().split())\nl = list(map(int ,input().split()))\nold_d = 0\nco... | ['Wrong Answer', 'Accepted'] | ['s885983572', 's504846135'] | [3060.0, 3060.0] | [18.0, 17.0] | [221, 204] |
p03000 | u603324902 | 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 = 1\ntmp = 0\nfor i in range(n):\n tmp += l[i]\n if tmp <= x:\n ans += 1\n print(ans)', 'n, x = map(int,input().split())\n\nL = [map(int,input().split())]\n\nans = int(1)\nt = int(0)\nfor i in range(n):\n t += L[i]\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s252628866', 's620980011', 's253764708'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [174, 165, 175] |
p03000 | u606044573 | 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(i) for i in input().split()]\nl = [int(i) for i in input().split()]\n\nd = 0\ncount = 0\nfor i in l:\n if d > x:\n break\n count += 1\n d += i\n\nprint(count', 'n, x = [int(i) for i in input().split()]\nl = [int(i) for i in input().split()]\n\nd = 0\ncount = 0\nfor i in l:\n if d > x:\n... | ['Runtime Error', 'Accepted'] | ['s230729201', 's756565632'] | [2940.0, 3060.0] | [18.0, 18.0] | [174, 201] |
p03000 | u606090886 | 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()))\nsum = 1\nans = 0\nfor i in range(n):\n sum += l[i]\n if x >= sum:\n ans += 1\nprint(ans)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nsum = 0\nans = 1\nfor i in range(n):\n sum += l[i]\n ... | ['Wrong Answer', 'Accepted'] | ['s304812226', 's523598177'] | [3060.0, 3060.0] | [18.0, 18.0] | [177, 177] |
p03000 | u606392530 | 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\nc=0\nfor i in range(1,n+2):\n if d<=x:\n c+=1\n d=d+L[i-1]\nprint(c)\n ', 'n,x=map(int,input().split())\nL=list(map(int,input().split()))\nd=0\nc=0\nfor i in range(1,n+2):\n if d<=x:\n c+=1\n if i<n+1:\n d=d+L[i-1... | ['Runtime Error', 'Accepted'] | ['s212419046', 's877534741'] | [2940.0, 2940.0] | [17.0, 17.0] | [147, 165] |
p03000 | u607729897 | 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\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\nreadlines = sys.stdin.buffer.readlines\n\ndef main():\n N, X = list(map(int,readline().split()))\n L = map(int,readline().split())\n sum = 0\n cnt = 1\n for n in N:\n sum += n\n if sum <= X:\n cnt +... | ['Runtime Error', 'Accepted'] | ['s237540684', 's277869317'] | [3056.0, 2940.0] | [17.0, 17.0] | [376, 376] |
p03000 | u608267787 | 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()))\ncut==1\nfor i in range(n):\n ans=sum(l[:i])\n if ans<=x :\n cut+=1\n else:\n cut+=0\nprint(cut)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\ncut=0\nfor i in range(n+1):\n ans=sum(l[:i])\n if ans<=x :\n ... | ['Runtime Error', 'Accepted'] | ['s608913804', 's588283532'] | [3064.0, 2940.0] | [18.0, 19.0] | [167, 174] |
p03000 | u611090896 | 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=1\nfor i in range(n):\n d += n[i]\n if d<=x:\n count+=1\nprint(count)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nd = 0\ncount=1\nfor i in range(n):\n d += l[i]\n if d<=x:\n count+=1\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s262628790', 's637398298'] | [9172.0, 9088.0] | [27.0, 28.0] | [147, 148] |
p03000 | u614320306 | 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(i) for i in input().split()) \nL = [int(i) for i in input().split()]\nD = 0\nif X < L[0]:\n print(1)\nelse:\n for i in range(N):\n D = D + L[i]\n if D >= X:\n break\n print(i+2)', 'N , X = (int(i) for i in input().split()) \nL = [int(i) for i in input().split()]\nD = 0\nif X < L[0]:\n pr... | ['Wrong Answer', 'Accepted'] | ['s671066988', 's941027443'] | [3060.0, 3064.0] | [17.0, 17.0] | [195, 225] |
p03000 | u615968644 | 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=0\nx=0\nl=[]\nd=0\nc=0\n\nall_input=list(map(int,input().split()))\n\nn=all_input[0]\nx=all_input[1]\n\nfor i in range(2,len(all_input)):\n l.append(all_input[i])\n\nfor j in range(len(l)):\n if d<=x:\n d+=l[j]\n c+=1 \n\nprint(c)\n ', 'd=0\nc=0\n\nn,x=map(int,input().split())\nl = list(i... | ['Wrong Answer', 'Accepted'] | ['s299638381', 's462204315'] | [3060.0, 3060.0] | [18.0, 17.0] | [242, 185] |
p03000 | u616117610 | 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\nz = 0\nfor i in range(n):\n if z <= x:\n z += l[i]\n else:\n print(i)\n break\nif z > x:\n print(n)\nelse:\n print(n+1)', 'n, x = list(map(int, input().split()))\nl = list(map(int,input().split()))\n\nz = 0\nans = n+1\nfor i ... | ['Wrong Answer', 'Accepted'] | ['s766768412', 's999832843'] | [3060.0, 3068.0] | [17.0, 19.0] | [199, 190] |
p03000 | u617228707 | 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())\nList=list(map(int,input().split()))\na = 0\ni = 0\nwhile a < X:\n a = a + List[i]\n i = i + 1\nprint(i', 'N,X= map(int,input().split())\nList=list(map(int,input().split()))\nList.append(0)\na = 0\ni = 0\nwhile a <= X and i <= N:\n a = a + List[i]\n i = i + 1\nprint(i)'] | ['Runtime Error', 'Accepted'] | ['s577056279', 's997700981'] | [2940.0, 2940.0] | [17.0, 17.0] | [132, 160] |
p03000 | u617779302 | 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()\nn = int(a[0])\nx = int(a[1])\nl_str_list = input().split()\nd = 0\nanswer = 0\n\nfor i in n:\n d += int(l_str_list[i])\n if d > x:\n answer = i + 1\n break;\nprint(answer)', 'a = input().split()\nn = int(a[0])\nx = int(a[1])\nl_str_list = input().split()\nd = 0\nanswer = n + 1\n\nfor i in... | ['Runtime Error', 'Accepted'] | ['s115467137', 's243004436'] | [3060.0, 3060.0] | [17.0, 19.0] | [188, 241] |
p03000 | u619670102 | 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 = input().split()\n\nans = 0\nd = 0 \nfor i in l:\n if d > x:\n break\n ans += 1\n d += int(i)\n\n# if ans == len(l):\n# ans += 1\n\nprint(ans+1)', '#coding:utf-8\n\nn,x = map(int,input().split())\nl = list(map(int,input().split()))\n\nl.insert(0,... | ['Wrong Answer', 'Accepted'] | ['s220565390', 's974577008'] | [2940.0, 3060.0] | [18.0, 17.0] | [200, 199] |
p03000 | u620846115 | 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())\nY = list(map(int,input().split()))\nZ = [0]*n\na = 0\nfor i in range(n):\n a +=Y[i]\n Z[i]=a\nimport bisect\nprint(2+bisect.bisect_left(Z,x))', 'n,x=map(int,input().split())\nY = list(map(int,input().split()))\nZ = [0]*n\na = 0\nfor i in range(n):\n a +=Y[i]\n Z[i]=a\nimport bisect\n... | ['Wrong Answer', 'Accepted'] | ['s050242701', 's542647842'] | [9116.0, 9132.0] | [24.0, 29.0] | [165, 167] |
p03000 | u623659526 | 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 logging\n \nlogging.basicConfig(level=logging.INFO, format="%(message)s")\nlogging.disable(logging.CRITICAL)\n \nN, X = (int(x) for x in input().split())\nL = list(int(x) for x in input().split())\n \nlogging.info(L)\n \nlength = 0\ncounter = 1\nif X < L[0]:\n print(1)\nelse:\n for i in L:\n leng... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s563590789', 's695531991', 's728551208', 's825944588'] | [3064.0, 2940.0, 2940.0, 4212.0] | [17.0, 17.0, 17.0, 30.0] | [413, 325, 506, 328] |
p03000 | u623687794 | 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()))\nns=1\ndis=0\ni=0\nwhile dis<=x:\n \n dis+=l[i]\n if dis>x:\n break\n ns+=1\nprint(ns)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nns=1\ndis=0\ni=0\nwhile dis<=x:\n \n dis+=l[i]\n i+=1\n if dis>x:\n break\n elif i==n:... | ['Wrong Answer', 'Accepted'] | ['s321636795', 's105444236'] | [3060.0, 2940.0] | [17.0, 17.0] | [145, 186] |
p03000 | u624613992 | 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()))\nsum = 0\nans = 0\nfor i in l:\n sum += i\n if sum <= x:\n ans += 1\n \n ', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nsum = 0\nans = 0\nfor i in l:\n sum += i\n if sum <= x:\n ans += 1\nprint(ans+1)'] | ['Runtime Error', 'Accepted'] | ['s897020607', 's946806671'] | [9100.0, 9172.0] | [25.0, 31.0] | [140, 145] |
p03000 | u624617831 | 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 = list(map(int, input().split()))\n\ntmp = 0\nfor i in range(100):\n tmp += l_list[i]\n if tmp > x:\n break\n\nif tmp =< x:\n print(101)\nelse:\n print(i+1)\n', 'n, x = map(int, input().split())\n\nl_list = list(map(int, input().split()))\n\ntmp = 0\nfor i... | ['Runtime Error', 'Accepted'] | ['s193686954', 's009280775'] | [2940.0, 2940.0] | [18.0, 18.0] | [206, 204] |
p03000 | u625920333 | 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\nans = 0\n\nwhile sum < x or ans<n+1:\n sum+=l[ans]\n ans += 1\n \nprint(ans)', 'n,x=map(int, input().split())\nl =list(map(int,input().split()))\n\nsum = 0\nans = 0\n\nwhile sum < x or ans<n:\n sum+=l[ans]\n ans += 1\n \npr... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s078880543', 's086177584', 's560806812'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [152, 150, 190] |
p03000 | u626228246 | 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,i,cnt = 0,0,1 \nwhile(D <= X):\n D = D + L[i]\n cnt +=1\n i += 1\nprint(cnt)', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\nD,i,cnt = 0,0,0\nwhile(D <= X or cnt < N+1):\n D = D + L[i]\n cnt +=1\n i += 1\nprint(cnt)', '... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s480677382', 's925196363', 's405611204'] | [3060.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [142, 154, 166] |
p03000 | u626468554 | 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? | ['#bin/usr/env python3\n\nn, x = map(int,input().split())\nlength = input().split()\n\ntotal_len = 0\nfor i in range(n):\n total_len += int(length[i])\n if total_len > x:\n print(i+1)\n break\n if i = n-1:\n print(n+1)\n\n\n\n', '#bin/usr/env python3\n\nn, x = map(int,input().split())\nlen... | ['Runtime Error', 'Accepted'] | ['s515670048', 's711077468'] | [2940.0, 2940.0] | [17.0, 17.0] | [238, 239] |
p03000 | u629540524 | 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()))\nc = 0\nb = 0\nfor i in a:\n b = i+b\n if b <= x:\n c+=1\nprint(c)', 'n,x = map(int,input().split())\na = list(map(int,input().split()))\nc = 1\nb = 0\nfor i in a:\n b = i+b\n if b <= x:\n c+=1\nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s134125013', 's289766611'] | [9084.0, 9160.0] | [26.0, 28.0] | [138, 138] |
p03000 | u632423548 | 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 = input().split()\nC = input().split()\ncount = 0\nstep = 0\nfor i in range(int(A)):\n step += int(C[i])\n if step > int(B):\n break\n count += 1\nprint(count)', 'A, B = input().split()\nC = input().split()\ncount = 1\nstep = 0\nfor i in range(int(A)):\n step += int(C[i])\n if step > int(B):\n break\n... | ['Wrong Answer', 'Accepted'] | ['s412833098', 's286920570'] | [2940.0, 2940.0] | [17.0, 17.0] | [161, 161] |
p03000 | u635949425 | 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())\nM = input()\nl = M.split()\nll = list(map(int, l))\nq=0\nans=1\nfor i in range(a):\n ai +=1\n q += ll[i]\n if q <= b :\n ans += 1\nprint(ans)\n', 'a,b=map(int,input().split())\nM = input()\nl = M.split()\nll = list(map(int, l))\nq=0\nans=1\nfor i in range(a):\n q += ll[i]\n if q ... | ['Runtime Error', 'Accepted'] | ['s544667433', 's988764239'] | [3060.0, 2940.0] | [17.0, 17.0] | [167, 158] |
p03000 | u637824361 | 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()]\nx = 0\nct = 0\nfor i in L:\n x += i\n if x > X:\n print(ct)\n break\n else:\n ct += 1', 'N, X = map(int, input().split())\nL = [int(i) for i in input().split()]\nx = 0\nct = 1\nfor i in L:\n x += i\n if x > X:\n print(ct)\n b... | ['Wrong Answer', 'Accepted'] | ['s288868652', 's097560081'] | [2940.0, 3060.0] | [17.0, 17.0] | [160, 178] |
p03000 | u639104973 | 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=[x for x in range(N) if sum(L[:x])<=X]\nif n>=len(s):\n print(len(s))\nelse:\n print(N+1)', 'N,X=map(int, input().split())\nL=list(map(int, input().split()))\ns=[x for x in range(len(L)+1) if sum(L[:x])<=X]\nif N+1>=len(s):\n print(len(s))\nelse:\... | ['Runtime Error', 'Accepted'] | ['s697371606', 's956751859'] | [3060.0, 3060.0] | [17.0, 17.0] | [153, 162] |
p03000 | u640603056 | 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+1):\n\tif i == 0:\n\t\td = 0\n\telse:\n\t\tprint(i, d)\n\t\td += L[i-1]\n\tif d > x:\n\t\ti -= 2\nprint(i+1)', 'n, x = map(int, input().split())\nL = list(map(int, input().split()))\nd = 0\nbound = 1\nfor l in L:\n\td += l\... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s659524424', 's791187384', 's815329290', 's975516258', 's982834313', 's539522333'] | [3060.0, 2940.0, 2940.0, 3060.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0] | [181, 148, 176, 140, 177, 164] |
p03000 | u652656291 | 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 = 1\nfor i in range(n):\n if x >= sum(l[:i]):\n ans += 1\nprint(ans)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nd = 0\nans = 1\nfor i in range(len(l)):\n d += l[i]\n if x >= d:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s487903626', 's232279217'] | [2940.0, 2940.0] | [18.0, 17.0] | [138, 153] |
p03000 | u659563289 | 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 l = list(map(int, input().split()))\n ans = 1\n max = 0\n\n while True:\n i = 0\n max += l[i]\n if max < x:\n ans += 1\n i += 1\n print(ans)', 'def main():\n n,x = map(int, input().split())\n l = list(map(int, input().sp... | ['Runtime Error', 'Runtime Error', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s394882103', 's470805451', 's594292578', 's651594099', 's714108610'] | [2940.0, 3056.0, 3060.0, 2940.0, 3060.0] | [17.0, 18.0, 2107.0, 2104.0, 17.0] | [221, 255, 244, 263, 338] |
p03000 | u661877625 | 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())\nw = list(map(int, input().split()))\n\nd=0\nif(x==0):\nprint(0)\nelse:\n for i in range(n):\n d=d+w[i]\n if(d>x):\n break\n if(d>=10000):\n break\n \n print(i+1)\n', 'n,x,=map(int, input().split())\nw = list(map(int, input().split()))\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s356707096', 's453105213', 's728849163', 's296799673'] | [2940.0, 2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [231, 230, 154, 183] |
p03000 | u662449766 | 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\ninput = sys.stdin.readline\n\n\ndef main():\n n, x = [int(i) for i in input().split()]\n l_list = [int(i) for i in input().split()]\n d_list = [0]\n d = d_list[0]\n for i in range(1, n):\n d = d + l_list[i - 1] * (i <= n + 1)\n d_list.append(d)\n print(len(filter(lambda i... | ['Runtime Error', 'Accepted'] | ['s300351274', 's393439430'] | [3064.0, 3064.0] | [17.0, 17.0] | [364, 356] |
p03000 | u662794944 | 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? | ['line1 = input().split()\nn = int(line1[0])\nx = int(line1[1])\nL = list(map(int,input().split()))\n\nd = 0\nfor i,l in enumerate(L):\n\tif d > x:\n\t\tprint(i+1)\n\t\tbreak\n\telif i==n-1:\n\t\tprint(i+2)\n\t\tbreak\n\td += l\n', '\nline1 = input().split()\nn = int(line1[0])\nx = int(line1[1])\nL = list(map(int,input... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s299195115', 's929532764', 's008017396'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [202, 187, 202] |
p03000 | u666844906 | 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()))\nc = 0\nfor i in L:\n if L <= X:\n c = c + 1\n elif L > X:\n print(c)\n ', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\ncnt = 1\nD_a = 0\nD_b = 0\nfor i in range(N):\n D_a = D_b + L[i]\n D_b = D_a\n ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s049239044', 's743562111', 's927045747', 's270770379'] | [2940.0, 2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0, 17.0] | [145, 210, 161, 172] |
p03000 | u667024514 | 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,m = map(int,input().split())\nlis = list(map(int,input().split()))\nans = 1\nnow = 0\nfor num in lis:\n now += num\n if now > m:\n exit()\n else:\n ans += 1\nprint(ans)', 'n,m = map(int,input().split())\nlis = list(map(int,input().split()))\nans = 1\nnow = 0\nfor num in lis:\n now += num\n if now > m:\n ... | ['Wrong Answer', 'Accepted'] | ['s302995031', 's687042063'] | [2940.0, 3316.0] | [18.0, 21.0] | [169, 168] |
p03000 | u667084803 | 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())\nL = list(map(int, input().split()))\nd = 0\nans = 1\nfor i in range(N):\n d += L[i]\n if d <= X:\n ans += 1\n\nprint(ans)', 'N, X = map(int, input)\nL = list(map(int, input().split()))\nd = 0\nans = 1\nfor i in range(N):\n d += L[i]\n if d <= X:\n ans += 1\n\nprint(ans)', 'N, X = m... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s783718049', 's841169798', 's315100893'] | [3068.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [143, 141, 151] |
p03000 | u670180528 | 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())\nli=map(int,input().split())\nnum = 0\ncnt = 0\nfor i in li:\n num += i\n cnt += 1\n if num > x:\n print(cnt)\n else:\n pass', 'n,x=map(int,input().split());c=0\nfor i in input().split():\n x-=int(i);c+=1\n if x<=0:c+=(x==0);break\n c+=(c==n)\nprint(min(n+1,c))'] | ['Wrong Answer', 'Accepted'] | ['s174318543', 's332192491'] | [2940.0, 3060.0] | [19.0, 17.0] | [155, 131] |
p03000 | u671446913 | 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 i in range(0, len(L)):\n c += 1\n d += L[i-1]\n \n if d >= X:\n break\n \nprint(c)\n ', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n \nc = 1\nd = 0\nfor i in range(0, len(L)):\n c += 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s261551145', 's833613823', 's922864563'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [174, 171, 179] |
p03000 | u671861352 | 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? | ['LI = lambda: list(map(int, input().split()))\n\nN, X = LI()\nL = LI()\n\n\ndef main():\n ans = X // L\n print(ans)\n\n\nif __name__ == "__main__":\n main()\n', 'LI = lambda: list(map(int, input().split()))\n\nN, X = LI()\nL = LI()\n\n\ndef main():\n ans = 1\n d = 0\n for l in L:\n d += l\n ... | ['Runtime Error', 'Accepted'] | ['s321555394', 's896955921'] | [9120.0, 9140.0] | [22.0, 29.0] | [153, 242] |
p03000 | u672475305 | 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())\nlst = list(map(int,input().split()))\nd = 0; cnt = 0\nfor i in range(n):\n if d + lst[i] <= x:\n d += lst[i]\n cnt += 1\n else:\n break\nprint(cnt)', 'n,x = map(int,input().split())\nlst = list(map(int,input().split()))\nd = 0; cnt = 1\nfor i in range(n):\n ... | ['Wrong Answer', 'Accepted'] | ['s022468329', 's470568438'] | [3060.0, 3060.0] | [17.0, 17.0] | [197, 197] |
p03000 | u673173160 | 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())\nls = input().split()\ncount = 0\nsum = 0\nfor i in range(0, n+1):\n if i <= n-1:\n l = int(ls[i])\n if sum <= x:\n count += 1\n sum += l\n else:\n count += 1\nprint(count)', '#include <bits/stdc++.h>\nusing namespace std;\n\nint main (... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s338779052', 's786548447', 's906757748', 's117484209'] | [3060.0, 2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0, 24.0] | [242, 301, 165, 174] |
p03000 | u673361376 | 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, sys.stdin.readline().split())\nllist =list(map(int, sys.stdin.readline().split()))\n\nd = 0\nans = 1\nfor l in llist:\n ans += 1\n d += l\n if d >= x:\n break\n \n if ans >= n+1:\n print(n+1)\n exit()\nprint(ans)', 'import sys\nn, x = map(int, sys.stdin.readline().split())\nl... | ['Wrong Answer', 'Accepted'] | ['s438775232', 's910608665'] | [3060.0, 3064.0] | [17.0, 17.0] | [239, 276] |
p03000 | u674959776 | 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\na=0\nfor i in range(n):\n if a<=x:\n ans+=1\n a+=l[i]\n print(a)\n else:\n break\nif sum(l)<=x:\n ans+=1\nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=0\na=0\nfor i in range... | ['Wrong Answer', 'Accepted'] | ['s087924537', 's127073371'] | [3064.0, 3060.0] | [17.0, 17.0] | [211, 194] |
p03000 | u677393869 | 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,L=map(int,input().split())\nN=input().split()\nd=0\nans=0\nfor i in N:\n d=d+int(i)\n if d<=L:\n ans+=1\nprint(ans)', 'X,L=map(int,input().split())\nN=input().split()\nd=0\nans=1\nfor i in N:\n d+=int(i)\n if d<=L:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s108120272', 's047493403'] | [3060.0, 2940.0] | [17.0, 17.0] | [114, 113] |
p03000 | u679987760 | 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? | ["info = map(int, input().split(' '))\nN, X = info[0], info[1]\ninfo = map(int, input().split(' '))\nlen = 0\n\ncount = 1\n\nfor for1 in info:\n len += for1\n if len <= X:\n count += 1\n else:\n break\n\nprint(count)", "# -*- coding: utf-8 -*-\ninfo = list(map(int, input().split(' ')))\nN, X = info[0], info[1]... | ['Runtime Error', 'Accepted'] | ['s375606304', 's520292499'] | [3060.0, 3060.0] | [17.0, 18.0] | [209, 246] |
p03000 | u680851063 | 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\na = 0\nfor i in range(n):\n a = a + l[i]\n #print(a)\n if x == a:\n print(i+1+1)\n break\n elif x <= a:\n print(i+1)\n break\n else:\n continue\nprint(i+2)', 'n, x = map(int,input().split())\nl =... | ['Wrong Answer', 'Accepted'] | ['s792901335', 's441305356'] | [3060.0, 3060.0] | [17.0, 18.0] | [262, 270] |
p03000 | u685662874 | 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\ndlist=[]\ndlist.append(0)\nfor i in range(2,n+2):\n d=d+l[i-1]\n if d <= x:\n dlist.append(d)\nprint(len(dlist))\n', 'n,x=map(int,input().split())\nl=list(map(int, input().split()))\nd=0\ndlist=[]\ndlist.append(0)\nfor i in range(1,n+1... | ['Runtime Error', 'Accepted'] | ['s972256414', 's357845576'] | [3064.0, 3060.0] | [18.0, 17.0] | [187, 187] |
p03000 | u686036872 | 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 bisect\n\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nfor i in range(N-1):\n L[i+1] += L[i]\n\nprint(bisect.bisect_right(L, X))', 'import bisect\n\nN, X = map(int, input().split())\nL = [0]+list(map(int, input().split()))\n\nfor i in range(N):\n L[i+1] += L[i]\n\nprint(bisect... | ['Wrong Answer', 'Accepted'] | ['s582926678', 's864730593'] | [3060.0, 3060.0] | [18.0, 17.0] | [158, 160] |
p03000 | u688055251 | 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,a=map(int,input().split())\nb=0\nc=0\nA = [int(input()) for _ in range(x)]\nwhile b<=a:\n b=b+A[c]\n c+=1\nprint(c)', 'x,a=map(int,input().split())\nb=0\nc=0\nA=[int(input()) for _ in range(x)]\nwhile b<=a:\n b=b+A[c]\n c+=1\nprint(c)', 'a,b=map(int,input().split())\nl=list(map(int,input().split()))\nc=... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s161188768', 's601631648', 's211545874'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [116, 114, 157] |
p03000 | u689193446 | 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\nfor a in l:\n count += 1\n if(x-a) < 0:\n break\n\nprint(count)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\ncount = 1\nfor a in l:\n if(x-a) < 0:\n break\n count += 1\nprint(count)', 'n, x = map(i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s083545237', 's468530832', 's745870283'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [142, 141, 150] |
p03000 | u691018832 | 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\n\nn, x = map(int, input().split())\nl = list(map(int, input().split()))\nsum = 1\nfor i in range(n):\n sum += l[i]\n if sum > x:\n print(i)\n sys.exit()\nprint(n+1)', 'import sys\ninput = sys.stdin.readline\n\nn, x = map(int, input().split())\nl = list(map(i... | ['Wrong Answer', 'Accepted'] | ['s103472662', 's536534133'] | [3064.0, 3060.0] | [19.0, 17.0] | [213, 215] |
p03000 | u693048766 | 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? | ['c = 0\nb = 0\nfor an in range(n):\n c+=1\n b+=ls[an]\n if b>x:\n break\nprint(c)', 'n,x=map(int,input().split())\nls=list(map(int,input().split()))\nc = 1\nb = 0\nfor an in range(n):\n b+=ls[an]\n if b>x:\n break\n c+=1\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s181147367', 's252835717'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 152] |
p03000 | u697696097 | 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()))\nd=0\nans=1\nfor a in arr:\n d+=arr\n if d <= x:\n ans+=1\nprint(ans)', 'n,x=map(int,input().split())\narr=list(map(int,input().split()))\nd=0\nans=1\nfor a in arr:\n d+=a\n if d <= x:\n ans+=1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s675194591', 's022703960'] | [9152.0, 8964.0] | [25.0, 26.0] | [131, 130] |
p03000 | u702213338 | 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 = input().split()\nL = [int(x) for x in L]\ncount = 0\nD = 0\nfor i in L:\n D = D + i\n if D <= X:\n count = count + 1\n print(D)\nprint(count+1)', 'N,X=(int(x) for x in input().split())\nL = input().split()\nL = [int(x) for x in L]\ncount = 0\nD = 0\nfor i in L:\n D = ... | ['Wrong Answer', 'Accepted'] | ['s176757933', 's181416706'] | [3060.0, 3064.0] | [17.0, 17.0] | [182, 183] |
p03000 | u707808519 | 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\nD = [0] * (N+2)\nfor i in range(2, N+2):\n D[i] = D[i-1] + L[i-2]\n if D[i] > X:\n ans = i-1\n break\n\nif D[-1] <= X:\n ans = N+1\n\nprint(ans)', 'N, X = map(int, input().split())\nL = [int(x) for x in input().split()]\... | ['Wrong Answer', 'Accepted'] | ['s283541646', 's285501915'] | [3064.0, 3064.0] | [18.0, 19.0] | [229, 229] |
p03000 | u711539583 | 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 = [0] + list(map(int, input().split()))\nd = 0\ni = 1\nwhile True:\n if d > x:\n print(i - 1)\n break\n if i == n + 1:\n print(i)\n break\n i += 1\n d += l[i-2]\n', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0... | ['Wrong Answer', 'Accepted'] | ['s873990645', 's346690341'] | [2940.0, 2940.0] | [17.0, 18.0] | [225, 219] |
p03000 | u716660050 | 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()))\nmem=1; ans=0\nfor i in L:\n mem+=i\n if mem<=X: ans+=1\nprint(ans)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nmem=0; ans=1\nfor i in L:\n mem+=i\n if mem<=X: ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s985718559', 's596466868'] | [2940.0, 2940.0] | [17.0, 17.0] | [130, 130] |
p03000 | u723554767 | 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=1\nd=0\nfor l in L:\n if d+l<=x:\n d+=l\n print(d+l)\n 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\nfor l in L:\n if d+l<=x:\n d+=l\n ... | ['Wrong Answer', 'Accepted'] | ['s205355921', 's888699391'] | [2940.0, 2940.0] | [17.0, 17.0] | [181, 162] |
p03000 | u723583932 | 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()))\nz=0\nans=1\nfor i in range(n):\n z+=l[i]\n if z>x:\n ans=i\n break\nprint(ans)', '\nn,x=map(int,input().split())\nl=list(map(int,input().split()))\nz=0\nans=0\nfor i in range(n):\n z+=l[i]\n if z>=x:\n ans=i+2\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s434965836', 's451441824', 's948666820'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [170, 174, 158] |
p03000 | u728498511 | 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()))\nb, ans = 0, 1\nfor i in a:\n if b<=x: ans+= 1\n b += i\nprint(ans)', 'n, x = map(int, input().split())\na = list(map(int, input().split()))\nb, ans = 0, 1\nfor i in a:\n b += i\n if b<=x: ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s474495914', 's696649912'] | [2940.0, 2940.0] | [17.0, 17.0] | [133, 132] |
p03000 | u728615412 | 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()))\nx = list(map(int,input().split()))\ny = []\nt = 0\nfor i in range(a[0]): \n if sum(y) <= a[1]:\n t += 1\n y.append(x[i])\n else:\n break\nif sum(x) <= a[1]:\n print(t)\nelse:\n print(t + 1)', 'N,X = map(int,input().split())\nL = ... | ['Wrong Answer', 'Accepted'] | ['s395834738', 's687944146'] | [3060.0, 3060.0] | [17.0, 17.0] | [265, 220] |
p03000 | u729535891 | 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\ns = 0\nfor i in range(l):\n s += i\n if s <= x:\n cnt += 1\n else:\n break\n\nprint(cnt)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\ncnt = 0\ns = 0\nfor i in l:\n s += i\n if s <... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s163022910', 's953926622', 's480083392'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [181, 173, 238] |
p03000 | u731322489 | 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 numpy as np\n\nn, x = map(int, input().split())\nL = list(map(int, input().split()))\n\nCS_L = np.cumsum(L).tolist()\nans = len([l for l in L if l <= x])\nprint(ans)', 'd, i = 0, 0\nwhile d <= x:\n d += L[i]\n i += 1\n\nprint(i)', 'import numpy as np\n\nn, x = map(int, input().split())\nL = list(map(int,... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s347547131', 's481720333', 's593951787', 's338589683'] | [12504.0, 2940.0, 12516.0, 12516.0] | [151.0, 18.0, 152.0, 155.0] | [165, 60, 168, 172] |
p03000 | u733734110 | 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())\nlist = input().split(' ')\n\ns = 0\nc = 0\n\nfor item in range(a):\n c += 1\n if (s + int(item)) <= b:\n s += int(item)\n else:\n break\n\nprint(c)", "a,b=map(int, inout().split())\nlist = input().split(' ')\n\ns = 0\nc = !\n\nfor item in list:\n c += 1\n if... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s110349156', 's750267336', 's078138286'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [188, 184, 188] |
p03000 | u735996463 | 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()))\nk = list(itertools.accumulate(l))\nk.append(0)\nk.sort()\ns = 0\nii = 0\n\nfor i in k:\n if(i<=x):\n continue\n else:\n ii+=1\n break\nif(s==0):\n print(n)\nelse:\n print(max(1,s))', 'import i... | ['Wrong Answer', 'Accepted'] | ['s447089978', 's368638178'] | [3064.0, 3060.0] | [17.0, 17.0] | [288, 249] |
p03000 | u739843002 | 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(lambda a: int(a), input().split(" ")))\nL = list(map(lambda b: int(b), input().split(" ")))\n\ni = 1\ns = 0\nwhile(s <= X and i < len(L)):\n s += L[i]\n i += 1\n\nprint(i)', 'N, X = list(map(lambda a: int(a), input().split(" ")))\nL = list(map(lambda b: int(b), input().split(" ")))\n\ni = 0\ns = 0\n... | ['Wrong Answer', 'Accepted'] | ['s209867173', 's182859065'] | [9108.0, 9104.0] | [33.0, 26.0] | [180, 201] |
p03000 | u739959951 | 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\na=0\nfor i in range(n):\n a=a+l[i]\n if a>x:\n break\n else:\n ans=+1\n \nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\n\nans=0\na=0\nfor i in range(n):\n if a<=x:\n a+=l[0]\n ans+=1\n \n... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s058164391', 's680280015', 's938488784', 's942538431', 's758365625'] | [3060.0, 2940.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0] | [157, 145, 212, 147, 156] |
p03000 | u747427153 | 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()]\ns = 1\nd = 0\nwhile d <= x:\n for i in range(0,n):\n d = d + l[i]\n s += 1\nprint(s)', 'n, x = map(int, input().split())\nl = [int(i) for i in input().split()]\ns = 1\nd = 0\nfor i in l:\n if d <= x: \n d = d + i\n s += 1\n else:\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s135757347', 's226982273', 's524921497', 's923846952', 's113171955'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0, 17.0, 17.0] | [156, 161, 156, 154, 159] |
p03000 | u747873993 | 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(i) for i in input().split())\nL=[int(i) for i in input().split()]\nfor i in range(1,N+1):\n if sum(L[:i])>X:\n print(i)', 'N,X=(int(i) for i in input().split())\nL=[int(i) for i in input().split()]\nfor i in range(1,N+1):\n if sum(L[:i])>X:\n print(i)\n break\nelse:\n print(N+1)... | ['Wrong Answer', 'Accepted'] | ['s168776072', 's383129706'] | [3060.0, 3060.0] | [18.0, 17.0] | [134, 169] |
p03000 | u755180064 | 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? | ['\nurl = "https://atcoder.jp//contests/abc130/tasks/abc130_b"\n\ndef main():\n n,x = list(map(int, input().split()))\n lis = list(map(int, input().split()))\n lis.insert(0, 0)\n count = 0\n pos = 0\n for l in lis:\n pos += l\n count += 1\n if pos > x:\n print(count)\n ... | ['Wrong Answer', 'Accepted'] | ['s189914214', 's447855288'] | [9172.0, 9116.0] | [25.0, 32.0] | [378, 380] |
p03000 | u757030836 | 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 = [int(i) for i in range(N)]\n\nD =[]\nD[0]=0\n\nfor i in range(N):\n x += L[i]\n D.append(x)\n \n \nprint(D)', 'import bisect\nn,k = map(int,input().split())\nl = list(map(int,input().split()))\nx=[0]\nnum = 0\nfor i in range(n):\n num += l[i]\n x.append(num)\n\n\nans = bise... | ['Runtime Error', 'Accepted'] | ['s697744454', 's143841867'] | [2940.0, 3060.0] | [17.0, 18.0] | [137, 188] |
p03000 | u758953171 | 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()))\nsumarr = np.cumsum(arr)\nprint(len(sumarr[sumarr<=X])+1)\n', 'import numpy as np\nN,X = map(int,input().split())\nsumarr = np.cumsum(list(map(int,input().split())))\nprint(len(sumarr[sumarr<=X])+1)'] | ['Runtime Error', 'Accepted'] | ['s908450098', 's981831286'] | [2940.0, 12392.0] | [17.0, 151.0] | [124, 132] |
p03000 | u760360044 | 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,open().split()))\ni=list(map(int,open().split()))\nlistD=[0]\nd=0\n\nfor s in i:\n\td=d+s\n\tif d <= X:\n\t\tlistD.append(d)\n \nprint(len(listD))', 'N,X=list(map(int,input().split()))\ni=list(map(int,input().split()))\nd=1\na=0\nfor s in i:\n\ta+=s\n\tif a<=X:\n\t\td+=1 \nprint(d)'] | ['Runtime Error', 'Accepted'] | ['s103814795', 's222310185'] | [2940.0, 2940.0] | [17.0, 17.0] | [156, 127] |
p03000 | u762199573 | 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\ncnt = 0\nans = [0]\n\nfor i in l:\n cnt += i\n if cnt <= x:\n ans.append(cnt)\nprint(ans)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\n\ncnt = 0\nans = [0]\n\nfor i in l:\n cnt += i\n if cnt <= x:\... | ['Wrong Answer', 'Accepted'] | ['s496731197', 's304777404'] | [3064.0, 3060.0] | [18.0, 17.0] | [165, 170] |
p03000 | u762540523 | 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()))\ncountBound = 0\ncoordinate = 0\n\n\nwhile True:\n if coordinate > x or countBound >= n:\n break\n else:\n # print(countBound)\n coordinate += l[countBound]\n countBound += 1\n\ncountBound += 1\nprint(countBound)\n... | ['Wrong Answer', 'Accepted'] | ['s435544327', 's416726707'] | [2940.0, 2940.0] | [19.0, 19.0] | [320, 304] |
p03000 | u762960952 | 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\nans = 1\nfor i in range(N):\n if D <= X:\n ans += 1\n D += L[i]\n\nprint(ans)\n', 'N,X = map(int,input().split(" "))\nL = list(map(int,input().split(" ")))\nD = 0\nans = 0\n\nfor i in range(N):\n ans += 1\n if D > X:\n break\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s042294523', 's197232219', 's905224094', 's426852767'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [157, 173, 174, 160] |
p03000 | u764956288 | 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\n# list_l = [int(x) for x in input().split()]\n\nposition = 0\ncount = 0\n\nfor i in range(N):\n position += int(input())\n if position <+ X:\n count += 1\n\nprint(count)\n', 'N, X = map(int, input().split())\n\nlist_l = [int(x) for x in input().split()]\n\nposition = ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s249651842', 's858652681', 's742213145'] | [3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [208, 192, 192] |
p03000 | u770160911 | 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()]\nk=0\ncount=0\nfor i in range(n+1):\n if k<=x:\n count+=1\n k+=l[i]\nprint(count)', '[n,x]=[int(i) for i in input().split()]\nl=[int(x) for x in input().split()]\na=0\nsu=0\n\nfor i in l:\n a+=1\n if su>x:\n \n break... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s036250579', 's791298678', 's859924891'] | [3060.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [155, 169, 192] |
p03000 | u777283665 | 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 = [0] + [int(i) for i in input().split()]\n\nc = 0\n\nfor i in range(len(l)):\n if sum(L[:i+1]) <= x:\n c += 1\nprint(c)', 'n, x = map(int, input().split())\nl = [0] + [int(i) for i in input().split()]\n\nc = 0\n\nfor i in range(len(l)):\n if sum(l[:i+1]) <= x:\n ... | ['Runtime Error', 'Accepted'] | ['s130525321', 's053684484'] | [2940.0, 2940.0] | [18.0, 17.0] | [158, 158] |
p03000 | u779170803 | 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? | ["INT = lambda: int(input())\nINTM = lambda: map(int,input().split())\nSTRM = lambda: map(str,input().split())\nSTR = lambda: str(input())\nLIST = lambda: list(map(int,input().split()))\nLISTS = lambda: list(map(str,input().split()))\ndef do():\n n,x=INTM()\n l=LIST()\n ct=0\n temp=0\n for i in range(n):... | ['Wrong Answer', 'Accepted'] | ['s464599745', 's279815181'] | [3064.0, 3064.0] | [17.0, 18.0] | [446, 446] |
p03000 | u780675733 | 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())\nLIST = list(map(int,input().split()))\n\nRES = []\nichi = 0\ncnt = 1\n\nfor i in LIST:\n if ichi <= X:\n cnt = cnt + 1\n ichi = ichi + i\n\nprint(cnt)', '#B\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\n\ncnt = 1\nichi = 0\nfor l in L:\n ... | ['Wrong Answer', 'Accepted'] | ['s189811811', 's327578458'] | [3060.0, 3060.0] | [17.0, 17.0] | [189, 191] |
p03000 | u780698286 | 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()))\nl = [0] * (n+1)\nfor i in range(n):\n L[i+1] = l[i] + a[i]\nans = 0\nfor i in l:\n if i <= x:\n ans += 1\nprint(ans)', 'n, x = map(int, input().split())\na = list(map(int, input().split()))\nl = [0] * (n+1)\nfor i in range(n):\n l[i+1] = l[i... | ['Runtime Error', 'Accepted'] | ['s209027136', 's520644884'] | [9188.0, 9176.0] | [23.0, 32.0] | [183, 183] |
p03000 | u788856752 | 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\nprint(n, x)\nprint(l)\nd = 0\ncnt = 0\nif l[0] == 0:\n print(cnt)\nelse:\n cnt += 1\n for i in range(n + 1):\n print(d, cnt)\n d += l[i - 1]\n if d <= x:\n cnt += 1\n print(cnt)\n', 'n, x = map(int, in... | ['Wrong Answer', 'Accepted'] | ['s924165171', 's113378883'] | [3060.0, 3060.0] | [17.0, 18.0] | [279, 239] |
p03000 | u789854092 | 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())\nLn = list(map(int,input().split()))\ncnt = 1\nsum = 0\n for i in range(1, N):\n sum += Ln[i]\n if sum > X:\n break\n cnt += 1\nprint(cnt)', 'N, X = map(int,input().split())\nLn = map(int,input().split())\ncnt = 1\nsum = 0\n for i in range(1, N):\n sum += Ln[i]\n if sum > X... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s453320485', 's463331338', 's942604698', 's988631113', 's151258614'] | [2940.0, 2940.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [167, 171, 161, 166, 172] |
p03000 | u790301364 | 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? | ['def main15():\n data = input().split()\n num = []\n for i in range(2):\n num.append(int(data[i]))\n data2 = input().split()\n num2 = []\n for i in range(num[0]):\n num2.append(int(data2[i]))\n length = 0\n result = 1\n for i in range(num[0]):\n length = length + num[2]\... | ['Runtime Error', 'Accepted'] | ['s675280154', 's790136491'] | [3064.0, 3064.0] | [18.0, 17.0] | [456, 457] |
p03000 | u792843593 | 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 = input().split()[1]\n\nls = [int(n) for n in input().split()]\n\nfor index in range(len(ls)):\n\tlist = ls[0:index]\n\tif sum(list) > x:\n\t\tprint(index)\n\t\tbreak\n\telif sum(list) == x:\n\t\tprint(index + 1)\n\t\tbreak', 'x = int(input().split()[1])\n\nls = [int(n) for n in input().split()]\n\nfor index in ran... | ['Runtime Error', 'Accepted'] | ['s772710806', 's875765317'] | [2940.0, 3060.0] | [17.0, 18.0] | [203, 256] |
p03000 | u793821463 | 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)\nD[0] = 0\nk=0\nfor i in range(N):\n if D[i] <= X:\n D[i+1] = D[i] + L[i]\n k += 1\nif D[N] <= X:\n k += 1\nprint(k) ', 'N,X = map(int, input().split())\nL =list(map(int,input().split()))\nD = 0\nk = 0\nfor i in range(N):\n... | ['Wrong Answer', 'Accepted'] | ['s448846102', 's472229918'] | [3064.0, 3060.0] | [18.0, 18.0] | [201, 167] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.