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 | u795323188 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['d_list = [0]\nN,X = map(int,input().split(" "))\nl_list = input().split()\n\ncount = 1\nd = 0\nfor i in range(N):\n d_a = d + int(l_list[i])\n d = d_a\n if d_a <= X:\n count +=1\n else:\n print(count)', 'N,X = map(int,input().split(" "))\nl_list = input().spli... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s026593746', 's603552107', 's948287895', 's776052996'] | [3060.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [246, 257, 278, 314] |
p03000 | u797848138 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nif n == 0:\n print(0)\n\nli = list(map(int,input().split()))\n\nif x == 0:\n print(1)\n\n\nelse:\n\n sum = 0\n v=0\n for i, l in enumerate(li):\n v = i\n if sum > x:\n break\n\n sum += l\n\n if v+1 == len(li):\n print(v+1)\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s011217686', 's271747495', 's643235811', 's719532558', 's900740983'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 18.0, 17.0] | [321, 387, 387, 294, 309] |
p03000 | u802341442 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 d.append(d[i]+l[i])\nans = 0\nfor i in range(n+1):\n if d[i] <= x:\n ans += 1\nprint(ans)', 'n, x = map(int, input().split())\nl =list(map(int, input().split()))\nd = [0]\nfor i in range(n):\n d.appen... | ['Runtime Error', 'Accepted'] | ['s672963671', 's336100629'] | [3060.0, 3060.0] | [17.0, 17.0] | [195, 193] |
p03000 | u802581810 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\ncnt = 1\nD = 0\nfor a in A:\n\tD += a\n if D > X:\n\t\tbreak\n cnt += 1\n\nprint(cnt)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nd=0\nk=0\nfor i in range(N):\n d+=L[i]\n if d<=X:\n k+=1\n else:break\nprint(k+1)'... | ['Runtime Error', 'Accepted'] | ['s491255271', 's073912502'] | [3188.0, 2940.0] | [18.0, 17.0] | [149, 142] |
p03000 | u809457879 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nl1=list(map(int,input().split()))\nl2=[0]\nfor i in range(len(l1)):\n l2.append(l2[i]+l1[i])\nans=0\ni=0\nprint(l2)\nwhile i<len(l2):\n if l2[i]<=x:\n ans+=1\n i+=1\nprint(ans)', 'n,x =map(int,input().split())\nl1=list(map(int,input().split()))\nl2=[0]\nfor i in range(n):\n l2.ap... | ['Wrong Answer', 'Accepted'] | ['s887024821', 's985045047'] | [3064.0, 3064.0] | [17.0, 17.0] | [201, 185] |
p03000 | u812576525 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ["mport sys\n\ndef main():\n N, X = map(int, input().split())\n A = list(map(int, input().split()))\n cnt = 1\n D = 0\n for a in A:\n D += a\n if D > X:\n break\n cnt += 1\n\n return cnt\n\nif __name__ == '__main__':\n print(main())", 'N, X = map(int, input().split()... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s199130068', 's380389747', 's143898981'] | [2940.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [267, 214, 200] |
p03000 | u814986259 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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]*(N-1)\n\nD[0]=0\ncount=1\nfor i in range(1,N):\n D[i]=D[i-1]+L[i-1]\n if D[i]<=X:\n count+=1\n else:\n break\nprint(count)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\n\nD=[0]*(N+1)\n\nD[0]=0\ncount=1\nfor i in rang... | ['Runtime Error', 'Accepted'] | ['s277840984', 's317801442'] | [3064.0, 3060.0] | [17.0, 18.0] | [190, 193] |
p03000 | u815878613 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nimport numpy as np\n\nN, X = list(map(int, input().split()))\n\nL = np.array(list(map(int, input().split())))\n\nx = np.zeros(N+1)\n\nfor n in range(1,N+1):\n x[n] = x[n-1] + L[n-1]\n print(x)\n if x[n] > X:\n print(n)\n sys.exit()\n\nprint(N)', 'N, X = map(int, input().split())\nL... | ['Wrong Answer', 'Accepted'] | ['s996907705', 's698553150'] | [18752.0, 2940.0] | [386.0, 17.0] | [263, 187] |
p03000 | u818349438 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X = map(int,input().split())\nD = 0\nans = 1\nfor i in range(N):\n if D <=X:\n D+=int(input())\n ans+=1\n else:\n A =input())\n continue\nif D >X:\n ans-=1\nprint(ans)', 'N,X = map(int,input().split())\nD = 0\nans = 1\nfor i in range(N):\n if D <=X:\n D+=int(input())\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s056324511', 's130220512', 's170104907', 's313458170', 's318197426', 's516318912', 's588596912', 's754740268', 's354173091'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [194, 201, 174, 189, 202, 122, 193, 127, 213] |
p03000 | u821179412 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nif n != 1:\n l = list(map(int,input().split()))\n i = 0\n cnt = 0\n ans = 0\n while cnt <= x :\n ans += 1\n cnt += l[i]\n i += 1\n if i == n-1:\n print(n+1)\n exit()\n print(ans)\nelse:\n l = int(input())\n if l <= x:\n print(2)\n else:\n print(1)',... | ['Wrong Answer', 'Accepted'] | ['s159754089', 's535181496'] | [3064.0, 3064.0] | [17.0, 17.0] | [297, 295] |
p03000 | u821588465 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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]*(N+1)\nfor i in range(1,N+1):\n List[i] = List[i-1] + L[i-1]\nprint(List)\nimport bisect \n\n# print(len(A))\nprint(bisect.bisect_left(List,X+1))\n', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\nList = [0]*(N+1)... | ['Wrong Answer', 'Accepted'] | ['s006663224', 's335964063'] | [9056.0, 9148.0] | [30.0, 30.0] | [252, 240] |
p03000 | u821712904 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()]\na=0\nans=0\nfor i in l:\n if a+i>x:\n print(ans+1)\n exit()\n ans+=1\n a+=i\nprint(ans)', 'n,x=map(int,input().split())\nl=[int(i) for i in input().split()]\nd=0\nans=0\nfor i in l:\n if d+i>x:\n print(ans+1)\n exit()\n ans+=1\n d+=i\... | ['Runtime Error', 'Accepted'] | ['s224045984', 's060166851'] | [2940.0, 3060.0] | [17.0, 19.0] | [152, 156] |
p03000 | u825378567 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nfor i in range(N):\n sum+=L[i]\n count=i\n if sum>X:\n print(i+1)\n break\nprint(count+2)\n', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nsum=0\nfor i in range(N):\n sum+=L[i]\n count=i\n if sum>X:\n break\nif s... | ['Wrong Answer', 'Accepted'] | ['s353551804', 's158669379'] | [3064.0, 2940.0] | [17.0, 17.0] | [161, 181] |
p03000 | u825440127 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 = 1\np = 0\nfor l in L:\n if p <= x:\n p += l\n count += 1\nprint(count)\n', 'n, x = map(int, input().split())\nL = list(map(int, input().split()))\n\ncount = 0\np = 0\nfor l in L:\n if count <= x:\n p += l\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s062660617', 's066368675', 's994785059'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [160, 164, 186] |
p03000 | u833738197 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\n\ncnt = 1\ndis = 0\nfor i in range(n):\n dis = dis + int(L[i])\n print(dis)\n if dis <= x :\n cnt +=1\n\nprint(cnt)', 'n , x = map(int , input().split())\nL = (input().split())\n\ncnt = 1\ndis = 0\nfor i in range(n):\n dis = dis + int... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s522507769', 's840340543', 's150232004'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0] | [184, 184, 171] |
p03000 | u837501838 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nD = 0\n\nfor i in range(N):\n D += L[i]\n if D >= X+1:\n break\n count += 1\n i += 1\n\nprint(count)\n ', 'N,X = map(int, input().split())\nL = list(map(int, input().split()))\ncount = 0\nD = 0\n\nfor i in range(N):\n D += L[i]\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s427020364', 's607274331', 's262722906'] | [9152.0, 9148.0, 9080.0] | [30.0, 24.0, 27.0] | [179, 178, 175] |
p03000 | u839270538 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = input().split()\nn, x = int(n), int(x)\narr = [int(x) for x in input().split()]\n\npf = [arr[0] for i in range(n)]\n\nfor i in range(1, n):\n pf[i] = pf[i-1] + arr[i]\n\nc = 0\nfor i in pf:\n c += (i <= x)\n\nprint(c)', 'n, x = input().split()\nn, x = int(n), int(x)\narr = [int(x) for x in input().split(... | ['Wrong Answer', 'Accepted'] | ['s586391503', 's930942669'] | [3060.0, 3064.0] | [17.0, 17.0] | [217, 219] |
p03000 | u840958781 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int,input().split())\nl = list(map(int,input().split()))\ni=0\nsuml=0\nif sum(l)<=x:\n print(len(l))\nelse:\n while suml<=x:\n suml=suml+l[i]\n i=i+1\n if suml>=x:\n print(i-1)\n else:\n print(i)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\ni... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s101306575', 's714414367', 's920564981', 's575293262'] | [3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 17.0, 17.0, 18.0] | [232, 188, 186, 186] |
p03000 | u841793789 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nresult=1\nfor n in range(1,N):\n if X<=(D):\n break\n else:\n result+=1\n D=D+L[n-1]\nprint(result)', 'N,X=map(int,input().split())\nL = list(map(int, input().split()))\nl=0\nresult=1\nfor n in L:\n l+=n\n if l<=X... | ['Wrong Answer', 'Accepted'] | ['s037559585', 's772364464'] | [3060.0, 2940.0] | [17.0, 17.0] | [188, 143] |
p03000 | u842388336 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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=1\ndist=0\n\nfor l in L:\n cnt+=1\n dist+=l\n if dist>=X:\n break\n \nprint(cnt)\n ', 'N,X = map(int,input().split())\nL = list(map(input().split()))\n\ncnt=1\ndist=0\n\nfor l in L:\n cnt+=1\n dist+=l\n if dist>=X:\n break\n ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s164318912', 's514204470', 's913192750', 's094949916'] | [2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [154, 150, 149, 153] |
p03000 | u843318346 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\ncount = 1\nkyori\nfor i in li:\n kyori = kyori + i\n count += 1\n if kyori > x:\n break\nprint(count-1)', 'n,x = map(int,input().split())\nli = list(map(int,input().split()))\ncount = 1\nkyori = 0\nfor i in li:\n kyori = kyori + i\n count +=... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s261022360', 's262813820', 's906076364'] | [3064.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [169, 185, 186] |
p03000 | u844123804 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['limit = input().split()\nhane = input().split()\nhane = [int(i) for i in hane]\n\ntmp = 0\nans = 0\nfor i in hane:\n tmp += i\n if tmp<=int(limit[1]): ans +=1\n else: break\n \nprint(ans)', 'limit = input().split()\nhane = input().split()\nhane = [int(i) for i in hane]\n\ntmp = 0\nans = 0\nfor i in hane:\n tmp... | ['Wrong Answer', 'Accepted'] | ['s479313779', 's304975375'] | [3060.0, 3060.0] | [17.0, 17.0] | [182, 184] |
p03000 | u845442154 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 L:\n \tc = c + 1\n D = D + i\n if D > x:\n print(c)\n exit()\nif D > x:\n print(c)\nelse:\n print(c+1)\n', 'n,x=map(int,input().split())\nL = list(map(int, input().split()))\nc = 1\nD = 0\nfor i in L:\t\n ... | ['Runtime Error', 'Accepted'] | ['s612664269', 's518095707'] | [3064.0, 2940.0] | [17.0, 17.0] | [202, 174] |
p03000 | u847605090 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nans=0\noh=0\nl=[int(i) for i in input().split()]\nl[0]=0\nfor j in l:\n if x>=oh:\n ans+=1\n oh+=j\nprint(ans)\n ', ',x=map(int,input().split())\nans=0\noh=0\nl=[int(i) for i in input().split()]\nfor j in l:\n if sum(l)<=x:\n if x>=oh:\n ans+=1\n elif x>=oh:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s389764322', 's991906907', 's663543109'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [139, 224, 172] |
p03000 | u850200768 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nl =list(map(int, input().split()))\n\nd=[0]\nfor v in l:\n d.append(d[-1]+v)\n\nprint(len([_ for v in d if v <= X]))', 'N, X = map(int, input().split())\nl =list(map(int, input().split()))\n\nd=[0]\nfor v in l:\n d.append(d[-1]+v)\n\nprint(len([v for v in d if v <= X]))'] | ['Runtime Error', 'Accepted'] | ['s329311919', 's744562950'] | [3056.0, 2940.0] | [18.0, 17.0] | [146, 146] |
p03000 | u853185302 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nfor i in range(n-1): l[i+1] += l[i]\nans = 1\nprint(l)\nfor i in range(n):\n if l[i] <= x: ans += 1\nprint(ans)\n ', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nfor i in range(n-1): l[i+1] += l[i]\nans = 1\nfor i in range... | ['Wrong Answer', 'Accepted'] | ['s504969711', 's571142997'] | [3060.0, 3064.0] | [17.0, 18.0] | [178, 169] |
p03000 | u855781168 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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_1 = input().split()\nn = int(inp_1[0])\nx = int(inp_1[1])\nl_in = input().split()\n\ncount = 0\nd = 0\nfor i in range(n):\n if d + int(l_in[i]) <= x:\n count = count+1\n\nprint(count)\n\n\n', 'inp_1 = input().split()\nn = int(inp_1[0])\nx = int(inp_1[1])\nl_in = input().split()\n\ncount = 1 \nd = 0\nfor... | ['Wrong Answer', 'Accepted'] | ['s489099300', 's675859683'] | [3060.0, 3060.0] | [17.0, 17.0] | [189, 249] |
p03000 | u857330600 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=[0]\nfor i in range(n):\n d.append(d[-1]+l[i])\n if d[-1]>x:\n print(len(d)-1)\n break\n if i==n-1:\n print(n+1)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=[0]\nfor i in range(n):\n d.append(d[-1]+l[i])\n if d[-... | ['Runtime Error', 'Accepted'] | ['s965747692', 's171248239'] | [2940.0, 3060.0] | [18.0, 17.0] | [182, 181] |
p03000 | u857408368 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 = list([map(int, input().split())] for _ in range(N))\n# List = [list(map(int, input().split())) for _ in range(N)]\nList = list(map(int, input().split()))\nprint(List)\n\nans = 1\nsum_x = 0\nfor i in range(N):\n if(sum_x + List[i] <= X):\n # print(List[i])\n ... | ['Wrong Answer', 'Accepted'] | ['s918456618', 's795435954'] | [3060.0, 2940.0] | [17.0, 17.0] | [368, 395] |
p03000 | u859773831 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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(' ')]\narr=[int(x) for x in input().split(' ')]\ntemp=0\nfor x in range(N):\n if arr[x]+temp>X:\n temp=x\n break\n else:\n temp+=arr[x]\nprint(temp)", "N,X=[int(x) for x in input().split(' ')]\narr=[int(x) for x in input().split(' ')]\ntemp=0\nflag=0\nfor x in range(N):\n... | ['Wrong Answer', 'Accepted'] | ['s759218308', 's598707936'] | [3060.0, 3060.0] | [18.0, 17.0] | [185, 235] |
p03000 | u859897687 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=0\nd=1\nfor i in range(n):\n d+=l[i]\n if d<=x:\n ans+=1\nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=1\nd=0\nfor i in range(n):\n d+=l[i]\n if d<=x:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s354657876', 's433514861'] | [2940.0, 3060.0] | [18.0, 17.0] | [133, 133] |
p03000 | u861469253 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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().strip().split(' ')))\nL = list(map(int, input().strip().split(' ')))\n\nD = [0] * (s[0] + 1)\ncount = 0\n\nfor i in range(1, s[0] + 1):\n print(D[i - 1])\n if (s[1] >= D[i - 1]):\n D[i] = D[i - 1] + L[i - 1]\n count += 1\n else:\n break\n\nprint(count)", 'n, x =... | ['Wrong Answer', 'Accepted'] | ['s392056261', 's720151061'] | [3064.0, 3060.0] | [17.0, 18.0] | [294, 172] |
p03000 | u863397945 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nD = 0\nans = 0\n\nfor i in range(N):\n D += Ls[i]\n if X < D:\n break\n else:\n ans += 1\n\nprint(ans)', 'N,X = map(int,input().split())\nLs = list(map(int,input().split()))\n\nD = 0\nans = 1\n\nfor i in range(N):\n D += ... | ['Wrong Answer', 'Accepted'] | ['s643732487', 's803789211'] | [9196.0, 9140.0] | [32.0, 32.0] | [183, 184] |
p03000 | u866124363 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nD = 0\ncount = 1\n\nfor l in L:\n D += l\n\n if D <= X:\n count += 1\n\n else:\n breakXh\n\nprint(count)\n', 'N, X = map(int, input().split())\nnow = 0\nres = 1\nfor l in map(int, input().split()):\n now += l\n if now <= X... | ['Runtime Error', 'Accepted'] | ['s728605386', 's177751466'] | [2940.0, 2940.0] | [18.0, 17.0] | [180, 145] |
p03000 | u866169813 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\n#print(L)\n#print(D)\n\nfor i in range(N):\n #print(i+2,end=" ")\n #print(L[i],end=" ")\n D=D+L[i]\n #print(D)\n if D>X:\n print(i+1)\n break\nprint(N+1)', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nD=0\n\n#print(L... | ['Wrong Answer', 'Accepted'] | ['s075901367', 's162278291'] | [3060.0, 2940.0] | [18.0, 18.0] | [220, 226] |
p03000 | u866774986 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 = [l for l in map(int, input().split())]\n\ndist = 0\n\nfor (i, v) in enumerate(L):\n dist += v\n print(dist)\n if dist <= x:\n continue\n else:\n break\n \nprint(i+1)\n\n', 'n, x = map(int, input().split())\nL = [l for l in map(int, input().split())]\n\ndist = 0\nnum ... | ['Wrong Answer', 'Accepted'] | ['s345490006', 's750716504'] | [3060.0, 3060.0] | [17.0, 17.0] | [205, 210] |
p03000 | u867826040 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nm = 0\na = 0\nfor i in range(n):\n a+=l[i]\n if a<=x:\n m+=1\n\nprint(m)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\nm = 0\na = 0\nwhile(a<=x):\n a+=l.pop(0)\n m+=1\n if l!=[]:\n break\nprint(m)... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s925158257', 's930409937', 's526067943'] | [3060.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [144, 152, 133] |
p03000 | u868237899 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 for i in range(N + 1)]\nbounding = 0\nfor i in range(1, N - 1):\n D[i + 1] = D[i] + L[i + 1]\n\nfor d in D:\n if d <= X:\n bounding += 1\n \nprint(bounding)', 'N, X = map(int, input().split())\nL = list(map(int, input().... | ['Wrong Answer', 'Accepted'] | ['s401210966', 's443701310'] | [3064.0, 3060.0] | [17.0, 18.0] | [243, 224] |
p03000 | u870518235 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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]\n\nfor i in range(0,N):\n D.append(D[i]+L[i])\n if D[i+1] >= X:\n break\n\nprint(len(D))\n', 'N, X = map(int,input().split())\nL = list(map(int,input().split()))\n\nD = [0]\n\nans = 1\n\nfor i in range(0,N):\n D.append(D[i]... | ['Wrong Answer', 'Accepted'] | ['s409646547', 's007008586'] | [9136.0, 9056.0] | [25.0, 27.0] | [171, 203] |
p03000 | u872184182 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nbound_limit= N+1\nL = list(map(int,input().split()))\nsum=0\ncount=1\nfor i in range(0,len(L)):\n sum+=L[i]\n if sum<=x:\n count+=1\n else:\n break\nprint(count)', 'N,X = map(int,input().split())\nbound_limit= N+1\nL = list(map(int,input().split()))\nsum=0\ncount=1\nfor i in r... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s123105207', 's844855359', 's824106324'] | [3060.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [191, 189, 191] |
p03000 | u877415670 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 = list(int(_) for _ in input().split()) \ndistance=0\n_count=1\nfor i in range(0, n+1):\n distance += l[i]\n if distance<=x:\n _count += 1\nprint(_count)', 'n, x = (int(i) for i in input().split()) \nl = list(int(_) for _ in input().split()) \ndistance=0\n_c... | ['Runtime Error', 'Accepted'] | ['s916683595', 's990887252'] | [3064.0, 3060.0] | [18.0, 18.0] | [204, 226] |
p03000 | u879309973 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 solve(n, x, l):\n ans = 1\n d = 0\n for i in range(n)\n d += l[i]\n if d <= x:\n ans += 1\n return ans\n \nn, x = map(int, input().split())\nl = list(map(int, input().split()))\nprint(solve(n, x, l))\n', 'def solve(n, x, l):\n ans = 1\n d = 0\n for i in range(n):\n... | ['Runtime Error', 'Accepted'] | ['s249249301', 's343153810'] | [2940.0, 2940.0] | [17.0, 17.0] | [233, 231] |
p03000 | u880277518 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\ncnt=1\nd=0\nfor i in L:\n d+=L[i]\n if d<=X:\n cnt+=1\n\nprint(cnt)', 'n,x=list(map(int,input().split()))\nl=list(map(int,input().split()))\nd=0\ncnt=0\nfor i in range(len(l)):\n if d>=x:\n print(i+1)\n exit()\n d+=... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s045472615', 's533224454', 's569405661', 's803899757', 's456568838'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0] | [18.0, 17.0, 19.0, 18.0, 17.0] | [141, 162, 177, 226, 139] |
p03000 | u883307604 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nprint(1, d, x)\nfor i in range(n):\n d = d + l[i]\n print(i+2, d, x)\n if d > x:\n print(i+1)\n exit()\nprint(n+1)\n', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0\nfor i in range(n):\... | ['Wrong Answer', 'Accepted'] | ['s557175526', 's993208401'] | [3060.0, 2940.0] | [17.0, 17.0] | [206, 169] |
p03000 | u884601206 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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=0\ni=0\nfor i in range(n):\n if d<=x:\n d+=l[i]\n ans+=1\n print(d)\n else:\n break\n \nprint(ans)\n\n\n', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\nans=1\ni=0\nfor i in range(n):\n d+=l[i]\n if d<=x:... | ['Wrong Answer', 'Accepted'] | ['s770889428', 's223420581'] | [3060.0, 2940.0] | [17.0, 18.0] | [176, 181] |
p03000 | u891482208 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\na = list(filter(lambda e: int(e) <= x, input().split()))\nprint(len(a))', 'n, x = list(map(int, input().split()))\na = list(map(int, input().split()))\nans = 0\np = 0\nfor e in a:\n p += e\n if p > x:\n break\n ans += 1\nprint(ans)', 'n, x = list(map(int, input().split())... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s684301241', 's963823888', 's399069215'] | [2940.0, 3064.0, 3060.0] | [17.0, 17.0, 17.0] | [109, 153, 171] |
p03000 | u898967808 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nN,X = map(int,input().split())\nL = list(map(int,input().split()))\nLcs = np.array(L)\nb_count = 0\nfor l in Lcs:\n b_count += 1\n if X <= l:\n break\nprint(b_count)', 'import numpy as np\nN,X = map(int,input().split())\nL = list(map(int,input().split()))\nLcs = np.array(L)\nb_count = 0\nfor ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s099757919', 's935694691', 's623407402'] | [14428.0, 12504.0, 12508.0] | [151.0, 156.0, 160.0] | [181, 180, 199] |
p03000 | u899909022 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['print(0)', 'n,x =map(int,input().split())\nL=list(map(int,input().split()))\ntmp = 0\ncnt = 0\nfor i in range(n):\n if tmp > x:\n break\n tmp += L[i]\n cnt += 1\nif i == n-1:\n cnt+= 1\nprint(cnt)', 'n,x =map(int,input().split())\nL=list(map(int,input().split()))\nA = [0] * (n+1)\nfor i in range(1,... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s489510984', 's558731000', 's526291860'] | [2940.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [8, 192, 200] |
p03000 | u902693400 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nsumList=[]\nsumList.append(0)\n\nfor i in range(N):\n sumList.append(sum(L[0:i+1]))\n if(sum(L[0:i+1]) == X):break\n\nprint(len(sumList))', 'N,X = map(int, input().split())\nL= list(map(int, input().split()))\n\ncount= 0\nsumList=[]\ns... | ['Wrong Answer', 'Accepted'] | ['s664304120', 's213417085'] | [3060.0, 3060.0] | [17.0, 18.0] | [209, 208] |
p03000 | u904258057 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\ndef input(): return sys.stdin.readline().strip()\n\nmi = lambda: map(int, input().split())\nli = lambda: list(map(int, input().split()))\n\nN, X = mi()\nL = li()\n\ncount = 0\nD = 0\nfor i in range(N):\n D += L[i]\n if X >= D:\n count += 1\n else:\n break\n\nprint(count)', 'import sys\ndef input(... | ['Wrong Answer', 'Accepted'] | ['s318896210', 's983971551'] | [3064.0, 3064.0] | [17.0, 17.0] | [274, 278] |
p03000 | u904331908 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nn,x = map(int,input().split())\nl = list(map(int,input().split()))\n\nd = 1\ncount = 1\n\nfor y in range(n):\n d = d + l[n]\n if d <= x:\n count += 1\n else:\n break\n \nprint(count)\n \n\n', '\n\nn,x = map(int,input().split())\nl = list(map(int,input().split()))\n\nd = 0\ncount = 1\n\nfor y in range... | ['Runtime Error', 'Accepted'] | ['s369264591', 's042834927'] | [9100.0, 9104.0] | [27.0, 29.0] | [233, 231] |
p03000 | u905582793 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 break', '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 break\nelse:\n print(1+n)'] | ['Runtime Error', 'Accepted'] | ['s882900901', 's537602505'] | [3060.0, 3060.0] | [23.0, 17.0] | [129, 148] |
p03000 | u905730864 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 l in L\n d=d+1\n if X>=d:\n count +=1\nprint(count)\n', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\n\nd=0\ncount=1\nfor l in L\n d=d+1\n if X>=d:\n count +=1\n \nprint(count)\n', 'N,X=map(int,inp... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s251362107', 's278163523', 's306534285', 's578633227', 's694169214'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [129, 145, 128, 133, 133] |
p03000 | u907223098 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nd=0\nc=1\nl=[int(i) for i in input().split()]\nfor i in range(n):\n d=d+l[i]\n if d<=x:\n c=c+1\n elif d>x:\n print(c)\n break\nprint(c)', 'n,x=(int(i) for i in input().split())\nd=0\nc=0\nl=[int(i) for i in input().split()]\nfor i in range(n):\n d=d+l[i]\n if d<=x... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s492395357', 's528493041', 's646766429', 's575728608'] | [2940.0, 3060.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 17.0] | [176, 167, 145, 163] |
p03000 | u908481359 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['from collections import deque\n\nn,x = map(int,input().split())\n\nl = deque(list(map(int,input().split())))\ncount = 0\nwhile count < x:\n count += l.popleft()\n\nprint(n-len(l)+1)', 'from collections import deque\n\nn,x = map(int,input().split())\n\nl = deque(list(map(int,input().split())))\ncount = 0\n\nif sum(... | ['Runtime Error', 'Accepted'] | ['s026306512', 's034578519'] | [3316.0, 3316.0] | [20.0, 20.0] | [175, 266] |
p03000 | u912179452 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\n\n\ng = 0\ncnt = 0\nfor l in L:\n g += l\n if X < g:\n break\n cnt += 1\n\nprint(cnt)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nprint("N:{},X:{}".format(N, X))\nprint(L)\n\ng = 0\ncnt = 0\nfor l ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s015206632', 's891469186', 's130273709'] | [2940.0, 3064.0, 2940.0] | [17.0, 18.0, 17.0] | [161, 201, 161] |
p03000 | u914330401 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 = []\nl_list.append(0)\nl_list[1:] = list(map(int, input().split()))\nprint(l_list)\nans = 0\nd = 0\nfor i in range(n):\n if i == 0:\n d = 0\n else:\n d = d + l_list[i]\n if d > x:\n break\n ans += 1\n\nprint(ans)', 'n, x = map(int, input().split())\nl_list = []\n... | ['Wrong Answer', 'Accepted'] | ['s528154704', 's065294124'] | [3060.0, 3060.0] | [17.0, 17.0] | [251, 209] |
p03000 | u921595858 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\ni = 0\nwhile d <= x:\n d += l[i]\n i += 1\n print('i:', i, 'd:', d)\n\nprint(i)", 'n, x = map(int, input().split())\nl = [int(i) for i in input().split()]\nprint(l)\nd = 0\ni = 0\nwhile (d <= x) and (i < n):\n d += l[i]\n i... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s005797854', 's648440624', 's490008613'] | [3060.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [159, 153, 199] |
p03000 | u921811474 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nprint(a)\nx = 0\ncount = 0\nfor i in range(len(a)):\n count += 1\n x += a[i]\n if x > X:\n break\nprint(count)', 'N, X =map(int,input().split())\na = list(map(int,input().split()))\nx = 0\ncount = 0\nfor i in range(len(a)+1):\n cou... | ['Wrong Answer', 'Accepted'] | ['s469066027', 's279704317'] | [3060.0, 3060.0] | [17.0, 18.0] | [184, 229] |
p03000 | u922449550 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nD = [0]\nfor l in L:\n d = D[-1] + L\n if d <= X:\n D.append(d)\n else:\n break\n\nprint(len(D))', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nD = [0]\nfor l in L:\n d = D[-1] + l\n if d <= X:\n D.appe... | ['Runtime Error', 'Accepted'] | ['s236391716', 's061581153'] | [2940.0, 2940.0] | [17.0, 17.0] | [167, 168] |
p03000 | u925567828 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['oukei=0 \ncount=1\n\nN,X =map(int, input().split())\nL= list(map(int, input().split()))\n \n\nfor i in range(N-1):\n goukei +=L[i]\n \n if(goukei>X):\n break\n else:\n count +=1\n \nprint(count)', 'oukei=0 \ncount=1\n\nN,X =map(int, input().split())\nL= list(map(int, input().split(... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s065163004', 's555108140', 's476782950'] | [3060.0, 3060.0, 3060.0] | [18.0, 18.0, 17.0] | [215, 213, 214] |
p03000 | u927764913 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()]\nprint(l)\nd = [0]\ncount = 1\nfor i in range(1,n+1):\n d.append(d[i-1]+l[i-1])\n print(d)\n if d[i] <= x:\n count += 1\nprint(count)', 'n,x = map(int,input().split())\nl = [int(i) for i in input().split()]\nd = [0]\ncount = 1\nfor ... | ['Wrong Answer', 'Accepted'] | ['s723916694', 's025633523'] | [3064.0, 3064.0] | [18.0, 17.0] | [209, 187] |
p03000 | u931489673 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\ntime=1\nwhile x<=X and time<=len(L):\n x+=L[time-1]\n time+=1\nprint(time)\n', 'N,X=map(int,input().split())\nL=list(map(int,input().split()))\nx=0\ntime=0\nfor i in range(N+1):\n if x<=X:\n time+=1\n if i<N:\n count+=1\nprint(time)\n'... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s129961707', 's699148613', 's339206938'] | [2940.0, 2940.0, 3060.0] | [18.0, 17.0, 19.0] | [143, 152, 199] |
p03000 | u932868243 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nlistl=list(map(int,input().split()))\nsum=0\nfor k in range(2,n+1):\n while sum<=x:\n sum+=listl[k-2]\nprint(k)', 'n,x=map(int,input().split())\nlistl=list(map(int,input().split()))\nsum=0\ncount=0\nfor k in range(2,n+1):\n sum+=listl[k-2]\n while sum<=x:\n count+=1\nprint(count... | ['Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s158406156', 's198158474', 's335613350'] | [3064.0, 3060.0, 9136.0] | [17.0, 2104.0, 20.0] | [139, 164, 168] |
p03000 | u934442292 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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().strip().split()]\nL = [int(i) for i in input().strip().split()]\n\npos = 0\nres = 1\nfor i in range(N):\n if X < pos:\n break\n pos += L[i]\n res += 1\nprint(res)\n', 'N, X = [int(i) for i in input().strip().split()]\nL = [int(i) for i in input().strip().split()]\n\npos = 0\nres ... | ['Wrong Answer', 'Accepted'] | ['s708677807', 's763337765'] | [2940.0, 2940.0] | [18.0, 17.0] | [191, 191] |
p03000 | u939585142 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nfor i in range(N + 1):\n if i == 0:\n ans += 1\n else:\n D += L[i - 1]\n ans += 1\n\nprint(ans)\n\n', 'N, X = map(int,input().split())\nL = list(map(int,input().split()))\n\nans = 0\nD = 0\nfor i in range(N + 1):\n if i... | ['Wrong Answer', 'Accepted'] | ['s931557340', 's464104492'] | [2940.0, 2940.0] | [17.0, 17.0] | [183, 221] |
p03000 | u941284420 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nbound=1\nD=0\nfor i in range(N+1):\n D+=L[i]\n if D<=X:\n bound+=1\n else:\n pass\nprint(bound)', 'N,X=map(int,input().split())\nL=list(map(int,input().split() ) )\nbound=1\nD=0\nfor n in L:\n D+=n\n if D<=X:\n bound+=1\n else:\n break\... | ['Runtime Error', 'Accepted'] | ['s460652572', 's526314199'] | [2940.0, 3060.0] | [17.0, 18.0] | [158, 149] |
p03000 | u941438707 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()]\nm=[0]\nfor i in range(n):\n m.append(m[i]+l[i])\na=0\nfor i in range(n):\n a+=l[i]\n if a>x:\n ans=i+1\n else:\n ans=n+1\nprint(ans)', 'n,x=map(int,input().split())\nl=[int(i) for i in input().split()]\na=0\nfor i in range(n)... | ['Wrong Answer', 'Accepted'] | ['s009753423', 's662591416'] | [3064.0, 3060.0] | [18.0, 17.0] | [213, 178] |
p03000 | u944643608 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nbound = 0\nD = 0\ni = 0\nwhile D =< X and i < N:\n bound += 1\n D = D + L[i]\n i += 1\nprint(bound)', 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\nbound = 1\nD = 0\ni = 0\nfor i in range(N):\n if X >= D + L[i... | ['Runtime Error', 'Accepted'] | ['s107389543', 's371180293'] | [2940.0, 3060.0] | [17.0, 17.0] | [170, 209] |
p03000 | u947327691 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nplot=0\ncnt=0\n\nfor i in range(n):\n plot += l[i]\n if l[i] <= x:\n cnt += 1\n\nprint(cnt)', 'n,x = map(int,input().split())\nl=list(map(int,input().split()))\n\nplot=0\ncnt=1\n\nfor i in range(n):\n plot += l[i]\n if plot <= x:\n... | ['Wrong Answer', 'Accepted'] | ['s862242843', 's960726287'] | [2940.0, 3060.0] | [17.0, 18.0] | [161, 161] |
p03000 | u952467214 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int, input().split()) \nL=list(map(int, input().split())) \nD = 0\nfor i in range(N):\n D = D + L[i]\n if D > X:\n print(i+1)\n break\n if D == X:\n print(i+2)\n break\nprint(i+2)', 'N,X=map(int, input().split()) \nL=list(map(int, input().split())) \nD = 0\nfor i in range(N):\n D = D + L[i]\n ... | ['Wrong Answer', 'Accepted'] | ['s265805475', 's290112358'] | [3060.0, 2940.0] | [17.0, 18.0] | [191, 235] |
p03000 | u956194864 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\ncnt = 0\ndi = 0\nif sum(l) <= x:\n print(n+1)\nelse:\n while di <= x:\n cnt += 1\n di += l[cnt-1]\n print(cnt)', 'n, x = [int(i) for i in input().split()]\nl = [int(i) for i in input().split()]\n\ncnt = 0\ndi = 0\n\nif sum(l... | ['Wrong Answer', 'Accepted'] | ['s935428584', 's540412079'] | [3060.0, 3060.0] | [17.0, 17.0] | [193, 278] |
p03000 | u960317355 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()]\nprint(l)\nd = [0]\ncount = 1\nfor i in range(1,n+1):\n d.append(d[i-1]+l[i-1])\n print(d)\n if d[i] <= x:\n count += 1\nprint(count)', 'n,x = map(int,input().split())\nl = [int(i) for i in input().split()]\nd = [0]\ncount = 1\nfor ... | ['Wrong Answer', 'Accepted'] | ['s165858870', 's367822387'] | [3064.0, 3060.0] | [18.0, 18.0] | [209, 187] |
p03000 | u964906869 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = list(map(int,(input().split())))\n\nd = [0]\nfor i in range(1,n):\n d.append(d[i-1]+l[i-1])\n if sum(d) <=x:\n print(d)\n else:\n break\n\nprint(len(d))', 'n, x = map(int, input().split())\nl = list(map(int,(input().split())))\n\nd = 0\ncnt = 1\nfor i in ra... | ['Wrong Answer', 'Accepted'] | ['s183730295', 's494324537'] | [3060.0, 3060.0] | [18.0, 17.0] | [202, 184] |
p03000 | u969808621 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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())\nprint("n:%d" %n)\nprint("x:%d" %x)\nl = list(map(int, input().split()))\nsum = 0\nb = 1;\nfor i in range(n):\n\tsum = sum + l[i]\n\tif(sum > x):\n\t\tprint(b)\n\t\tbreak\n\telse:\n\t\tif(i == n-1):\n\t\t\tprint(n+1)\n\t\t\tbreak\n\t\telse:\n\t\t\tb=b+1', 'n, x = map(int, input().spli... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s171001777', 's426219783', 's572439082', 's017870652'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 18.0, 17.0, 20.0] | [250, 199, 246, 252] |
p03000 | u971237642 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 -*-\nimport sys\n\n\n\n\n#Given:\n #N X\n #L1, L2, L3, ... LN-1, LN\n\n\n\n\ni = input()\nlis = i.split()\n\nN = int(lis[0])\n\nX = int(lis[1])\n\n\n\n\ni = input()\nlis = i.split()\n\nL = list()\nfor k in lis:\n print(k)\n L.append(int(k)) \n#print(L)\n\n\nif N != len(L):\n print("... | ['Wrong Answer', 'Accepted'] | ['s463753621', 's412462220'] | [3064.0, 3064.0] | [18.0, 17.0] | [1146, 1147] |
p03000 | u972658925 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['from itertools import accumlate\nn,x = map(int,input().split())\nlst_l = [0] + list(map(int,input().split()))\nlst_wa = list(accumulate(lst_l))\ncnt = 0\nfor i in lst_wa:\n if i < x:\n cnt += 1\nprint(cnt)', 'import itertools\nn,x = map(int,input().split())\nlst_l = [0] + list(map(int,input().split()))\nlst... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s026777081', 's801484872', 's688664782'] | [3060.0, 3060.0, 3188.0] | [17.0, 18.0, 19.0] | [207, 192, 209] |
p03000 | u973900850 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nc = 0\ntotal = 0\nfor i in l:\n total += i\n if total > x:\n print(c+1)\n break\n c += 1\nprint(c)', 'n, x = list(map(int, input().split()))\nl = list(map(int, input().split()))\nc = 1\ntotal = 0\nfor i in l:\n total += i\n if tot... | ['Wrong Answer', 'Accepted'] | ['s009294412', 's732624204'] | [2940.0, 2940.0] | [17.0, 17.0] | [174, 150] |
p03000 | u974935538 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\ncount = 0\nfor i in range(len(li)):\n if li[i]<=X:\n count +=1\n else:\n pass\nprint(count)', 'n, x = map(int, input().split())\nli = list(map(int, input().split()))\n\nnum = 0\nans = 1\n\nfor i in range(n):\n num += li[i]\n ... | ['Wrong Answer', 'Accepted'] | ['s229309814', 's931386921'] | [2940.0, 2940.0] | [17.0, 17.0] | [171, 169] |
p03000 | u975261985 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\nif __name__ == '__main__':\n N = 0\n X = 0\n L = []\n for i, line in enumerate(sys.stdin):\n if i == 2:\n break\n line = line.split()\n if i == 0:\n N = line[0]\n X = line[1]\n if i == 1:\n L = line\n D = 0\n count = 0\n for l in L:\n if D < X:\n count += 1... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s000135161', 's017087434', 's036252203', 's144887342', 's194884612', 's444500476', 's512458930', 's736000318', 's909794385', 's984733423', 's352212833'] | [3064.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 3064.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0] | [330, 156, 185, 181, 237, 147, 172, 330, 148, 177, 156] |
p03000 | u978645020 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# Input\nN, X = map(int, input().split())\nL = [int(l) for l in input().split()]\n#\nd, i, c = 0, 0, 1\nfor i in range(N):\n print(i,d, c)\n d = d + L[i]\n if (d > X):\n break\n c += 1\nprint(c)\n', '# Input\nN, X = map(int, input().split())\nL = [int(l) for l in input().split()]\n#\nd, i, c = 0, 0... | ['Wrong Answer', 'Accepted'] | ['s606330215', 's401652443'] | [3060.0, 2940.0] | [17.0, 17.0] | [203, 190] |
p03000 | u981040490 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 -*-\ndef main():\n N,X = map(int,input().split())\n L=[int(i) for i in input().split()]\n Ls = 0\n count = 1\n for i in range(N):\n Ls = Ls+L[i]\n print(Ls)\n if Ls<=X:\n count+=1\n print(count)\n\n\nif __name__ == '__main__':\n main()", "# -*- ... | ['Wrong Answer', 'Accepted'] | ['s408176923', 's433076539'] | [3064.0, 3060.0] | [17.0, 24.0] | [293, 294] |
p03000 | u981332890 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\n ans = 0\n D = 0\n for i in range(N):\n D = D + L[i]\n if D > X:\n break\n ans+=1\n return ans\n \nif __name__ == '__main__':\n print(main())\n", "def main():\n N, X = map... | ['Wrong Answer', 'Accepted'] | ['s898977265', 's208153567'] | [3060.0, 3060.0] | [17.0, 18.0] | [272, 260] |
p03000 | u988644208 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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(c) for c in input().split())\nl = (int(c) for c in input().split())\nl.insert(0,0)\nflag = 0\ncount = 0\nfor i in range(int(n)+1):\n count = count + int(l[i])\n\n if count > int(x):\n print(i)\n flag = 1\n break\n\nif flag == 0:\n print(int(n)+1)', 'n, x = input().split()\nl ... | ['Runtime Error', 'Accepted'] | ['s566291835', 's643143815'] | [3064.0, 3060.0] | [21.0, 17.0] | [274, 222] |
p03000 | u993435350 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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] * (N + 1)\n\ncounter = 0\n\nfor i in range(1,len(L)):\n\tD[i] = D[i - 1] + L[i - 1]\n\tprint(D)\n\t\n\t\nfor i in range(0,len(D)):\n\tif D[i] <= X:\n\tcounter += 1\n\t\nprint(counter)', 'N,X = map(int,input().split())\nL = list(map(int,inpu... | ['Runtime Error', 'Accepted'] | ['s474424327', 's966508583'] | [2940.0, 3064.0] | [17.0, 18.0] | [238, 231] |
p03000 | u995109095 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 as bi\nI=lambda:list(map(int,input().split()))\nn,x=I()\nl=I()\nans=0\nt=0\nfor i in range(1,n):\n l[i]+=l[i-1]\nan=bi.bisect(l,x)\nprint(an)\n', 'import bisect as bi\nI=lambda:list(map(int,input().split()))\nn,x=I()\nl=I()\nans=0\nt=0\nfor i in range(1,n):\n l[i]+=l[i-1]\nan=bi.bisect(l,x)\nprint(an+... | ['Wrong Answer', 'Accepted'] | ['s956240607', 's709942350'] | [3060.0, 3060.0] | [20.0, 18.0] | [148, 150] |
p03001 | u018776180 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['w, h, x, y = [int(s) for s in input().split(" ")]\n\na = w * h\n\nprint("%f %d" % (a * 0.5, int(w // 2 == x and h // 2 == y))', 'w, h, x, y = [int(s) for s in input().split(" ")]\n\na = w * h\n\nprint("%d %d" % (a * 0.5, int(w // 2 == x and h // 2 == y))', 'w, h, x, y = [int(s) for s in input().split(" ")]\n\na = w *... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s799750988', 's888021980', 's629320236'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [121, 121, 145] |
p03001 | u023141436 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W,H,x,y = map(int,input().split())\n\nif W/2 == x and H/2 == y:\n\tS = W*H/2\n\tprint("%f %d" % (S,1))\nelif W*y == H*x or H*x + W*y == W*H:\n\tprint("%f %d" % (W*H/2,0))\nelif x == 0 or y == 0 or x == W or y == H:\n\tprint("0.000000 0")\nelse:\n\tS1 = min(x,W-x) * H\n\tS2 = min(y,H-y) * W\n\tprint("%f %d" % (max(S1,... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s277224073', 's600051446', 's798723272'] | [3064.0, 3064.0, 2940.0] | [17.0, 19.0, 17.0] | [307, 241, 125] |
p03001 | u076917070 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['w,h,x,y= map(int, input().split())\n\nd=w*h/2\nif x == w/2 or y == h/2:\n k = 0\nif x == w/2 and y == h/2:\n k = 1\nprint(d, k)\n', 'w,h,x,y= map(int, input().split())\n\nd=w*h/2\nk = 1\nif x == w/2 or y == h/2:\n k = 0\n\nprint(d, k)\n', 'w,h,x,y= map(int, input().split())\n\nd=w*h/2\nk = 1\nif x == w/2 or ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s130072396', 's708711969', 's757958914', 's816614201'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 18.0, 18.0, 18.0] | [127, 98, 133, 140] |
p03001 | u094932051 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['while True:\n try:\n W, H, x, y = map(int, input().split())\n \n cut = (x == W // 2) + (y == H // 2)\n if cut > 0:\n area = (W * H) / 2\n else:\n area = min(x*H, y*W)\n \n print(area, 1 if cut > 1 else 0)\n except:\n break', 'whil... | ['Wrong Answer', 'Accepted'] | ['s025492571', 's381333070'] | [3060.0, 3060.0] | [17.0, 17.0] | [298, 247] |
p03001 | u106103668 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | [' w,h,x,y = map(float, input().split())\n if (abs(w//2-x)>abs(h//2-y)):\n print("{:.6f} {}".format(min(y*w,(h-y)*w),0))\n elif (abs(w//2-x)<abs(h//2-y)):\n print("{:.6f} {}".format(min(x*h,(w-x)*h),0))\n else:\n print("{:.6f} {}".format(min(x*h,(w-x)*h),1))', "w,h,x,y = map(float, inpu... | ['Runtime Error', 'Accepted'] | ['s184346210', 's959536764'] | [2940.0, 2940.0] | [17.0, 18.0] | [283, 108] |
p03001 | u137228327 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W,H,x,y = map(int,input().split())\n\n#print(W,H,x,y)\nif x ==W/2 and y == H/2:\n area = "{0:.6f}".format(float(x*H))\n print(area,1)\nelse:\n area ="{0:.6f}".format(float(min(W-x)*H,x*H))\n print(area,0)', 'W,H,x,y = map(int,input().split())\n\n#print(W,H,x,y)\nif x ==W/2 and y == H/2:\n area = x*H\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s121663404', 's622351650', 's738020167'] | [9152.0, 9176.0, 9044.0] | [31.0, 28.0, 29.0] | [209, 161, 158] |
p03001 | u173243396 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['W,H,x,y=list(map(int,input().split()))\nprint(W,H,x,y)\nif x==W/2 and y==H/2:\n print("{:.6f} 1".format(W*H/2))\nelse:\n print("{:.6f} 0".format(W*H/2))\n', 'W,H,x,y=list(map(int,input().split()))\nprint(W,H,x,y)\nif x==W/2 and y=H/2:\n print("{:.6f} 1".format(W*H/2))\nelse:\n print("{:.6f} 0".format(W*H/2))\n', ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s079642059', 's166726360', 's362405852', 's367653566', 's390353113', 's605156906', 's968473882', 's137542336'] | [2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [150, 149, 207, 111, 146, 151, 181, 136] |
p03001 | u177645323 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['w,h,x,y = map(float,input().split(" "))\n\nif a.count(max(a)) > 1:\n print(\'{:.6f}\'.format(w*h/2,1)\nelse:\n print(\'{:.6f}\'.format(w*h/2,0)\n', 'w,h,x,y = map(int,input().split(" "))\n\nif y == h/w * x or y == (h/w * x * -1) + h or x == w/2 or y == h/2:\n print(\'{:.6f}\'.format(w*h/2),1)\nelse:\n pri... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s279312118', 's809545902', 's907822310'] | [2940.0, 3188.0, 2940.0] | [17.0, 19.0, 17.0] | [141, 185, 143] |
p03001 | u218487880 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['# -*- coding: utf-8 -*-\nW,H,x_0,y_0 = map(float, input().split())\n\nif W == 2 * x_0 or H == 2 * y_0:\n print(W*H/2, 0)\nelse:\n print(W*H/2, 1)', '# -*- coding: utf-8 -*-\nW,H,x_0,y_0 = map(float, input().split())\n\nif W == 2 * x_0 or H == 2 * y_0:\n print(W*H/2, 0)\nelse:\n print(W*H/2, 1)', '# -*- co... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s211385194', 's365831997', 's822550641', 's911590104', 's912535735', 's025197705'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 18.0, 17.0, 17.0] | [145, 145, 175, 149, 176, 176] |
p03001 | u266874640 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ["W,H,x,y = map(int,input().split())\nS_V = min(y*W, (H-y)*W)\nS_A = min(x*H, (W-x)*H)\nprint(max(S_V,S_A), end=' ')\nif S_V == S_A:\n print(1)\nelse:\n print(0)\n", 'W, H, x, y = map(int,input().split())\nprint("{0:6f}".format(W*H/2), end=\' \')\nif x == W/2 and y == H/2:\n print(1)\nelse:\n print(0)\n'] | ['Wrong Answer', 'Accepted'] | ['s736403427', 's019524572'] | [2940.0, 3064.0] | [17.0, 25.0] | [159, 135] |
p03001 | u353919145 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['w,h,x,y = list(map(int, input().split()))\n\nif((x == w//2 and y == h//2) or (x == h//2 and y == w//2)):\n print((w*h)//2 , 1)\nelse:\n print((w*h)//2, 0)', 'coordinates = list(map(int, input().split()))\nw = coordinates[0]\nh = coordinates[1]\nx = coordinates[2]\ny = coordinates[3]\nprod1 = x * h\nprod2 = y * w\ni... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s058580994', 's732553194', 's049627517'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [151, 317, 140] |
p03001 | u368249389 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['# Problem C - Rectangle Cutting\n\n# input\nW, H, x, y = map(int, input().split())\n\n\n# area 1\ntmp_1 = H * x\ntmp_2 = H * (W - x)\nans_1 = min(tmp_1, tmp_2)\n\n# area 2\ntmp_3 = W * y\ntmp_4 = W * (H - y)\nans_2 = min(tmp_3, tmp_4)\n\n# output\nif ans_1==ans_2:\n ans_list = [ans_1, 1]\n print(" ".join(list(m... | ['Wrong Answer', 'Accepted'] | ['s329213376', 's379151495'] | [3064.0, 2940.0] | [17.0, 17.0] | [448, 219] |
p03001 | u369081942 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ['w,h,x,y = map(int,input.split())\ns = float((w*h) / 2)\nif x+x==w and y+y ==h:\n print(s+"1")\nelse:\n print(s + "0")', 'w,h,x,y = map(int,input.split())\ns = float((w*h) / 2)\nif x==y:\n print(s+"1")\nelse:\n print(s + "0")', "w,h,x,y = map(int, input().split())\nprint('{:.6f} {}'.format(w*h/2, 1 if x+x==w and y... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s382286621', 's572279134', 's678918464'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [114, 100, 99] |
p03001 | u569079213 | 2,000 | 1,048,576 | There is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H). You are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the p... | ["inp=list(map(int,input().split()))\nif 2*inp[2]==inp[0] and 2*inp[3]==inp[1]:\n ans=1;\nelse:\n ans=0;\nprint('%d %d'%(inp[0]*inp[1]*0.5,ans))\ninp=list(map(int,input().split()))\nif 2*inp[2]==inp[0] and 2*inp[3]==inp[1]:\n ans=1;\nelse:\n ans=0;\nprint('%.6f %d'%(inp[0]*inp[1]*0.5,ans))\n提出情報", "inp=list(map(int... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s247338424', 's578797032', 's741829984', 's789732598', 's144350991'] | [3064.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 20.0, 17.0, 17.0] | [294, 140, 139, 139, 141] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.