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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02999 | u837033158 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X, A = map(int, input.split());\nif X < A:\n print(0);\nelse:\n print(10);', 'X, A = map(int, input().split());\nif X < A:\n print(0);\nelse:\n print(10);\n'] | ['Runtime Error', 'Accepted'] | ['s490052707', 's906405216'] | [2940.0, 3064.0] | [17.0, 19.0] | [72, 79] |
p02999 | u837383145 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a = [int(i) for i in input().split()]\n\nif x < a:\n print(0)\nelse:\n ', 'x,a = [int(i) for i in input().split()]\n\nif x < a:\n print(0)\nelse:\n print(10)\n'] | ['Runtime Error', 'Accepted'] | ['s258925087', 's056147728'] | [2940.0, 2940.0] | [17.0, 17.0] | [74, 84] |
p02999 | u839953865 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a,b=map(int,input(),split())\nif a<b:\n print("0")\nelse:\n print("10")', 'a,b=map(int,input().split())\nif a<b:\n print("0")\nelse:\n print("10")'] | ['Runtime Error', 'Accepted'] | ['s743573644', 's776963017'] | [2940.0, 3064.0] | [17.0, 17.0] | [73, 73] |
p02999 | u841021102 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a, b = map(int, input().split())\nif a[0] < b[1] :\n print (0)\nelse:\n print (10)', 'inp = map(int, input().split())\nif (inp[0] < inp[1]) :\n print 0\nelse:\n print 10', 'inp = map(int, input().split())\nif inp[0] < inp[1] :\n print (0)\nelse:\n print (10)', 'a, b = map(int, input().split())\nif a < b :\n pr... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s217350486', 's353143503', 's976655678', 's266692221'] | [9160.0, 8952.0, 9052.0, 9144.0] | [27.0, 24.0, 24.0, 27.0] | [80, 81, 83, 74] |
p02999 | u842375327 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X, A = map(int, input().split())\n\nif X<A:\n return 0\nelse:\n return10', 'if X<A:\n return 0\nelse:\n return10', 'def a(X,A):\n if X<A:\n return 0\n else:\n return10', 'X, A = map(int, input().split())\n \nif X<A:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s113095406', 's549528313', 's921521551', 's368202617'] | [2940.0, 2940.0, 2940.0, 3316.0] | [17.0, 17.0, 17.0, 20.0] | [69, 35, 55, 71] |
p02999 | u844789719 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['import itertools\nN, M = [int(_) for _ in input().split()]\nS = [int(_) for _ in input().split()]\nT = [int(_) for _ in input().split()]\nmod = 10**9 + 7\ndp = [[1] * (M + 1)] + [[1] + [0] * M for _ in range(N)]\nfor n, m in itertools.product(range(N), range(M)):\n dp[n + 1][m + 1] = dp[n][m + 1] + dp[n + 1][m] - ... | ['Runtime Error', 'Accepted'] | ['s776982038', 's983749601'] | [3064.0, 2940.0] | [17.0, 17.0] | [424, 84] |
p02999 | u846001935 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x, a = int(input())\n \nif x >= a:\n print(10)\nelif x < a:\n print(0)\nelse:\n pass', 'x, a = input()\n\nif x >= a:\n print(10)\nelif x < a:\n print(0)\nelse:\n pass', 'x, a = map(int,input().split())\n\nif x >= a:\n print(10)\nelif x < a:\n print(0)\nelse:\n pass'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s036355643', 's408290633', 's950109240'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [80, 74, 91] |
p02999 | u847033024 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a, b = map(int, input().split())\nif x < a:\n print(0)\nelse:\n print(10)', 'a, b = map(int, input().split())\nif b < a:\n print(0)\nelse:\n print(10)\n', 'a, b = map(int, input().split())\nif a < b:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s514485171', 's822858938', 's913109286'] | [9148.0, 9008.0, 9068.0] | [31.0, 27.0, 29.0] | [71, 72, 71] |
p02999 | u854690176 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X,A = int(a) for a in input().split()\nif X<A:\n print("0")\nelse:\n print("10")', 'X, A = (int(a) for a in input().split())\nif X < A:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s819310596', 's763501267'] | [2940.0, 2940.0] | [17.0, 18.0] | [82, 83] |
p02999 | u854992222 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x, a = int(input())\nif x < a:\n print("0")\nelse:\n print("10")', 'x, a = map(int,input().split())\nif x < a:\n print("0")\nelse:\n print("10")'] | ['Runtime Error', 'Accepted'] | ['s776258357', 's619383333'] | [2940.0, 3060.0] | [17.0, 19.0] | [68, 80] |
p02999 | u857217921 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ["a, b = map(int, input().split())\nif a=>b:\n print('10')\nelse:\n print('0')", "a,b=int(input().split)\nif a=>b:\n print('10')\nelse:\n print('0')", "a, b = map(int, input().split())\nif a >= b:\n print('10')\nelse:\n print('0')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s904745147', 's959053075', 's687492737'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [74, 64, 76] |
p02999 | u858670323 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a = map(int,input())\nif x<a:\n print(0)\nelse:\n print(10)', 'x,a = map(int,input().split())\nif x<a:\n print(0)\nelse:\n print(10)\n'] | ['Runtime Error', 'Accepted'] | ['s588901900', 's448629555'] | [9024.0, 9064.0] | [27.0, 27.0] | [59, 68] |
p02999 | u859773831 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ["import sys\nN,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 print(x+1)\n sys.exit(1)\n else:\n temp+=arr[x]\nprint(N+1)", "x,a=[int(X) for x in input().split(' ')]\nif x<a:\n print(0)\nelse:\n print(10)", "x,a=[int(x) fo... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s934892960', 's936241063', 's131244576'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [205, 77, 77] |
p02999 | u859987056 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['A,X = map(int,input().split())\nif X<A:\n print(0)\nif X>=A:\n print(10)', "W,H,x,y = map(int,input().split())\nif x==0 or x==W or y==0 or y==H:\n s = H*W/2\n print('{:.10f}'.format(s))\nelse:\n a = min(x*H,(W-x)*H)\n b = min(y*W,(H-y)*W)\n s = max(a,b)\n print('{:.10f}'.format(s))\nif x==0 and y==0:\n print... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s007157499', 's035227650', 's239364934', 's620175574', 's336740018'] | [2940.0, 3064.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [70, 390, 247, 70, 70] |
p02999 | u860855494 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a,b = map(int, input().sprit())\nif a < b:\n print(0)\nelse:\n print(10)', 'a,b = map(int, input().split())\nif a < b:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s496940168', 's266442657'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 70] |
p02999 | u861962192 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a, x = map(int, input().split())\no = 0 if x<a else 10\nprint(o)', 'x, a = map(int, input().split())\no = 0 if x<a else 10\nprint(o)\n'] | ['Wrong Answer', 'Accepted'] | ['s664768026', 's520224358'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 63] |
p02999 | u866124363 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ["X, A = int(input().split(''))\nif X < A:\n print(0)\nelse:\n print(10)\n", 'X, A = map(int, input())\nif X < A:\n print(0)\nelse:\n print(10)\n', 'X, A = map(int, input().split())\nif X < A:\n print(0)\nelse:\n print(10)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s387668120', 's897076551', 's380783951'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [73, 68, 76] |
p02999 | u866169813 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X,A=map(int,input().split())\nprint(10*(A=<X))\n', 'X,A=map(int,input().split())\nprint(10*(A<=X))'] | ['Runtime Error', 'Accepted'] | ['s202110705', 's540618959'] | [2940.0, 2940.0] | [19.0, 17.0] | [46, 45] |
p02999 | u877415670 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['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\n else:\n break\nprint(_count)', 'x, a = (int(i) for i in input().split()) \nif x<a:\n print(0)\nelse:\n ... | ['Runtime Error', 'Accepted'] | ['s717757860', 's246660549'] | [3060.0, 2940.0] | [18.0, 17.0] | [228, 83] |
p02999 | u879077265 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['ans = 0 if x < a else 10\nprint(ans)', 'ans = 0 if x < a else 10\nprint(ans)', 'X,A = map(int, input().split())\n\nprint(0 if X < A else 10)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s263183861', 's913701942', 's484627610'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [35, 35, 60] |
p02999 | u882359130 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X, A = [int(xa) for xa input().split()]\nif X < A:\n print(0)\nelse:\n print(10)', 'X, A = [int(xa) for xa in input().split()]\nif X < A:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s210564998', 's169501230'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 81] |
p02999 | u883203948 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['w,h,x,y = list(map(int,input().split()))\nans = 0\nif x == 0 and y == 0:\n print(h * w /2 , 0)\nelif x == 0:\n print(h * w /2,0)\nelif y == 0:\n print(h * w / 2, 0)\nelse:\n if x == w /2 and y == h / 2:\n print(h * w /2,1)\n else:\n \n print(h * w /2,0)\n', 'x ,a = list(map(int,in... | ['Runtime Error', 'Accepted'] | ['s618990651', 's501525118'] | [3060.0, 2940.0] | [17.0, 17.0] | [278, 81] |
p02999 | u883307604 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x, a = map(int, input())\nprint(10 if x - a >= 0 else 0)', 'x, a = map(int, input().split())\nprint(10 if x - a >= 0 else 0)'] | ['Runtime Error', 'Accepted'] | ['s306973461', 's794391628'] | [2940.0, 2940.0] | [17.0, 17.0] | [55, 63] |
p02999 | u886571850 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ["s = list(input())\ncount = 0\nfor i in range(len(s)-1):\n if s[i] == s[i+1]:\n count += 1\n\nif count > 0:\n print('Bad')\nelse:\n print('Good')", 'x,a = map(int,input().split())\n\nif x < a:\n print(0)\nelse:\n print(10)'] | ['Wrong Answer', 'Accepted'] | ['s060717924', 's561955117'] | [2940.0, 2940.0] | [17.0, 18.0] | [151, 74] |
p02999 | u886902015 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a=map(int,input().split())\nif x<a:\n print(10)\nelse:\n print(0)', 'x,a=map(int,input().split())\nif x<a:\n print(0)\nelse:\n print(10)\n'] | ['Wrong Answer', 'Accepted'] | ['s453007370', 's191714811'] | [9132.0, 9132.0] | [27.0, 28.0] | [65, 66] |
p02999 | u887886407 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['n, x = map(int, input().split())\nl = list(map(int, input().split()))\nd = 0\nfor i in range(n):\n if d <= x:\n d += l[i]\n else:\n break\nprint(i)', 'x, a = map(int, input().split())\nif x < a :\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s834834404', 's637423110'] | [2940.0, 2940.0] | [28.0, 17.0] | [159, 76] |
p02999 | u893828545 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X=list(map(int,input().split()))[1]\nL=list(map(int,input().split()))\ni=0\nd=0\nwhile True:\n if d>=X:\n break\n else:\n d+= L[i]\n i+= 1\nprint(i+1)', 'N = list(map(int,input().split()))\nif N[0]< N[1]:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s502703954', 's686652981'] | [2940.0, 2940.0] | [18.0, 17.0] | [167, 82] |
p02999 | u894953648 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a=int(input().split())\nif x>=a:print(10)\nelse:print(1)', 'x,a=map(int,input().split())\nif x>=a:print(10)\nelse:print(1)', 'x,a=map(int,input().split())\nif x>=a:print(10)\nelse:print(0)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s002964314', 's971828410', 's775401880'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [56, 60, 60] |
p02999 | u899866702 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X,A = (int(x) for x in input().split())\n\nif x < A:\n print(0)\nelse:\n print(10)', 'X,A = (int(x) for x in input().split())\n \nif X < A:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s377989205', 's342360716'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 80] |
p02999 | u902462889 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['\nX, A = map(int, input.()split())\n\nif X < A:\n print(0)\nelse:\n print(10)', 'X, A = map(int, input().split())\n\nif X < A:\n print(0)\nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s012127760', 's814177229'] | [2940.0, 2940.0] | [17.0, 17.0] | [73, 76] |
p02999 | u904038778 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X,A = [int(x) for x in input().split()]\nprint(10 if x >= A else 0)', 'X,A = [int(x) for x in input().split()]\nprint(10 if X >= A else 0)'] | ['Runtime Error', 'Accepted'] | ['s346447227', 's249937621'] | [2940.0, 3060.0] | [18.0, 19.0] | [66, 66] |
p02999 | u905582793 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['import sys\ninput = sys.stdin.readline\nn = int(input())\nxyd = [list(input().split()) for i in range(n)]\nxmax,ymax = [-10**18,-10**18,-10**18],[-10**18,-10**18,-10**18]\nxmin,ymin = [10**18,10**18,10**18],[10**18,10**18,10**18]\n#xmax: max(x1-t,x2,x3+t)\n#xmin: min(x1+t,x2,x3-t)\n\n\ndef chp(ls,a,flg1,i):\n if flg... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s162866554', 's187442521', 's282480984', 's536937329', 's681293438', 's098057331'] | [3192.0, 3192.0, 3192.0, 3192.0, 3192.0, 2940.0] | [18.0, 19.0, 18.0, 18.0, 18.0, 17.0] | [1144, 1487, 1474, 1157, 1144, 66] |
p02999 | u905730864 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a=map(int,input().split())\nif x>a\n print("0")\nelse x<=a\n print("10")', 'x,a=map(int,input().split())\nprint(0 if x<a else 10)'] | ['Runtime Error', 'Accepted'] | ['s456312452', 's837822815'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 52] |
p02999 | u907223098 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a=(int(i) for i in input().split())\nprint((if(x>=a))*10)', 'x,a=(int(i) for i in input().split())\nt=if(x>=a)\nprint(t*10)', 'x,a=(int(i) for i in input().split())\nif x>=a:\n print(10)\nelse:\n print(0)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s062926875', 's214972049', 's419610731'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [58, 60, 75] |
p02999 | u918845030 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['\ndef input_from_console():\n a, x = map(int, input().split())\n\n return a, x\n\n\ndef solve(a, x):\n result = 0\n if x >= a:\n result = 10\n return result\n\n\ndef main():\n a, x = input_from_console()\n print(solve(a, x))\n\n\nif __name__ == "__main__":\n import sys\n\n if sys.get... | ['Wrong Answer', 'Accepted'] | ['s284031818', 's430628474'] | [3060.0, 2940.0] | [17.0, 17.0] | [411, 406] |
p02999 | u921595858 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['w, h, x, y = map(int, input().split())\n\ns = w * h / 2\nif (x * 2 == w) and (y * 2 == h):\n print(s, 1)\nelse:\n print(s, 0)', 'w, h, x, y = map(int, input().split())\n\ns = w * h / 2\nif (x * 2 == w) and (y * 2 == h):\n print(s, 1)\nelse:\n print(s, 0)', 'w, h, x, y = map(int, input().split())\n\ns = w ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s477191933', 's581636006', 's616418169', 's212506970'] | [3064.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [125, 125, 135, 76] |
p02999 | u923341003 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['W, H, x, y = map(int, input().split())\nif (x == W and y == H) or (x == 0 and y == 0) or (x == W and y == 0) or (x == 0 and y == H):\n print(W*H, 0)\nelse:\n \n A = min((H-y)*W, y*W)\n \n \n B = min((W-x)*H, x*H)\n \n \n \n if A == B:\n print(A, 1)\n else:\n print(max(A, B), 0... | ['Runtime Error', 'Accepted'] | ['s324781128', 's514224329'] | [3064.0, 2940.0] | [17.0, 17.0] | [468, 75] |
p02999 | u926320169 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['# coding: utf-8\n# Your code here!\n\nW,H,x,y = list(map(float,input().split()))\n\n\nif(W%x==0 and H%y==0):\n print (W*H/2,1)\n\nelse:\n print (W*H/2,0)\n', '# coding: utf-8\n# Your code here!\n\nX,A = list(map(int,input().split()))\n\nif X<A:\n print(0)\n \nelse:\n print(10)'] | ['Runtime Error', 'Accepted'] | ['s871373869', 's371835561'] | [2940.0, 2940.0] | [17.0, 17.0] | [151, 119] |
p02999 | u927764913 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a = map(int,input().split())\n if x < a:\n print(0)\n else : \n print(10)', 'x,a = map(int,input().split())\nif x < a:\n print(0)\n else : \n print(10)', 'x,a = map(int,input().split())\nif x < a:\n print(0)\nelse : \n print(10)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s529695470', 's785862081', 's086523450'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [91, 75, 72] |
p02999 | u928784113 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['import itertools\nfrom collections import deque,defaultdict,Counter\nfrom itertools import accumulate\nimport bisect\nfrom heapq import heappop,heappush,heapify\nfrom fractions import gcd\nfrom copy import deepcopy\nimport math\nimport queue\nimport numpy as np\n\nMod = 1000000007\nimport sys\nsys.setrecursionlimit(1... | ['Runtime Error', 'Accepted'] | ['s856613523', 's203501015'] | [13700.0, 2940.0] | [161.0, 17.0] | [2230, 56] |
p02999 | u931394483 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a = map(int,input.split())\nif x < a:\n print("0")\nelse:\n print("10")', 'x,a = map(int,input().split())\nif x < a:\n print("0")\nelse:\n print("10")'] | ['Runtime Error', 'Accepted'] | ['s652354312', 's496768040'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 77] |
p02999 | u932913455 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X, A = (int(x) for x in input().split())\n\nif A < X: \n print(0) ... | ['Wrong Answer', 'Accepted'] | ['s522751011', 's352908746'] | [2940.0, 2940.0] | [17.0, 17.0] | [671, 671] |
p02999 | u934693611 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a=int(input())\nif x<a:\n print(0)\nelse:\n print(10)', 'X,A=map(int,input().split())\nif X>=A:\n print(10)\nelif X<A:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s210891975', 's243925400'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 70] |
p02999 | u935424675 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x=int(input())\na=int(input())\nif x<a:\n print(0)\nelse:\n print(10)', 'x,a=map(int,input().split())\nif x<a:\n print(0)\nelse:\n print(10)\n '] | ['Runtime Error', 'Accepted'] | ['s007016691', 's568352534'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 68] |
p02999 | u940332739 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X, A = map(int,input.sprit())\n\n\nif X > A:\n print("10")\n else:\n print("0")', '\nX, A = map(int,input().split())\n\n\nif X < A:\n print("0")\nelse:\n print("10")\n'] | ['Runtime Error', 'Accepted'] | ['s930650761', 's880699053'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 82] |
p02999 | u952130512 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a=list(map(int,input().split()))\nif a[1]<a[0]:\n \tprint(0)\nelse:\n \tprint(10)', 'x,a=(int(i) for i in input().split())\nif x<a:\n\tprint(0)\nelse:\n \tprint(10)'] | ['Wrong Answer', 'Accepted'] | ['s919599132', 's073839414'] | [2940.0, 3316.0] | [17.0, 19.0] | [77, 74] |
p02999 | u952467214 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['N,X=map(int, input().split()) \nL=list(map(int, input().split())) \nD = 0\nfor i in range(N+1):\n D = D + L[i]\n if D > X:\n print(i+1)\n break\n', '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 print(L[i])\n if D > X:\n print(i+1)\n br... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s313081296', 's549454963', 's882605752', 's717247307'] | [3064.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [145, 195, 70, 70] |
p02999 | u956910277 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x ,y = int(i) for i in input().split()\nif x < y:\n print(0)\nelse:\n print(10)\n\t', "n , k = [int(i) for i in input().split()]\nif n < k:\n\tprint('0')\nelse:\n\tprint('10')"] | ['Runtime Error', 'Accepted'] | ['s178213761', 's203574043'] | [2940.0, 2940.0] | [17.0, 18.0] | [79, 82] |
p02999 | u960317355 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a = map(int,input().split())\n if x < a:\n print(0)\n else : \n print(10)', 'x,a = map(int,input().split())\nif x < a:\n print(0)\n else : \n print(10)', 'x,a = map(int,input().split())\nif x < a:\n print(0)\nelse : \n print(10)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s500163129', 's662537171', 's377234322'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [91, 75, 71] |
p02999 | u960387251 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x ,a = map(int, input().split())\nif x < a:\n\tprint(0)\nelif:\n\tprint(10)', 'x ,a = map(int, input().split())\nif x < a:\n\tprint(0)\nelse:\n\tprint(10)'] | ['Runtime Error', 'Accepted'] | ['s191217148', 's354347865'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 70] |
p02999 | u960513073 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['a,b = list(map(int, input()split()))\nif a>=b:\n print(10)\nelse:\n print(0)', 'a,b = list(map(int, input()split()))\nif a>=b:\n print(19)\nelse:\n print(0)', 'a,b = list(map(int, input().split()))\nif a>=b:\n print(10)\nelse:\n print(0)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s258675591', 's679960180', 's112128189'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [74, 74, 75] |
p02999 | u963963908 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['#ABC130 B\n\nN,X = map(int,input().split())\nL = list(map(int,input().split()))\nD = [0,L[0]]\ncount = 0\nfor i in range(2,N+2):\n D.append(D[i-1]+L[i-2])\nfor i in range(0,N+2):\n if D[i]<= X:\n count += 1\n\nprint(count)', '#ABC130 A\n\nX,A = map(int,input().split())\nif X < A:\n print(0)\nelse:\n ... | ['Runtime Error', 'Accepted'] | ['s801562454', 's632456981'] | [9084.0, 9056.0] | [24.0, 25.0] | [223, 84] |
p02999 | u965602776 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['l = list(map(int, input().split()))\nprint(min(sum((l+[l[0]])[i:i+2]) for i in range(3)))', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nprint(1+sum(i <= x for i in [sum(l[0:i]) for i in range(n)]))', 'n, x = map(int, input().split())\nl = list(map(int, input().split()))\nprint(1+sum(i <= x... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s200796868', 's664887751', 's878517011', 's149984715'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 18.0] | [88, 130, 132, 54] |
p02999 | u968258816 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ["x, a = list(input())\nprint('100'[x >= a::2])\n", "x, a = map(int, input().split())\nprint('100'[x >= a::2])\n", "x, a = list(input())\nprint('100'[if x >= a::2])", "x, a = map(int, input().split())\nprint(int('100'[x >= a::2]))\n", "x, a = map(int, input().split())\nprint(int('100'[x < a::2]))\n"] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s110286285', 's130382079', 's884558993', 's955090140', 's311311566'] | [2940.0, 2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [45, 57, 47, 62, 61] |
p02999 | u970197315 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x=int(input())\na=int(input())\n\nif x<a:\n print(0)\nelse:\n print(10)', 'x,a=int(input().split())\n\nif x<a:\n print(0)\nelse:\n print(10)\n', 'a=int(input())\nx=int(input())\nif x<10:\n print(0)\nelse:\n print(10)', 'x,a=map(int,input().split())\n\nif x<a:\n print(0)\nelse:\n print(10)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s193973294', 's376034762', 's864196441', 's425442390'] | [2940.0, 2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0, 17.0] | [67, 63, 67, 67] |
p02999 | u980783809 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ["x,a=map(int, input.split())\nprint('10' if x>=a else '0')", 'x,a=map(int, input.split())\nprint(10 if x>=a else 0)', "x,a=map(int, input().split())\nprint('10' if x>=a else '0')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s248236315', 's658841268', 's721276947'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [56, 52, 58] |
p02999 | u986506826 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X = input()\nA = input()\n\nx = int(X)\na = int(A)\n\nif x < a:\n print(0)\n\nelif a > x:\n print(10)', 'X = input()\nA = input()\n\nx = int(X)\na = int(A)\n\nif x < a:\n print(0)\n\nelif a <= x:\n print(10)', '# coding: utf-8\n\nX = input()\nA = input()\n\nx = int(X)\na = int(A)\n\nif x < a:\n print(0... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s060707069', 's074911308', 's222066628', 's456113546', 's464739366', 's597391726', 's678667807', 's697046236', 's697762906', 's984116483', 's099584985'] | [2940.0, 2940.0, 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, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [97, 98, 115, 76, 98, 115, 73, 98, 66, 92, 106] |
p02999 | u987001487 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['import numpy as np\n\nk = 0\n\n\ndef calc(a):\n return np.sum(a) >= k\n\n\ndef main():\n global k\n n, k = map(int, input().split())\n a = np.array(list(map(int, input().split())))\n answer = 0\n list_pattern = []\n for i1 in range(n):\n for i2 in range(len(a)):\n list_pattern.a... | ['Runtime Error', 'Accepted'] | ['s467626469', 's646082038'] | [12480.0, 2940.0] | [149.0, 17.0] | [504, 123] |
p02999 | u987170100 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['W, H, x, y = map(int, input().split())\n\ns = W * H\nif x == 0:\n a = W * y\n b = W * (H - y)\n p = 1 if a == b else 0\nelif y == 0:\n a = H * x\n b = H * (W - x)\nelif W % x == 0 and H % y == 0:\n a = b = W * H // 2\nelse:\n a = W * y\n b = H * x\n\np = 1 if a == b else 0\nprint("{0} {1}".for... | ['Runtime Error', 'Accepted'] | ['s587411323', 's615914626'] | [3064.0, 2940.0] | [17.0, 17.0] | [320, 76] |
p02999 | u987637902 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['# A Rounding\nx, a = map(int, input())\nif x < a:\n print(0)\nelse:\n print(1o)\n', 'x, a = map(int, input())\nif x < a:\n print(0)\nelse:\n print(10)\n', '# A Rounding\n\nx, a = map(int, input().split())\nif x < a:\n print(0)\nelse:\n print(10)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s626190512', 's947229710', 's599822715'] | [8960.0, 9012.0, 9176.0] | [24.0, 22.0, 27.0] | [81, 68, 90] |
p02999 | u991269553 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a = map(int,input().split())\nif a > x:\n print(10)\nelse:\n print(0)', "x,a = map(int,input().split())\nif a > x:\n print('10')\nelse:\n print('0')", 'x,a = map(int,input().split())\nif a > x:\n print(0)\nelse:\n print(10)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s086689196', 's862896873', 's252012957'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0] | [73, 77, 73] |
p02999 | u996434204 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['x,a=map(int,input())\n\nif x < a:\n print(0)\nelse:\n print(10)\n', 'x,a=map(int,input().split())\n\nif x < a:\n print(0)\nelse:\n print(10)\n'] | ['Runtime Error', 'Accepted'] | ['s714157189', 's090938285'] | [2940.0, 2940.0] | [17.0, 17.0] | [65, 73] |
p02999 | u999194201 | 2,000 | 1,048,576 | X and A are integers between 0 and 9 (inclusive). If X is less than A, print 0; if X is not less than A, print 10. | ['X,A=input().split()\nif x>=A:\n print(10)\nelse:\n print(0)\n ', 'X,A=input().split()\nif int(X)>=int(A):\n print(10)\nelse:\n print(0)'] | ['Runtime Error', 'Accepted'] | ['s740156467', 's936707157'] | [2940.0, 2940.0] | [18.0, 17.0] | [59, 67] |
p03000 | u000085263 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N, val= list(map(int,input().split()))\nlist = list(map(int,input().split()))\nd=0\nl=[]\nfor i in list:\n ans=d+i\n l.append(ans)\ncount=0\nfor num in l:\n if num<=val:\n count=count+1\nprint(count)', 'N, val= list(map(int,input().split()))\nlist = list(map(int,input().split()))\nd=0\nl=[]\nfor i in list:\n d... | ['Wrong Answer', 'Accepted'] | ['s422873597', 's230253694'] | [9104.0, 9184.0] | [27.0, 29.0] | [194, 192] |
p03000 | u003501233 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\ncnt=0\n\nans=1\n\nfor i in range(n):\n cnt += i\n if cnt <= x:\n ans += 1\n else:\n break\nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\n\n\ncnt=0\n\nans=1\n\nfor i in l:\n cnt += i\n if cnt <= x:\n ans +... | ['Wrong Answer', 'Accepted'] | ['s135703744', 's274505846'] | [3060.0, 3060.0] | [17.0, 20.0] | [230, 223] |
p03000 | u007263493 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n , x = map(int,input().split())\nL =list(map(int,input().split()))\nans = 1\nD = [0]*(n+1)\nfor i in range(2,n+2):\n D[i] = D[i-1] + L[i-2]\n if D[i] <=x:\n ans+=1\nprint(ans)', 'n , x = map(int,input().split())\nL =list(map(int,input().split()))\nans = 1\nD = [0]*(n+2)\nfor i in range(2,n+2):\n D[i]... | ['Runtime Error', 'Accepted'] | ['s005378153', 's599425098'] | [3060.0, 3060.0] | [17.0, 17.0] | [181, 181] |
p03000 | u007550226 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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()))\nprint(l)\nd = preD = 0\ni = 0\nfor i in range(N):\n d = preD + l[i]\n preD = d\n print(i+1,d)\n if d == X:\n print(i+2)\n break\n elif d > X:\n print(i+1)\n break\nelse:\n print(N+1)', 'N,X = map(int,inpu... | ['Wrong Answer', 'Accepted'] | ['s325965699', 's356724442'] | [3064.0, 3064.0] | [17.0, 17.0] | [280, 282] |
p03000 | u016622494 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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(input())\ncnt = 1\nb = 0\nlst = list()\nfor i in range(N + 1):\n if int(len(L) / 2) + 1 > i :\n lst.append(int(L[i*2]))\n else :\n break\nfor j in range (N + 1):\n print(b)\n b += lst[j]\n cnt += 1\n if b+lst[j+1] > X :\n break\n i... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s043822662', 's323044560', 's672966429', 's876403283', 's372870664'] | [3064.0, 3064.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 17.0, 18.0] | [339, 330, 330, 282, 181] |
p03000 | u018679195 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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(input().split())\nd = 0\ni = 0\nwhile d <= int(x) and i<int(n):\n d+=int(L[i])\n i+=1\nif d > x:\n print(i)\nelse:\n print(i+1)\n', 'a, b = map(int, input().split())\nl = list(map(int, input().split()[:a]))\nres = 1\nd = 0\nres= [0]\nfor item in l:\n res.append(d + item)\n... | ['Runtime Error', 'Accepted'] | ['s575301690', 's844805247'] | [2940.0, 3060.0] | [17.0, 17.0] | [160, 225] |
p03000 | u021548497 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nL = [int(x) for x in input().split()]\n\nD = [0]*(n+1)\nfor i in range(n):\n D[i+1] = D[i]+L[i]\n if D[i+1] > x:\n print(i+1)\n break\nprint(n+1)', 'n, x = map(int, input().split())\nL = [int(x) for x in input().split()]\n\nD = [0]*(n+1)\nfor i in range(n):\n D... | ['Wrong Answer', 'Accepted'] | ['s214144309', 's843238935'] | [3060.0, 3060.0] | [17.0, 17.0] | [190, 215] |
p03000 | u023141436 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nd = 0\nc = 1\nfor i in l:\n\td = d + i\n\tif d>x:\n\t\tprint(c)\n\t\tbreak\n\telse:\n\t\tc+=1\nprint(c)', 'n,x = map(int,input().split())\nl = [int(i) for i in input().split()]\n\nd = 0\nc = 1\nfor i in l:\n\td = d + i\n\tif d>x:\n\t\tprint(c)\n... | ['Wrong Answer', 'Accepted'] | ['s138534817', 's574341620'] | [2940.0, 2940.0] | [17.0, 17.0] | [155, 156] |
p03000 | u023229441 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,disup=map(int,input().split())\nA=list(map(int,input().split()))\ndis=0\nans=0\nfor i in A:\n dis+=i\n if dis>disup:\n print(ans)\n exit()\n if dis==disup:\n print(ans+1)\n exit()\n ans+=1\n', 'n,disup=map(int,input().split())\nA=list(map(int,input().split()))\ndis=0\nans=1\nfor i in A:\n dis+=i\n ... | ['Wrong Answer', 'Accepted'] | ['s232321742', 's042515034'] | [2940.0, 3060.0] | [17.0, 18.0] | [195, 205] |
p03000 | u027076164 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nb = 0\nfor val in L:\n if b<=X:\n a += 1\n b += val\n else:\n break\nprint(a-1)', 'N,X = map(int,input().split())\nL = list(map(int,input().split()))\na = 0\nb = 0\nc = [0]\nd = []\nfor val in L:\n a += 1\n b += val\n c.append(b)... | ['Wrong Answer', 'Accepted'] | ['s139944939', 's284048038'] | [3064.0, 3064.0] | [18.0, 18.0] | [155, 195] |
p03000 | u027929618 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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]*(n+1)\nans=0\nfor i in range(n):\n d[i+1]=d[i]+int(input())\nfor i in range(n):\n if d[i]<=x:\n ans+=1\nprint(ans)\n', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nd=0\ncnt=0\nfor i in range(n):\n cnt+=1\n if x<d:\n break\n d+=l[i]\nprint(cnt)', 'n,x=... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s114070569', 's405539520', 's941316515'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [148, 140, 175] |
p03000 | u030711473 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['# B - Bounding\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 0\n\nfor i, l in enumerate(L, 1):\n D += l\n if D > X:\n print(i)\n break\nprint(N+1)', '# B - Bounding\nN, X = map(int, input().split())\nL = list(map(int, input().split()))\nD = 0\n\nfor i, l in enumerate(... | ['Wrong Answer', 'Accepted'] | ['s353468106', 's187599061'] | [2940.0, 3064.0] | [18.0, 17.0] | [186, 187] |
p03000 | u030726788 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nc = 1\nfor i in l:\n d += i\n if(c <= x):c += 1\n else:break\nprint(c)', 'n,x = map(int,input().split())\nl = list(map(int,input().split()))\n\nd = 0\nc = 1\nfor i in l:\n d += i\n if(d <= x):c += 1\n else:break\nprint(c)\n... | ['Wrong Answer', 'Accepted'] | ['s394762217', 's451322878'] | [2940.0, 2940.0] | [17.0, 18.0] | [147, 148] |
p03000 | u033524082 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\npop=0\nfor i in range(n):\n if(pop>x):\n break\n pop+=l[i]\n ans+=1\nprint(ans)', 'n,x=map(int,input().split())\nl=list(map(int,input().split()))\nans=0\npop=0\ni=0\nwhile(pop<=x or i<n):\n pop+=l[i]\n ans+=1\n i+=1\nprint... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s089947525', 's408717239', 's329729056'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [157, 144, 152] |
p03000 | u034243122 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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]\nfor i in range(1,len(L)+1):\n dd=d[i-1]+L[i-1]\n d.append(dd)\nfor j in range(len(d)):\n if d[j]<=x:\n num+=1\nprint (num)', 'n,x= [int(i) for i in input().split()]\nL=[int(i) for i in input().split()]\nd=[0]\nfor i in... | ['Runtime Error', 'Accepted'] | ['s152004254', 's391141958'] | [3064.0, 3064.0] | [21.0, 18.0] | [213, 219] |
p03000 | u036340997 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n, x = map(int, input().split())\nl = [int(x) for x in input().split()]\n\nd = 0\nfor i in range(len(l)):\n d += l[i]\n if d > x:\n print(i)\n break\nelse:\n print(len(l))', 'n, x = map(int, input().split())\nl = [int(x) for x in input().split()]\n\nd = 0\nfor i in range(len(l)):\n d += l[i]\n if d > x:\n ... | ['Wrong Answer', 'Accepted'] | ['s923334941', 's982124145'] | [3060.0, 2940.0] | [17.0, 17.0] | [170, 172] |
p03000 | u037010864 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 a = [int(i) for i in input().split()]\n pref = [0, a[0]]\n for i in range(1, n): pref.append(a[i] + pref[i - 1])\n ans = 0\n for val in pref:\n if val > x:\n break\n ans += 1\n print(ans)\n\n\nmain()\n', 'def main():\n n... | ['Wrong Answer', 'Accepted'] | ['s228432856', 's652439861'] | [3060.0, 3064.0] | [18.0, 17.0] | [282, 278] |
p03000 | u037221289 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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(' ')))\nnum = 0\nD = 0\nfor i in range(N):\n D = L[i] + D\n if D <= X:\n num += 1\nprint(num)", "N,X = map(int,input().split(' '))\nL = list(map(int,input().split(' ')))\nnum = 1\nD = 0\nfor i in range(N):\n D = L[i] + D\n if D <= X:\n num +=... | ['Wrong Answer', 'Accepted'] | ['s053262381', 's484352842'] | [3060.0, 3060.0] | [17.0, 17.0] | [156, 156] |
p03000 | u040141413 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nfor i in range(n):\n if D>x:\n print(count)\n break\n elif D=0:\n count+=1\n print(count)\n break\n else:\n D=D+L[i] \n count+=1\n', 'n,x=map(int,input().split())\nL = list(map... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s530869354', 's592652725', 's603908611', 's605763857', 's610926081', 's756258256', 's800709695', 's890630169', 's996932435', 's902033357'] | [2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 17.0, 19.0, 17.0, 17.0] | [257, 200, 187, 216, 179, 186, 186, 183, 197, 166] |
p03000 | u040537497 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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()))\n\ncount = 1\n\ncurrent = 0\n\nfor l in l_list:\n current += l\n count += 1\n if current > x:\n print(count - 1)\n exit(1)\n\n print(count)\n', 'n, x = map(int, input().split())\nl_list = list(map(int, input().split()... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s249543789', 's633893960', 's132401278'] | [3060.0, 3060.0, 3060.0] | [18.0, 17.0, 18.0] | [227, 226, 283] |
p03000 | u046158516 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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()))\ntotal=0\nfor i in range(n):\n if total>x:\n break\n total+=a[i]\nif total==sum(a):\n print(n+1)\nelse:\n print(i+1)', 'n,m=map(int,input().split())\na=list(map(int,input().split()))\nans=0\nfor i in range(n):\n ans+=a[i]\n if ans>m:\n break\n... | ['Wrong Answer', 'Accepted'] | ['s004297768', 's403687276'] | [3060.0, 3060.0] | [17.0, 17.0] | [176, 163] |
p03000 | u046187684 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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 accumulate\n\n\ndef solve(string):\n n, x, *l = map(int, string.split())\n return str(len(list(filter(lambda a: a <= x, list(accumulate(l))))) + 1)\n\n\nif __name__ == '__main__':\n print(solve(input()))\n", 'N, X = map(int, input().split())\nL = list(map(int, input().split()))\n\nbounc... | ['Wrong Answer', 'Accepted'] | ['s092967142', 's959302415'] | [3060.0, 2940.0] | [17.0, 17.0] | [226, 192] |
p03000 | u049739819 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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()]\nsum=int(0)\ncount = int(0)\n\nwhile count<n && sum+l[count]<=x:\n sum=sum+l[count]\n count=count+1\n\nprint(count+1)\n', '[n,x]=[int(i) for i in input().split()]\nl=[int(i) for i in input().split()]\nsum=int(0)\ncount = int(1)\n\nwhil... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s590923791', 's656808765', 's589060556'] | [2940.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [192, 216, 193] |
p03000 | u052640789 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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 = input()\nans = 1\ncnt = 0\n\nl_list = l.split(' ')\n\nfor i in l_list:\n cnt += i\n if cnt > x:\n break\n ans += 1\n\nprint (ans)\n", "n, x = list(map(int, input().split()))\nl = input()\nans = 1\ncnt = 0\n\nl_list = l.split(' ')\n\nfor i in l_list:\n cnt... | ['Runtime Error', 'Accepted'] | ['s569874396', 's085845546'] | [2940.0, 2940.0] | [17.0, 17.0] | [177, 182] |
p03000 | u057993957 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nd = [0]\ntotal = 0\nfor i in range(n):\n total += l[i]\n d.append(total)\n \nfor i in range(n):\n if x < l[i]:\n print(i)\n quit()\n ', 'n, x = list(map(int, input().split()))\nl = list(map(int, input().split()))\n\nd = [... | ['Wrong Answer', 'Accepted'] | ['s437873280', 's885938081'] | [3060.0, 3064.0] | [17.0, 18.0] | [217, 229] |
p03000 | u060432908 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['N,X=map(int,input().split())\nL=list(map(int,input().split()))\nD=0\ni=0\ns=0\nwhile D<=X or i<N:\n D+=L[i]\n s+=1\n i+=1\nprint(s)', "S=lambda:input()\nI=lambda:int(input())\nL=lambda:list(map(int,input().split()))\nLS=lambda:list(map(str,input().split()))\n\ndef main():\n n,x=L()\n l=L()\n ans=1\n d=... | ['Runtime Error', 'Accepted'] | ['s330412558', 's911289894'] | [2940.0, 3064.0] | [17.0, 17.0] | [125, 302] |
p03000 | u072606168 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['n,x = map(int, input().split())\nl = [0] + list(map(int, input().split()))\nm = 0\nd = 0\ni = 1\nwhile d <= x:\n d += l[i]\n i += 1\n if n+1 <= i:\n i = None\n break\nif i = None:\n print(n+1)\nelse:\n print(i-1)', 'n,x = map(int, input().split())\nl = [0] + list(map(int, input().split()))\nd = 0\ni = 0\nc... | ['Runtime Error', 'Accepted'] | ['s173259778', 's880941587'] | [2940.0, 3064.0] | [17.0, 17.0] | [209, 215] |
p03000 | u073561877 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\ninpt = sys.stdin.readline\n\ndef count(N, X, Ls):\n curr = 0\n for i in range(N):\n l_im1 = Ls[i]\n curr += l_im1\n if curr > X:\n return i\n return N\n\nN, X = [int(d) for d in inpt().strip().split()]\nLs = [int(d) for d in inpt().strip().split()]\nprint(count(N, X, Ls))', 'import sys\ni... | ['Wrong Answer', 'Accepted'] | ['s709348610', 's308869260'] | [3060.0, 3060.0] | [17.0, 17.0] | [287, 323] |
p03000 | u074338678 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nc = 0\nfor i in range(n):\n d += l[i]\n if d < x:\n c += 1\n else:\n break\n \nprint(c)', 'n, x = map(int, input().split())\nl = map(int, input().split())\n\nd = 0\nc = 0\nfor i in range(n):\n d += l[i]\n if d < x:\n c +=... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s032698666', 's905221856', 's602301157'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [167, 161, 152] |
p03000 | u077498363 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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 = [i for i in map(int, input().split(' '))]\nsum, bound = 0, 0\nfor i in range(0, n):\n sum += ls[i]\n if sum > x:\n break\n else:\n bound = i+1\nprint(bound)", "n, x = map(int, input().split(' '))\nls = [i for i in map(int, input().split(' '))]\nsum, bou... | ['Wrong Answer', 'Accepted'] | ['s513812918', 's487397284'] | [3064.0, 3060.0] | [17.0, 17.0] | [212, 211] |
p03000 | u078181689 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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())\ndifs = list(map(int, input().split()))\nsteps = [0]\nfor i in range(N):\n steps.append(steps[i] + difs[i])\nfor i in range(N+1):\n if steps[i] > X:\n print(i)\n elif i == N:\n print(N+1)', 'N ,X = map(int, input().split())\ndifs = list(map(int, input().split())... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s149636155', 's838777616', 's938832590', 's088016636'] | [3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [234, 232, 234, 248] |
p03000 | u080364835 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}. How many times will the ball make a bounce where the coordinate is at most X? | ['import itertools\nimport bisect\n\nn, x = map(int, input().split())\nll = list(map(int, input().split()))\n\ndl = [0] + list(itertools.accumulate(ll))\n\nprint(bisect.bisect_right(ll, x))', 'import itertools\nimport bisect\n\nn, x = map(int, input().split())\nll = list(map(int, input().split()))\n\ndl = [0] + list(it... | ['Wrong Answer', 'Accepted'] | ['s333314904', 's911872475'] | [9196.0, 8956.0] | [31.0, 29.0] | [179, 179] |
p03000 | u081688405 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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\nbounce = [0] + [ sum(ls[:i]) for i in range(1, len(ls)+1) ]\n\nprint(bounce)\nfor i, v in enumerate(bounce):\n if v > x:\n print(i)\n break\nelse:\n print(len(bounce))', 'n, x = map(int, input().split())\nls = list(map(int, input().spli... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s006793982', 's422198995', 's443335526'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [238, 186, 225] |
p03000 | u082861480 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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()]\npre = 0\nres = 0\nfor i in range(n):\n res += 1\n if pre > x:\n print(res)\n break\n pre += l[i]', 'n,x = map(int,input().split())\nl = [int(i) for i in input().split()]\npre = 0\nres = 1\nfor i in range(n):\n pre += l[i]\n if pre > x:\... | ['Wrong Answer', 'Accepted'] | ['s322836260', 's197178706'] | [2940.0, 2940.0] | [17.0, 17.0] | [167, 165] |
p03000 | u084890719 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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\ndef main():\n n, x = map(int, input().split())\n lst = [input() for i in range(n)]\n print(n, x)\n print(lst)\n\n d = []\n for i in range(n + 1):\n if i == 0:\n d.append(0)\n else:\n d.append(d[i - 1] + int(lst[i - 1]))\n print(d)\n... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s104684455', 's104970964', 's657135244', 's632347610'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0] | [478, 499, 492, 455] |
p03000 | u088608223 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate D_i = 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()))\nk=1\nd=0\n\nwhile d<=x:\n if n<=k:\n break\n else:\n d=d+l[k-1]\n k=k+1\n \nif n+1<k:\n print(n+1)\nelse:print(k)\n ', 'n,x = (int(x) for x in input().split())\nl=list(map(int,input().split()))\nk=0\nd=0\n\nwhile d<=x:\n if l... | ['Wrong Answer', 'Accepted'] | ['s955019852', 's857608700'] | [2940.0, 3064.0] | [17.0, 17.0] | [192, 188] |
p03000 | u094102716 | 2,000 | 1,048,576 | A ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \leq i \leq N+1) at coordinate 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()))\nc = 0\nd = 0\nfor i in b:\n d += i\n if d <= a[1]:\n c += 1\nprint(c)', 'a = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = 1\nd = 0\nfor i in b:\n d += i\n if d <= a[1]:\n c += 1\nprint(c)\n'] | ['Wrong Answer', 'Accepted'] | ['s937970776', 's450201535'] | [9080.0, 9060.0] | [27.0, 27.0] | [138, 139] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.