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 | u095021077 | 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\nlength=0\ncounter=0\nwhile l<=X:\n length+=L[counter]\n counter+=1\n \nprint(counter)', 'N, X=map(int, input().split())\nL=list(map(int, input().split()))\n\nl=0\ncounter=0\nwhile l<=X:\n l+=L[counter]\n counter+=1', 'N, X=map(int, input().spli... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s121259959', 's140327006', 's271665878', 's626925697', 's933770466', 's999737072'] | [2940.0, 2940.0, 2940.0, 3064.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0, 18.0, 18.0, 18.0] | [148, 120, 122, 158, 130, 217] |
p03000 | u095844416 | 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()))\nlist=[0]\ncnt=0\nfor i in l:\n i=i+list[cnt]\n list.append(i)\n cnt+=1\nprint(list)\nans=0\nfor i in list:\n if i>=x:\n ans+=1\nprint(ans)\n \n \n ', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nlist=[0]\ncnt=0\nfor i in l:\... | ['Wrong Answer', 'Accepted'] | ['s299262895', 's441832361'] | [9076.0, 9076.0] | [25.0, 25.0] | [205, 193] |
p03000 | u095902316 | 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? | ['in1 = list(map(int, input().split()))\nN = in1[0]\nX = in2[1]\n\nL = list(map(int, input().split()))\nD = [0] * 10000\n\nfor i in range(1, N):\n D[i] = D[i-1] + L[i-1]\n if X < D[i]:\n print(D[i-1])', 'in1 = list(map(int, input().split()))\nN = in1[0]\nX = in1[1]\n \nL = list(map(int, input().split()))\nL.append... | ['Runtime Error', 'Accepted'] | ['s590000719', 's903390244'] | [3064.0, 3064.0] | [17.0, 17.0] | [193, 329] |
p03000 | u098065136 | 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 = list(map(int,input().split()))\n\nd = 0\nans = 0\n\nfor i in range(n):\n if d <= x:\n ans += 1\n d += li[i]\n else\n d += li[i]\n\nprint(ans)', 'n,x = map(int,input().split())\nli = list(map(int,input().split()))\n\nd = 0\nans = 0\n\nfor i in range(n):\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s328262118', 's684286059', 's954666845'] | [2940.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0] | [192, 193, 203] |
p03000 | u098982053 | 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 next_pos(D,L):\n return D+L\n \nN, X = map(int,input().split(" "))\nL = [int(i) for i in input().split(" ")]\nD = 0\ncount = 0\ni = 0\n\nwhile(D<=X or i<N):\n D = next_pos(D,L[i])\n count+=1\n i+=1\n \nprint(count)', 'N, X = map(int,input().split(" "))\nL = [int(i) for i in input().split(" ")]\n... | ['Runtime Error', 'Accepted'] | ['s353494574', 's668756171'] | [3064.0, 3060.0] | [18.0, 17.0] | [222, 170] |
p03000 | u100277898 | 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().strip().split()\nn = int(n)\nx = int(x)\nl = input().strip().split()\nnow = 0\nfor i in range(n):\n now += l[i]\n if now > x:\n print(i)\n exit()', 'n, x = input().strip().split()\nn = int(n)\nx = int(x)\nl = input().strip().split()\nnow = 0\nfor i in range(n):\n now += l[i]\n if now > x:\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s666017584', 's666476968', 's905068146', 's860288955'] | [3060.0, 2940.0, 3060.0, 3064.0] | [17.0, 17.0, 18.0, 17.0] | [159, 149, 170, 194] |
p03000 | u100659799 | 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 = [int(i) for i in input().split()]\nK = [int(i) for i in input().split()]\ns = 0\nc = 1\nfor i in K:\n\tif (i + s) <= N[1]\n \t\tc += 1\n \ts += i + s\n\telse\n \tbreak\nprint(c)\n', 'N = [int(i) for i in input().split()]\nK = [int(i) for i in input().split()]\ns = 0\nc = 1\nfor i in K:\n s += i\n i... | ['Runtime Error', 'Accepted'] | ['s935495719', 's413299360'] | [3064.0, 2940.0] | [17.0, 19.0] | [175, 175] |
p03000 | u100800700 | 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\nD=0\nfor i in range(N):\n D+=L[i]\n if D>X:\n break\n c+=1\nprint(c)', '#130\nN,X=map(int,input().split())\nL=list(map(int,input().split()))\nc=1\nD=0\nfor i in range(N):\n D+=L[i]\n if D<=X:\n c+=1\nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s007777582', 's376369589'] | [2940.0, 3060.0] | [17.0, 17.0] | [144, 140] |
p03000 | u101113363 | 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\nhr= list(map(int,input().split()))\n\ncount=1\n\nkazu=0\n\nfor i in hr :\n \n kazu += i \n \n if i <= X:\n count +=1\n\nprint(count)', 'N,X = map(int,input().split())\n\nhr= list(map(int,input().split()))\n\ncount=1\n\nkazu=0\n\nfor i in hr :\n \n kazu += i \... | ['Wrong Answer', 'Accepted'] | ['s251979239', 's301374535'] | [3060.0, 2940.0] | [17.0, 17.0] | [170, 182] |
p03000 | u102367647 | 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-Bounding.py\n\nimport sys\nfrom functools import lru_cache\n\ndef main():\n N, X = list(map(int,sys.stdin.readline().split()))\n L = list(map(int,sys.stdin.readline().split()))\n print(L)\n\n @lru_cache(maxsize=None)\n def D(i):\n if i == 1:\n return 0\n elif i <= N+1:... | ['Wrong Answer', 'Accepted'] | ['s173638796', 's843277872'] | [3684.0, 3828.0] | [22.0, 29.0] | [470, 487] |
p03000 | u104442591 | 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\nans = 1\nfor i in range(n):\n d += l[i]\n if d <= x:\n ans += 1\n else:\n break', 'n, x = map(int, input().split())\nl = [int(i) for i in input().split()]\nd = 0\nans = 1\nfor i in range(n):\n d += l[i]\n if d <= x:\n ans +=... | ['Wrong Answer', 'Accepted'] | ['s048565400', 's140255858'] | [3064.0, 2940.0] | [19.0, 17.0] | [159, 170] |
p03000 | u106103668 | 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()))\nL=0\nfor i in range(n):\n L += l[i]\n if L > x:\n print(i+1)\n return()', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nans = 1\nL=0\nfor i in range(n):\n L += l[i]\n if L <= x:\n ans+=1\nprint(... | ['Runtime Error', 'Accepted'] | ['s060692261', 's344869250'] | [3064.0, 2940.0] | [17.0, 17.0] | [152, 151] |
p03000 | u112247039 | 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\ncount = 1\nfor i in L:\n s += i\n if s > x:\n break\n count += 1\nprint(count)', 'n, x = map(int,input().split())\nl = list(map(int, input().split()))\ns = 0\ncount = 1\nfor i in l:\n s += i\n if s > x:\n break\n... | ['Runtime Error', 'Accepted'] | ['s346129219', 's178433569'] | [9160.0, 9168.0] | [25.0, 24.0] | [162, 163] |
p03000 | u113255362 | 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()))\nheight = 0\nres = 1\ndef checkF(k,x):\n if k>=x:\n return True\n else:\n return False\n \nfor i in range(N):\n if checkF(height,X):\n break\n height += List[i]\n res +=1\nprint(res)\n ', 'N,X=map(int,input().split())\nList = list(... | ['Wrong Answer', 'Accepted'] | ['s241713094', 's558180288'] | [8968.0, 9136.0] | [26.0, 35.0] | [256, 268] |
p03000 | u113971909 | 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 i in L:\n D.append(D[-1]+i)\nfor i in D:\n if i<=X:\n cnt+=1 ', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nD=[0]\nfor i in L:\n D.append(D[-1]+i)\n if D[-1]>X:\n print(len(D)-1)\n break\n else:\n p... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s203561129', 's298228672', 's340101340', 's562459658'] | [2940.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [140, 164, 142, 150] |
p03000 | u115110170 | 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 = list(map(int,input().split()))\n\nwa = 0\ncount = 0\nfor i in range(n):\n wa += ls[i]\n if wa > x:\n break\n count += 1\nprint(count)\n', 'n,x = map(int,input().split())\nls = list(map(int,input().split()))\n\nwa = 0\ncount = 1\nfor i in range(n):\n wa += ls[i]\n if wa > x... | ['Wrong Answer', 'Accepted'] | ['s782363738', 's439392487'] | [2940.0, 2940.0] | [17.0, 18.0] | [167, 167] |
p03000 | u121161758 | 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\n\nfor i in range(2,n+2):\n if sum >= x:\n break\n else:\n sum += l[i-2]\n print(sum)\n\n \nprint(i-1)', 'n ,x = map(int, input().split())\nl = list(map(int, input().split()))\n\nsum = 0\n\nfor i in range(2,n+2):\n if sum ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s108200193', 's169413107', 's342750021', 's657754606', 's752128438'] | [3064.0, 3060.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [184, 184, 183, 169, 184] |
p03000 | u123745130 | 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,y=map(int,input().split())\nlst=list(map(int,input().split())) \nlst=[0]+lst\ncnt=0 \nsum_lst=0 \nfor i in range(n+1): \n\tsum_lst+=lst[i]\n\tif sum_lst>=y:\n\t\tcnt+=1\nprint(cnt-1)', 'n,y=map(int,input().split())\nlst=list(map(int,input().split())) \nlst=[0]+lst\ncnt=0 \nsum_lst=0 \nfor i in range(n+1): \n\tsum_l... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s049156390', 's276279893', 's973696812', 's420491464'] | [3060.0, 3060.0, 2940.0, 3060.0] | [17.0, 19.0, 18.0, 18.0] | [171, 172, 180, 169] |
p03000 | u130492706 | 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? | ['#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n"""\nCreated on Tue Jun 25 12:46:40 2019\n\n@author: YudNK\n"""\n\nn,x = map(int, input().split())\nl = [int(i) for i in input().split()]\ncount = 1\npx = 0\nfor i in range(n):\n nx = px + l[i]\n if nx <= x:\n count += 1\nprint(count)', '#!/usr/bin/env pyt... | ['Wrong Answer', 'Accepted'] | ['s247296613', 's493562920'] | [3060.0, 3060.0] | [18.0, 17.0] | [280, 292] |
p03000 | u130900604 | 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=0\nwhile d<=x:\n cnt+=1\n d+=l[i-1]\n \nprint(cnt)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))+[0]\n#i=1\nd=0\ncnt=0\nfor i in range(n+1):\n if d<=x:\n cnt+=1\n d+=l[i]\n\n \nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s287006153', 's697600090'] | [3060.0, 2940.0] | [17.0, 18.0] | [122, 150] |
p03000 | u135116520 | 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=[]\nD.append(0)\nfor i in range(1,N+2):\n D.append(D[i-1]+L[i-1])\ns=0\nfor j in D:\n if j<=X:\n s+=1\nprint(s)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nD=[]\nD[0]=0\nfor i in range(1,N+2):\n D.append(D[i-1]+L[i-1])\ns=0... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s073370129', 's196934271', 's280513827', 's477664118', 's731694841', 's879001452', 's883720457', 's946693558', 's008305481'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [172, 182, 176, 181, 181, 205, 183, 187, 186] |
p03000 | u135197221 | 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 mapt(fn, *args):\n return tuple(map(fn, *args))\n\n\ndef Input():\n return mapt(int, input().split(" "))\n\n\ndef main():\n n, x = Input()\n l = Input()\n d = list(range(n+1))\n ans = 0\n\n for i in range(1, n+1):\n d[i] = d[i-1] + l[i-1]\n\n for i in d:\n if i <= x: ans += 1... | ['Wrong Answer', 'Accepted'] | ['s927524111', 's230878757'] | [8916.0, 9320.0] | [30.0, 34.0] | [316, 384] |
p03000 | u136090046 | 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_array = [int(x) for x in input().split()]\nd = 0\ncnt = 0\nwhile d <= x:\n d = d+l_array[d]\n cnt += 1\nprint(cnt)', 'n, x = map(int, input().split())\nl_array = [int(x) for x in input().split()]\nd = 0\ncnt = 1\nfor i in range(n):\n d = d + l_array[i]\n if d > x:\n ... | ['Runtime Error', 'Accepted'] | ['s777379279', 's516789775'] | [2940.0, 2940.0] | [17.0, 17.0] | [145, 184] |
p03000 | u140724346 | 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 = [x for x in map(int, input().split())]\naccumL = [sum(L[:x]) for x in range(len(L)+1)]\nTF = [i < X for i in accumL]\nprint(str(TF.index(False)+ 1))', 'N,X = map(int, input().split())\nL = [x for x in map(int, input().split())]\naccumL = [sum(L[:x]) for x in range(len(L)+1)]\nTF =... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s085800895', 's529535135', 's804606862', 's345824944'] | [3064.0, 3060.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [181, 177, 186, 200] |
p03000 | u143051858 | 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)\nx = 0\nfor i in range(1,N+2):\n D[i] = D[i-1]+L[i-1]\nwhile D[x] <= X:\n x += 1\nprint(x)', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\nD = [0]*(N+1)\nx = 0\nfor i in range(1,N+1):\n D[i] = D[i-1]+L[i-1]\nfo... | ['Runtime Error', 'Accepted'] | ['s331709761', 's597283743'] | [3060.0, 3060.0] | [17.0, 17.0] | [166, 176] |
p03000 | u143492911 | 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()))\np=0\nans=1\nfor i in range(n):\n p+=L[i]\n ans+=1 if p<=x else continue\nprint(ans)', 'n,x=map(int,input().split())\nL=list(map(int,input().split()))\na=[0]*(n+1)\nfor i in range(1,n+1):\n a[i]=a[i-1]+L[i-1]\nfor i in range(n):\n if a... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s451546868', 's896583198', 's786182917'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [154, 186, 171] |
p03000 | u148378522 | 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 li in l:\n d.append(d[-1] + li)\nprint(len([di for di in d if d <= x]))\n', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd = [0]\nfor li in l:\n d.append(d[-1] + li)\nprint(len([di for di in d if di <= x])... | ['Runtime Error', 'Accepted'] | ['s691649466', 's236794605'] | [2940.0, 2940.0] | [18.0, 17.0] | [152, 153] |
p03000 | u148551245 | 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\ncount = 0\nfor i in range(n - 1):\n if count > x:\n ans = i\n break\n else:\n count += l[i]\nprint(ans)', '(n, x) = map(int, input().split())\nl = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s116124541', 's488812679', 's645578621', 's681982107', 's568027164'] | [2940.0, 2940.0, 2940.0, 3060.0, 3060.0] | [18.0, 17.0, 18.0, 17.0, 17.0] | [195, 241, 195, 206, 207] |
p03000 | u150664457 | 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\ncount = 1\npoint = 0\n\nwhile point <= X and count <= N:\n point += List[count-1]\n count += 1\n\nprint(count)', 'N, X = map(int,input().split()) \nList = list(map(int,input().split())) \n\ncount = 1\npoint = 0\n\nwhile point <= X and c... | ['Wrong Answer', 'Accepted'] | ['s476335898', 's696509585'] | [2940.0, 2940.0] | [17.0, 17.0] | [255, 278] |
p03000 | u152638361 | 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 = L[0]\nwhile D<=X and ans<N+1:\n ans+=1\n if ans < N+1: \n D+=L[ans-1]\n print("座標 {}".format(D))\nprint(ans)', 'N, X = map(int,input().split())\nL = list(map(int,input().split()))\nans = 1\nD = L[0]\nwhile D<=X and ans<N... | ['Wrong Answer', 'Accepted'] | ['s393749484', 's497668886'] | [3060.0, 3060.0] | [17.0, 17.0] | [226, 196] |
p03000 | u152893557 | 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? | ['alfa=input()\nN=int(alfa[0])\nX=int(alfa[2])\n\nL=input().split()\n\n\nprint(N,X,L)\nD=0\ncount=0\nfor i in range(N):\n count+=1\n D+=int(L[i])\n if D>X:\n print(count)\n break\n', 'alfa=input().split()\nN=int(alfa[0])\nX=int(alfa[1])\n\nL=input().split()\n\n\nprint(N,X,L)\nD=0\ncount=1\nfor i ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s125550030', 's241142223', 's335790726', 's339067385', 's448326440', 's515287848', 's644953946', 's838165147'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3064.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0, 18.0, 18.0, 23.0, 17.0, 17.0] | [228, 261, 263, 250, 182, 191, 228, 276] |
p03000 | u153499445 | 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()]\nd=0\ncnt=0\nfor i in range(n):\n d=d+l[i]\n if d<=x:\n cnt+=1\nprint(cnt)', 'n,x=[int(x) for x in input().split()]\nl=[int(x) for x in input().split()]\nd=0\ncnt=1\nfor i in range(n):\n d=d+l[i]\n if d<=x:\n cnt+=1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s001743333', 's178959398'] | [9180.0, 9180.0] | [31.0, 27.0] | [146, 146] |
p03000 | u157232135 | 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 main():\n n,x = map(int,input().split())\n l = list(map(int, input().split()))\n dist = 0\n count = 0\n for i in range(n):\n dist += l[i]\n if dist > x:\n break\n count += 1\n print(count)\n \nif __name__ == "__main__":\n main()', 'def main():\n n,x = map... | ['Wrong Answer', 'Accepted'] | ['s428899107', 's164704470'] | [3060.0, 3060.0] | [17.0, 17.0] | [275, 275] |
p03000 | u158703648 | 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 L:\n D+=L\n if D<=X:\n count+=1\n else:\n break\nprint(count)', '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:\n co... | ['Runtime Error', 'Accepted'] | ['s767176543', 's734071491'] | [2940.0, 3060.0] | [17.0, 18.0] | [170, 170] |
p03000 | u162893962 | 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\ncount = 0\nfor idx in range(N):\n while count <= X:\n count += nums[idx]\n\nif count == X:\n print(idx + 2)\n\nelse:\n print(idx + 1)', 'N, X = map(int, input().split())\nnums = [int(i) for i in input().split()]\n\n\ncount =... | ['Wrong Answer', 'Accepted'] | ['s716414752', 's830175926'] | [2940.0, 3060.0] | [17.0, 17.0] | [215, 210] |
p03000 | u163874353 | 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 i in l:\n if d <= x:\n d += i\n cnt+= 1\n \n else:\n cnt -= 1\n print(cnt)\n \nprint(cnt)\n ', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0\ncnt = 0\nf... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s605107071', 's966675225', 's806663521'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 18.0] | [212, 222, 158] |
p03000 | u164957173 | 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\nc = 1\np = 0\nfor n in range(N):\n p += L[n]\n c += 1\n if p >= X:\n break\nprint(c)', 'N, X = map(int, input().split())\n\nL = list(map(int, input().split()))\n\nc = 1\np = 0\nfor l in L:\n p += l\n if p > X:\n break\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s499849002', 's111810851'] | [2940.0, 2940.0] | [18.0, 17.0] | [154, 153] |
p03000 | u167908302 | 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()))\n\nd = [0]\n\n\nfor i in range(1, n):\n tmp = d[i-1] + l[i-1]\n d.append(tmp)\n\nprint(d)\n\n\ncounter = 0\n\nfor i in range(len(d)):\n if d[i] <= x:\n counter += 1\n else:\n break\n\nprint(counter)\n', '#co... | ['Wrong Answer', 'Accepted'] | ['s176538961', 's081630153'] | [3060.0, 3060.0] | [18.0, 17.0] | [320, 325] |
p03000 | u169678167 | 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\nN,X = map(int,input().split())\n\nli = list(map(int,input().split()))\t\n\n\nres = 0\ni = 0\nans = 1\nfor i in range(N):\n res += li[i]\n ans += 1\n if res > X:\n ans -= 1\n break\n \nprint(res)\nprint(min(ans,N+1))\n ', 'import sys\ninput = sys.std... | ['Wrong Answer', 'Accepted'] | ['s679621746', 's360878906'] | [3064.0, 3060.0] | [17.0, 18.0] | [267, 251] |
p03000 | u173178698 | 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)\nans = 0\nfor i in range(1,N+1):\n D[i] = D[i-1] + L[i-1]\n ans += 1 \n \nprint(ans)', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\nD = [0]*(N+1)\nans = 1\nfor i in range(1,N+1):\n D[i] = D[i-1] + L[... | ['Wrong Answer', 'Accepted'] | ['s917491504', 's607646481'] | [3060.0, 3060.0] | [18.0, 17.0] | [168, 182] |
p03000 | u173243396 | 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\nfor i in range(n):\n d+=l[i]\n if d>x:\n print(i)\n break', 'n,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\nd=0\nfor i in range(n):\n d+=l[i]\n if d>x:\n print(i+1)\n break\nprint(n+1)', 'n,x=list(map(int... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s324845232', 's877873345', 's857172307'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [133, 146, 155] |
p03000 | u175746978 | 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 = 1\nd = 0\nfor i in range(n):\n d += l[i]\n if d == x:\n cnt += 1\n break\n elif d > x:\n break\n\nprint(cnt)', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\ncnt = 1\nd = 0\nfor i in ran... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s070756187', 's661557100', 's870012273', 's355188468'] | [3060.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 19.0, 17.0] | [203, 202, 167, 168] |
p03000 | u181367828 | 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_array = [int(i) for i in input().split()]\n\ncounter = 0\ncoordinate = 0\n\nwhile counter < n+1 and coordinate<=x:\n counter+=1\n if counter = n+1:\n break\n else:\n coordinate += l_array[counter-1]\n\n\nprint(counter)\n', 'n, x = (int(i) for i in inp... | ['Runtime Error', 'Accepted'] | ['s089565770', 's169566525'] | [2940.0, 2940.0] | [17.0, 17.0] | [272, 273] |
p03000 | u183256664 | 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 re\nimport numpy as np\n\nN, X = [int(i) for i in re.split(" ", input())]\nLs = [int(i) for i in re.split(" ", input())]\nDs = np.cumsum(Ls)\ncounts = np.sum(Ls <= X) + 1\nprint(counts)', 'import re\nimport numpy as np\n \nN, X = [int(i) for i in re.split(" ", input())]\nLs = [int(i) for i in re.split(" ", inp... | ['Runtime Error', 'Accepted'] | ['s588050381', 's291664603'] | [12504.0, 12504.0] | [153.0, 152.0] | [185, 186] |
p03000 | u185802209 | 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, d = 0, 0\nwhile i<n and d < x:\n d += l[i]\n i += 1\nprint(n)', 'n, x = map(int,input().split())\nl = list(map(int,input().split()))\nif sum(l) <= x:\n print(n+1)\nelse:\n i, d = 0, 0\n while i<n and d <= x:\n d += l[i]\n ... | ['Wrong Answer', 'Accepted'] | ['s882360949', 's401480228'] | [9096.0, 9132.0] | [28.0, 28.0] | [133, 250] |
p03000 | u188244611 | 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? | ["#ABC 130, B - bounding\nn, x = map(int, input().split(' '))\n\nL = [int(el) for el in input().split(' ')]\n\nD = []\nfor i in range(n):\n if i == 0:\n d = 0\n else:\n d = D[i-1] + L[i-1]\n D.append(d)\nprint(D)\n\nE = [i for i in D if i <= x]\nprint(len(E))\n", "# ABC130, B - bounding\nn, x = m... | ['Wrong Answer', 'Accepted'] | ['s170960176', 's168201452'] | [3060.0, 2940.0] | [17.0, 17.0] | [266, 223] |
p03000 | u188827677 | 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\ns = 1\nd = 0\nfor i in range(n):\n d += l[i]\n s += 1\n if d > x:\n break\nprint(s)', 'n,x = map(int, input().split())\nl = list(map(int, input().split()))\n\ns = 0\nd = 0\nfor i in range(n):\n d += l[i]\n s += 1\n if t > x:\n break\n... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s179160955', 's321703231', 's749098851', 's953086340'] | [2940.0, 2940.0, 2940.0, 9016.0] | [17.0, 17.0, 17.0, 27.0] | [151, 151, 151, 155] |
p03000 | u197038614 | 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()))\nal = [0]*(n+1)\n\nfor i in range(0, n):\n al[i+1] = al[i] + l[i]\n if al[i+1] > x:\n break\nprint(len(al)-1)\n', 'n, x = map(int, input().split())\n\nl = list(map(int, input().split()))\nal = [0] * (n + 1)\n\ncount = 0\nfor i in ran... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s939166016', 's995017598', 's312105898'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [186, 250, 237] |
p03000 | u197427401 | 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(s) for s in input().split()]\nLs = [int(s) for s in input().split()]\nd, ans = 0, 0\nfor l in Ls:\n print(l, d)\n if d <= X:\n ans += 1 \n d += l\nprint(ans) \n', 'N, X = [int(s) for s in input().split()]\nLs = [int(s) for s in input().split()]\nd, ans = 0, 0\nfor l in Ls:\n if d <= X:\... | ['Wrong Answer', 'Accepted'] | ['s619173013', 's332014442'] | [3060.0, 2940.0] | [18.0, 17.0] | [179, 186] |
p03000 | u197968862 | 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\ncount = 1\nfor i in range(n):\n d += l[i]\n if d < x:\n count += 1\n elif d == x:\n print(count+1)\n quit()\n else:\n print(count)', 'n, x = map(int,input().split())\nl = list(map(int,input().split())... | ['Wrong Answer', 'Accepted'] | ['s073255420', 's600728317'] | [3060.0, 3060.0] | [17.0, 18.0] | [235, 209] |
p03000 | u200527996 | 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 = [i for i in L if i<X]\nfor j in tmp:\n ans += 1\nprint(ans)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nans = 0\ntmp = [i for i in L if i<X]\nfor j in tmp:\n ans += 1\nprint(ans)', 'N, X = map(int... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s284583130', 's872560831', 's424278620'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [142, 142, 180] |
p03000 | u202727309 | 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 cnt = 1\n a = 0\n\n for i in range(len(L)):\n a += L[i]\n if a <= X:\n cnt += 1\n print(cnt)', ' N, X = map(int, input().split())\n L = list(map(int, input().split()))\n cnt = 1\n a = 0\n\n... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s651041941', 's819937528', 's643678980'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [200, 200, 184] |
p03000 | u204616996 | 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()))\nx=0\nans=1\nfor l in L:\n x+=L\n if x>X:\n break\n ans+=1\nprint(ans)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nx=0\nans=1\nfor l in L:\n x+=l\n if x>X:\n break\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s851708173', 's527440945'] | [2940.0, 3060.0] | [17.0, 17.0] | [130, 130] |
p03000 | u208348294 | 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# N=4\n# X=9\n# L=[3,3,3]\n\na=0\ncount=1\nfor i in range(N):\n for j in range(i):\n a+=L[j]\n if(a<=X):\n count+=1\nprint(count)', 'N, X = map(int, input().split())\nL=[int(i) for i in input().split()] \n# N=4\n# X=9\n# L=[3,... | ['Wrong Answer', 'Accepted'] | ['s052952104', 's472215196'] | [3060.0, 3060.0] | [19.0, 17.0] | [208, 253] |
p03000 | u212328220 | 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()))\n\ncnt = 0\nnow = 0\nfor i in range(N):\n l = now + lst[i]\n cnt += 1\n if now > X:\n break\nprint(cnt)', 'N, X = map(int,input().split())\nlst = list(map(int,input().split()))\n\ncnt = 1\nnow = 0\nfor i in range(N):\n l = now + ... | ['Wrong Answer', 'Accepted'] | ['s911695668', 's432854957'] | [9108.0, 9180.0] | [28.0, 29.0] | [179, 213] |
p03000 | u213497190 | 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=[i for i in map(int,input().split())]\ncount=1\ntotal=0\nfor num in L:\n total+=num\n if total>X:\n print(count)\n break\n count+=1\nprint(count)\n ', 'N,X=map(int,input().split())\nL=[i for i in map(int,input().split())]\ncount=1\ntotal=0\nfor num in L:\n... | ['Wrong Answer', 'Accepted'] | ['s444943009', 's201794168'] | [2940.0, 2940.0] | [17.0, 19.0] | [199, 216] |
p03000 | u215329188 | 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\nS = 0\nfor i in range(N):\n if (S <= X):\n \tS += L[i]\n else:\n break\nprint(i+1)\n', 'N,X = map(int, input().split())\n*L, = list(map(int, input().split()))\n\nS = 0\ncount = 1\nfor i in range(N):\n S += L[i]\n if (X < S):\n break\... | ['Wrong Answer', 'Accepted'] | ['s040659750', 's217858186'] | [2940.0, 2940.0] | [17.0, 17.0] | [153, 168] |
p03000 | u216631280 | 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 = list(map(int, input().split()))\nans = 0\nfor i in range(len(li)):\n if(sum(li[:i+1]) <= x):\n ans += 1\nprint(ans)\n', 'n, x = map(int, input().split())\nli = list(map(int, input().split()))\nans = 1\nfor i in range(len(li)):\n if(sum(li[:i+1]) <= x):\n ans ... | ['Wrong Answer', 'Accepted'] | ['s088460558', 's684249250'] | [2940.0, 2940.0] | [17.0, 17.0] | [159, 159] |
p03000 | u219503971 | 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()]\nsum=0\nfor i in range(n):\n sum+=l[i]\n if sum>x:\n print(i)\n ', 'n,x=map(int,input().split())\nl=[int(x) for x in input().split()]\nsum=0\nfor i in range(n):\n sum+=l[i]\n if sum>x:\n print(i+1)\n break\nelse:\n print(n+1)'] | ['Wrong Answer', 'Accepted'] | ['s262209702', 's316256562'] | [2940.0, 3060.0] | [17.0, 18.0] | [131, 157] |
p03000 | u223555291 | 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())\nl=list(map(int,input().split()))\nc=1\nd=0\nfor i in range(a):\n d+=l[i]\n if d<=b:\n print(c)\n \n break\n c+=1\n\n', 'a,b=map(int,input().split())\nc=list(map(int,input().split()))\nd=0\ne=0\nf=1\nwhile 1:\n d+=c[e]\n e+=1\n f+=1\n if d>=b:\n print(f)\n break\n e... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s138984502', 's491870253', 's610655120', 's489139599'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 20.0, 18.0] | [146, 157, 146, 155] |
p03000 | u225577738 | 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 = map(int, input().split())\nl = [int(i) for i in input().split()] \n\nd = 0\ni = 0\nif x > 0:\n while d <= x:\n d = d + l[i]\n i = i + 1\n if i >= n:\n i = i + 1\n break\n print(i)\nelif x <= 0:\n print(1)', 'n, x = map(int, input().split())\nl = [int(i) for i ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s352690720', 's536288442', 's592413792', 's167686159'] | [2940.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 18.0] | [248, 209, 236, 281] |
p03000 | u227082700 | 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? | ['ans=0\nn,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\nfor i in l:\n d+=i\n if d<=x:ans+=1\nprint(ans)', 'ans=0\nn,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\nfor i in l:\n d+=i\n if d<=x:ans+=1\nprint(ans+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s359036101', 's754338657'] | [2940.0, 2940.0] | [17.0, 18.0] | [118, 121] |
p03000 | u228232845 | 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\n\ndef input(): return sys.stdin.readline().strip()\ndef I(): return int(input())\ndef LI(): return list(map(int, input().split()))\ndef IR(n): return [I() for i in range(n)]\ndef LIR(n): return [LI() for i in range(n)]\ndef SR(n): return [S() for i in range(n)]\ndef S(): return input()\ndef LS(): return... | ['Wrong Answer', 'Accepted'] | ['s641215566', 's677589062'] | [9000.0, 9100.0] | [29.0, 28.0] | [521, 523] |
p03000 | u230416699 | 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 = map(int, input().split())\n\ncount = 0\nposition = 0\nfor i in range(N):\n if X<position:\n break\n else:\n count += 1\n position += Ls[i]\n\nprint(count)', 'N, X = map(int, input().split())\nLs = list(map(int, input().split()))\n\ncount = 0\nposition ... | ['Runtime Error', 'Accepted'] | ['s930938649', 's150405946'] | [2940.0, 3060.0] | [17.0, 17.0] | [208, 260] |
p03000 | u237316771 | 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()]\nk = 0\nans = 1\nfor li in input().split():\n k += li\n ans += k <= x\n\nprint(ans)', 'n, x = [int(x) for x in input().split()]\nk = 0\nans = 1\nfor li in input().split():\n k += int(li)\n ans += k <= x\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s940616898', 's358633569'] | [3064.0, 2940.0] | [18.0, 18.0] | [123, 129] |
p03000 | u237493274 | 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\n\nfor i in range(1,n+1):\n if sum(l[:i-1]) <= x:\n cnt += 1\n print(sum(l[:i-1]))\nprint(cnt)', 'n,x = map(int, input().split())\nl = list(map(int, input().split()))\ncnt = 1\n\nfor i in range(2,n+2):\n if sum(l[:i-1]) <= x:\n c... | ['Wrong Answer', 'Accepted'] | ['s388917426', 's547531167'] | [3060.0, 2940.0] | [17.0, 17.0] | [171, 152] |
p03000 | u243312682 | 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 main():\n n, x = map(int, input().split())\n l = list(map(int, input().split()))\n sum = 0\n for idx, i in enumerate(l):\n sum += i\n if sum > x:\n print(idx + 1)\n break\n else:\n print(n + 1)\n\nif __name__ == '__main__':\n main()", "def main(... | ['Wrong Answer', 'Accepted'] | ['s521317160', 's079613819'] | [3060.0, 3064.0] | [18.0, 17.0] | [292, 284] |
p03000 | u244836567 | 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()\na=int(a)\nb=int(b)\nc=list(map(int,input().split()))\nd=0\ne=0\nfor i in range(a):\n while d<b:\n d=d+c[i]\n e=e+1\n print(e+1)\n break', 'a,b=input().split()\na=int(a)\nb=int(b)\nc=list(map(int,input().split()))\nd=0\nfor i in range(a):\n while d<b:\n d=d+b[i]\n print(d)\n break',... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s158027024', 's313469596', 's673580094', 's169197510'] | [9168.0, 9084.0, 9164.0, 9188.0] | [26.0, 26.0, 28.0, 28.0] | [154, 138, 152, 165] |
p03000 | u248670151 | 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()))\nb=list(map(int,input().split()))\nno=0\nfor i in range(0,a[0]):\n if b[i]<=a[1]:\n no+=1 \nprint(no) ', 'a=list(map(int,input().split()))\nb=list(map(int,input().split()))\nno=1\nfor i in range(1,a[0]):\n b[i]+=b[i-1]\nfor i in range(0,a[0]):\n if(a[1]>=b[i]):\... | ['Wrong Answer', 'Accepted'] | ['s669972910', 's674232193'] | [9108.0, 9000.0] | [29.0, 25.0] | [146, 211] |
p03000 | u248670337 | 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(_) for _ in input().split())\nL = list(map(int, input().split()))\nD = 0\nans = 1\nwhile (D < X or ans < N):\n D += L[ans - 1]\n ans += 1\n print(D, ans)\nif D == X:\n print(ans)\nelse:\n print(ans - 1)', 'N, X = (int(_) for _ in input().split())\nL = list(map(int, input().split()))\nD = [0... | ['Runtime Error', 'Accepted'] | ['s052740705', 's548851598'] | [3060.0, 3064.0] | [17.0, 17.0] | [218, 228] |
p03000 | u250102437 | 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\n\nfrom sys import stdin\n\n############################################\n\n# read data for n sequences.\ntemp = stdin.readline().split()\nN = int(temp[0])\nX = int(temp[1])\n\ndata = []\nwrite = stdin.readline().split()\nfor i in range(N):\n data.append(int(write[i]))\n \ncount = 0\nd... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s513473215', 's625087447', 's214748271'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [413, 433, 428] |
p03000 | u251075661 | 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\nd = 0\nfor i, l in enumerate(input().split()):\n d += int(l)\n if d > x:\n print(i)\n break\nelse:\n prin(n)', 'n, x = map(int, input().split())\n\nd = 0\nfor i, l in enumerate(input().split()):\n d += int(l)\n if d > x:\n print(i + 1)\n break\nelse:\n print(n + 1... | ['Runtime Error', 'Accepted'] | ['s410748945', 's831820901'] | [2940.0, 2940.0] | [17.0, 17.0] | [144, 153] |
p03000 | u252964975 | 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\ncount = 0\n\n跳ねる直前からスタート\n\nfor i in range(1, N+2):\n if d <= X:\n count = count + 1\n d = d + L[i-1]\n\nprint(count)', 'N,X=map(int, input().split())\nL=list(map(int, input().split()))\ndistance = 0\ncount = 0\nwhile distance <= X and ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s822666735', 's850029556', 's831927778'] | [3192.0, 3060.0, 3060.0] | [19.0, 18.0, 17.0] | [208, 192, 222] |
p03000 | u256990135 | 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? | ["_input1 = input()\n_input2 = input()\nN, X = tuple([int(a) for a in _input1.split(' ')])\nl_list = [int(a) for a in _input2.split(' ')]\n\nlength = 0\ncnt = 0\n\nfor l in l_list:\n if length > X:\n break\n length += l\n cnt += 1\n\nif length > X:\n cnt += 1\n\nprint(cnt)\n", "_input1 = input()\n_in... | ['Wrong Answer', 'Accepted'] | ['s118972455', 's871689734'] | [3060.0, 3060.0] | [17.0, 17.0] | [274, 275] |
p03000 | u263734237 | 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())\n\ncnt=1\nlength=0\nfor i in range(n):\n length +=l[i]\n if length <=x:\n cnt+=1\n\nprint (cnt)', 'n,x = map(int, input().split())\nl = map(int, input().split())\n\ncnt=1\nlength=0\nfor i in range(n):\n length +=l[i]\n if length <=x:\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s180625129', 's470785628', 's620161356', 's502747177'] | [3060.0, 2940.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [186, 186, 186, 192] |
p03000 | u264989012 | 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? | ['s = list(map(int,input().split()))\nN = s[0]\nX = s[1]\nL = list(map(int,input().split()))\na = 0\nd = 0\nwhile d =< X:\n d += L[a]\n a += 1 \nprint(a)\n ', 's = list(map(int,input().split()))\nN = s[0]\nX = s[1]\nL = list(map(int,input().split()))\na = 0\nd = 0\nwhile d <= X:\n if a >= N+1:\n a = N\n break... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s682017606', 's758974189', 's948556821', 's177050961'] | [3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [147, 185, 170, 195] |
p03000 | u267823741 | 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 = []\ncount = 1\nD.append(0)\nfor i in range(N):\n D.append(D[-1]+L[i])\n print(D[-1])\n if D[-1] <= X:\n count += 1\nprint(count)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 0\ncount = 1\nfor i ... | ['Wrong Answer', 'Accepted'] | ['s844376132', 's779010506'] | [3060.0, 2940.0] | [17.0, 17.0] | [209, 186] |
p03000 | u269318751 | 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()]\nLs = [int(l) for l in input().split()]\nd = 0\nres = 0\nfor i, Li in enumerate(Ls):\n print("i=", i+1, "Li=", Li, "d=", d)\n if d <= X and i < N:\n res += 1\n d += Li\n else:\n break\nprint(res)', 'N, X = [int(i) for i in input().split()]\nLs = [... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s329430349', 's369628340', 's905400557', 's986830486', 's808158828'] | [3064.0, 3060.0, 2940.0, 3060.0, 3060.0] | [17.0, 19.0, 18.0, 17.0, 19.0] | [255, 214, 185, 193, 185] |
p03000 | u276250981 | 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())\ns = list(map(int,input().split()))\nc = 1\nl = 0\nfor i in range(n):\n l+=s[i]\n if l>x:\n print(c)\n break\n c+=1\n if l==x:\n print(c)\n break\nprint(c)', 'n,x = map(int,input().split())\ns = list(map(int,input().split()))\nc = 1\nl = 0\nfor i in range(n):\n l+=s[i]\... | ['Wrong Answer', 'Accepted'] | ['s331927702', 's691008299'] | [2940.0, 3060.0] | [17.0, 18.0] | [189, 191] |
p03000 | u276686572 | 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? | ['arr1 = input().split()\nn,x = int(arr1[0]),int(arr1[1])\n\narr2 = input().split()\n\nd = 0\ncount = 1\nfor i in range(1, n + 1):\n d += int(arr2[i-1])\n if d <= x:\n count +=1\n print(d)\n \nprint(count)\n ', 'arr1 = input().split()\nn,x = int(arr1[0]),int(arr1[1])\n\narr2 = input().split()\n\nd = 0\ncount ... | ['Wrong Answer', 'Accepted'] | ['s196304222', 's859033782'] | [9100.0, 9048.0] | [27.0, 30.0] | [202, 191] |
p03000 | u278670845 | 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,n = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0\nfor i, di in enumerate(l):\n d += di\n if x<d:\n print(i)', 'import sys\nn,x = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0\nfor i, di in enumerate(l):\n d += di\n if x<d:\n print(i+1)\n sys.... | ['Wrong Answer', 'Accepted'] | ['s946098620', 's548004259'] | [3060.0, 3060.0] | [18.0, 20.0] | [133, 185] |
p03000 | u280739688 | 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()))\nval = 0\ncount = 0\n\nfor l in L:\n val += l\n if val <= x:\n count += 1\nprint(count)', 'n, x = map(int, input().split())\nL = list(map(int, input().split()))\nval = 0\ncount = 1\n\nfor l in L:\n val += l\n if val <= x:\n ... | ['Wrong Answer', 'Accepted'] | ['s829375627', 's717761310'] | [9064.0, 9180.0] | [29.0, 30.0] | [161, 161] |
p03000 | u282707041 | 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\nsummy=1\nfor i in l:\n s=int(i)+s\n print(s)\n if x>=int(s):\n summy+=1\nprint(summy)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\ns=0\nsummy=1\nfor i in l:\n s=int(i)+s\n if x>=int(s):\n summy+=1\n... | ['Wrong Answer', 'Accepted'] | ['s841580131', 's670328808'] | [3060.0, 2940.0] | [17.0, 17.0] | [161, 148] |
p03000 | u283520984 | 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\ni=0\nwhile(D<=X):\n D=D+L[i]\n i=i+1\nprint(i+1)', 'N,X = (int(i) for i in input().split()) \nL = [int(i) for i in input().split()] \nD=0\ni=0\nwhile(D<=X):\n D=D+L[i]\n i=i+1\nif X=0:\n print(1)\nelse:\n print(i)', 'N, X = m... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s246623068', 's876225332', 's503703557'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [130, 155, 173] |
p03000 | u294385082 | 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 = 1\nD = 0\nli = []\nfor i in range(1,n+1):\n D = D + l[i]\n if D <= x:\n c += 1\n li.append(D)\nif max(li) > x:\n print(n+1)\nelse:\n print(c)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nc = 1\nD = 0\nli = []\nfo... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s059363968', 's255004751', 's318313874', 's829523151', 's849906990', 's588390095'] | [3064.0, 3060.0, 3064.0, 2940.0, 3064.0, 3060.0] | [18.0, 18.0, 18.0, 17.0, 17.0, 18.0] | [208, 156, 152, 166, 223, 158] |
p03000 | u294721290 | 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)\no=True\nfor i in range(n):\n D[i+1]=D[i]+L[i]\nfor i in range(len(D)):\n if D[i]>x:\n print(i)\n o=False\n break\nif o:\n print(n+1)', 'n,x=map(int,input().split())\nL=list(map(int,input().split()))\nD=[0]*(n+1)... | ['Runtime Error', 'Accepted'] | ['s015381782', 's213891689'] | [3064.0, 3064.0] | [17.0, 17.0] | [227, 227] |
p03000 | u297046168 | 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())\nL = list(map(int, input().split()))\nx = int(X)\nn = int(N)\nposition = 0\ncount = 0\nwhile position <= x:\n position += L[count]\n count += 1\nif n+1 < count:\n print(count)\nelse:\n print(n+1)', 'n, x = list(map(int, input().split()))\nli = list(map(int, input().split()))\n\nans... | ['Runtime Error', 'Accepted'] | ['s803975167', 's406905657'] | [3064.0, 2940.0] | [17.0, 17.0] | [219, 166] |
p03000 | u302292660 | 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\nbnd = 1\nfor i in range(n):\n if d > x:\n exit()\n else:\n d += l[i]\n bnd += 1\n\nprint(bnd-1)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nd = 0\nbnd = 1\nfor i in range(n):\n if d > x:\n exit()\n el... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s265456707', 's382335160', 's582617039', 's657139569', 's770500567', 's771253662', 's393008780'] | [3060.0, 2940.0, 3060.0, 2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 18.0] | [170, 167, 166, 170, 183, 168, 177] |
p03000 | u304209389 | 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())\n\nlength = list(map(int, input().split()))\n\n\ncount_total = 0\n\nnow = 0\n \nfor count in range(N):\n \n\twhile now <= X:\n\t\tnow = now + length[count]\n\t\tcount_total = count_total + 1\n \nprint(count_total)\n ', '\nN, X = map(int, input().split())\n\nlength = list(map(int... | ['Wrong Answer', 'Accepted'] | ['s017096167', 's606265870'] | [2940.0, 2940.0] | [17.0, 17.0] | [401, 402] |
p03000 | u310381103 | 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()))\nsum=0\nT=True\nfor i in range(N):\n sum+=L[i]\n if sum>X:\n break\n T=False\nif T:\n print(i+1)\nelse:\n print(i+2)', 'N,X=list(map(int,input().split()))\nL=list(map(int,input().split()))\nsum=0\nT=False\nfor i in range(N):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s143725948', 's735316924', 's930179687', 's260994802'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0] | [195, 195, 199, 199] |
p03000 | u313498252 | 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 = input().split()\nfor i in range(n):\n l[i] = int(l[i])\n\ncnt = 1\nsum = 0\nfor i in range(n):\n if sum > x:\n break\n sum += l[i]\n cnt += 1\n \nprint(cnt)\n', 'n, x = map(int, input().split())\nl = input().split()\nfor i in range(n):\n l[i] = int(l[i])\... | ['Wrong Answer', 'Accepted'] | ['s510111756', 's334489485'] | [9068.0, 9176.0] | [27.0, 29.0] | [204, 204] |
p03000 | u315354220 | 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_list = [0]\n\nfor i in range(1, N + 1):\n D_list.append(D_list[i - 1] + L_list[i - 1])\n\nfor i in range(N):\n if X < D_list[i]:\n print(i)\n elif X == D_list[i]:\n print(i + 1)\n else:\n print(0)\n\n', 'N, ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s357201630', 's571190851', 's603123092'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0] | [296, 294, 315] |
p03000 | u315703650 | 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]\nfor _ in range(n):\n l.append(int(input()))\ncnt=0\nsum=0\nfor i in range(n):\n sum+=l[i]\n if sum<=x:\n cnt+=1\nprint(cnt)', 'n,x = map(int,input().split())\nl=list(map(int,input().split()))\ncnt=1\nsuml=0\nfor i in range(n):\n suml+=l[i]\n if suml<=x:\n cnt+=1\nprin... | ['Runtime Error', 'Accepted'] | ['s590697529', 's182299512'] | [3060.0, 2940.0] | [17.0, 17.0] | [158, 144] |
p03000 | u316240682 | 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\nbound = [0]\nfor i in range(N):\n bound += [L[i] + bound[-1]]\n print(bound)\n\nprint(bound)\n\ncounter = 0\nfor i in bound:\n if i <= X:\n counter += 1\n else:\n break\nprint(counter)', 'N, X = map(int, input().split()... | ['Wrong Answer', 'Accepted'] | ['s683997372', 's129611387'] | [3064.0, 3060.0] | [18.0, 17.0] | [267, 237] |
p03000 | u317710033 | 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())\nnum = input().split()\ncnt = 1\ncal = 0\nfor range in (N):\n cal += int(num[N])\n if cal <= X:\n cnt +=1\n else:\n break\nprint(cnt)\n', 'N, X = map(int, input().split())\nnum = input().split()\ncnt = 1\ncal = 0\nfor x in range (N):\n cal += int(num[x])\n if cal <= X:\n ... | ['Runtime Error', 'Accepted'] | ['s561349538', 's147425471'] | [2940.0, 2940.0] | [17.0, 19.0] | [166, 168] |
p03000 | u327162583 | 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()] \nresult = 0\nD = 0\nfor i in range(N + 1):\n if D <= X:\n result += 1\n if i != N:\n D += L[i]\nprint(result)', 'N,x = (int(i) for i in input().split())\nL = [int(i) for i in input().split()] \nresult = 0\nD = 0\nfor i... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s330523273', 's761871101', 's895001042'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [200, 181, 200] |
p03000 | u328755070 | 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\nza = 0\n\n\nfor count in range(N):\n za += l[count]\n if za > X:\n break\n\nprint(count+1)', 'N, X = list(map(int, input().split()))\nL = list(map(int, input().split()))\n\nza = 0\n\n\nfor count in range(N):\n za += L[count]\n if za... | ['Runtime Error', 'Accepted'] | ['s465126236', 's751407357'] | [2940.0, 3060.0] | [17.0, 17.0] | [163, 185] |
p03000 | u329731898 | 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=list(map(int,input().split()))\nD=0\ncount=0\nfor i in range(N):\n D=D+L[i]\n if D<=X:\n count+=1\nprint(count)', 'N,X=(int(x) for x in input().split())\nL=list(map(int,input().split()))\nD=0\ncount=1\nfor i in range(N):\n D=D+L[i]\n if D<=X:\n count+... | ['Wrong Answer', 'Accepted'] | ['s660220167', 's558973953'] | [3060.0, 3060.0] | [17.0, 17.0] | [157, 157] |
p03000 | u331381193 | 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()] for i in range(n)]\n\ndis = 0\n\nfor i in range(n):\n dis += l[i]\n if dis > x:\n print(i + 1)\n break\n ', 'n, x = (int(i) for i in input().split())\n\n#print(n)\n#print(x)\n\nl = [int(i) for i in input().split()]\n\n#print(l... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s547303316', 's684646818', 's948048800', 's592765077'] | [3064.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0] | [187, 201, 205, 195] |
p03000 | u331997680 | 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 if D<= X:\n D += L[i]\n cnt += 1\n else:\n break\nprint(cnt)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 0\ncnt = 1\nfor i in range(N):\n D += L[i]\n if D<= X:\n ... | ['Wrong Answer', 'Accepted'] | ['s307488542', 's117369270'] | [3064.0, 3060.0] | [17.0, 17.0] | [169, 167] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.