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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02970 | u693933222 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | [' n,b = map(int,input().split())\n \n print(n //(b*2))\n \n ', 'n,b = map(int,input().split())\n \nprint(n //(b*2))\n \n ', 'n,b = map(int,input().split())\n \nprint(-(-n//(b*2 +1)))\n \n '] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s668066959', 's889473509', 's554796214'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 19.0] | [55, 53, 59] |
p02970 | u693953100 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = map(int,input().split())\nans = n/(2*d)\nif n%(2*d):\n ans+=1\nprint(ans)', 'n,d = map(int,input().split())\nans = n//(2*d+1)\nif n%(2*d+1):\n ans+=1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s327122024', 's194365858'] | [2940.0, 2940.0] | [17.0, 18.0] | [78, 84] |
p02970 | u695474809 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D=map(int,input().split())\nprint(math.ceil(N/(2*D+1)))\n', 'import math\nN,D=map(int,input().split())\nprint(math.ceil(N/(2*D+1)))\n'] | ['Runtime Error', 'Accepted'] | ['s651909418', 's347995161'] | [8996.0, 8992.0] | [23.0, 29.0] | [57, 69] |
p02970 | u696486967 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d=int(input().split())\ncnt=1\nwhile True:\n if (2*d+1)*cnt>=n:\n print(cnt)\n break\n \n cnt+=1\n \n ', 'n, d=input().split()\nni=int(n)\ndi=int(d)\ncnt=1\nwhile True:\n if (2*di+1)*cnt>=ni:\n print(cnt)\n break\n \n cnt+=1\n \n '] | ['Runtime Error', 'Accepted'] | ['s861780170', 's773541107'] | [2940.0, 2940.0] | [17.0, 17.0] | [107, 124] |
p02970 | u696919316 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nn, k = list(map(int, input().split()))\nprint(math.ceil(n // (2 * k)))', 'import math\nn, k = list(map(int, input().split()))\nprint(math.ceil(n / (2 * k + 1)))'] | ['Wrong Answer', 'Accepted'] | ['s158644497', 's201977858'] | [9132.0, 9152.0] | [30.0, 28.0] | [81, 84] |
p02970 | u697696097 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d=map(int,inpit().split())\nx=2*d+1\nprint((d+x-1)//x)', 'n,d=map(int,input().split())\nx=2*d+1\nprint((n+x-1)//x)'] | ['Runtime Error', 'Accepted'] | ['s461477097', 's517901912'] | [9008.0, 9124.0] | [27.0, 25.0] | [54, 54] |
p02970 | u698416089 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = list(map(int,input().split()))\nmireru = 2*d+1\nprint(mireru)\nprint(int((n-(n%mireru))/mireru+int(n%mireru != 0)))', 'n,d = list(map(int,input().split()))\nmireru = 2*d+1\nprint(int((n-(n%mireru))/mireru+int(n%mireru != 0)))'] | ['Wrong Answer', 'Accepted'] | ['s373547643', 's231241147'] | [2940.0, 2940.0] | [17.0, 18.0] | [118, 104] |
p02970 | u698919163 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = list(map(int,input().split()))\nhuman = 1\nkanshi = 2*D+1\nhaniwhile hani < N:\n hani = hani + kanshi\n human +=1\n \nprint(human) = kanshi\n', 'N,D = list(map(int,input().split()))\nhuman = 1\nhani = 2*D+1\nhaniwhile hani < N:\n hani = hani + (2*D+1)\n human +=1\n \nprint(human) = kanshi\n', ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s358724839', 's508843169', 's885985100', 's931679815', 's966305541'] | [2940.0, 2940.0, 2940.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 17.0] | [148, 147, 143, 137, 133] |
p02970 | u699101754 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['a,b=map(int,input().split())\nprint(a//(2*b+1))', 'a,b=map(int,input().split())\nx=a//(2*b+1)\nif a%(2*b+1)!=0:\n x=x+1\nprint(x) '] | ['Wrong Answer', 'Accepted'] | ['s326552900', 's691812172'] | [2940.0, 2940.0] | [17.0, 18.0] | [46, 77] |
p02970 | u703890795 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\nprint(N//(2*D+1.001) + 1)', 'N, D = map(int, input().split())\nprint(N//(2*D+1))', 'N, D = map(int, input().split())\nprint(int(N//(2*D+1.001) + 1))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067062166', 's079998502', 's378298911'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [58, 50, 63] |
p02970 | u712868001 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\nB=2*D\nA=N//2B+1\nprint(A)', 'N, D = map(int, input().split())\nA=N//2D+1\nprint(A)', 'N, D = map(int, input().split())\nB=2*D+1\nif N % B == 0:\n A=N//B\nelse:\n A=N//B+1\nprint(A)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s389381260', 's761056221', 's132837168'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [57, 51, 90] |
p02970 | u718411265 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D=list(map(int,input().split()))\nprint(N//(1+2D))', 'N,D=list(map(int,input().split()))\nprint(N//(1+2*D))', 'N,D=list(map(int,input().split()))\nprint(N//(1+2D))', 'N,D=list(map(int,input().split()))\nif N%(1+2*D)==0:\n print(N//(1+2*D))\nelse:\n print(N//(1+2*D)+1)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s412102924', 's681378887', 's689889030', 's020906835'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [51, 52, 51, 99] |
p02970 | u719886494 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n = int(input())\nd = int(input())\ni = (d * 2) + 1\nif n % i == 0 :\n print(n / i)\nelse :\n print((n // i) + 1)\n', 'n = int(input())\nd = int(input())\ni = (d * 2) + 1\nif n % i == 0 :\n print(n // i)\nelse :\n print((n // i) + 1)\n', 'n = int(input())\nd = int(input())\ni = (d * 2) + 1\nif n % i == 0 :\n pri... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s012965709', 's834511473', 's836642582', 's429241679'] | [2940.0, 2940.0, 2940.0, 3064.0] | [18.0, 17.0, 19.0, 17.0] | [110, 111, 107, 110] |
p02970 | u720065198 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN, D=map(int,input().split())\nprint(math.ceil(N//((D*2)+1)))', 'import math\nN, D=map(int,input().split())\nprint(math.ceil(N/((D*2)+1)))'] | ['Wrong Answer', 'Accepted'] | ['s790287103', 's021940345'] | [3064.0, 2940.0] | [18.0, 17.0] | [72, 71] |
p02970 | u722811088 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['# coding: utf-8\n# Your code here!\n\nN,D = map(int,input().split(" "))\n\n\npreans = N/(2*D + 1)\n\nprint(preans)\n\nif preans == N//(2*D + 1) :\n print(preans)\n \nelse:\n print(preans+1)', 'N,D = map(int,input().split(" "))\n\nans = N//D + 1', '# coding: utf-8\n# Your code here!\n\nN,D = map(int,input().s... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s136323442', 's155822791', 's856319700', 's912762697', 's990340322'] | [2940.0, 2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 20.0, 17.0, 17.0, 18.0] | [184, 49, 185, 159, 160] |
p02970 | u729119068 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\na,b=map(int,input().split())\nprint(math.ceil(a/(2b+1)))\n', 'import math\na,b=map(int,input().split())\nprint(math.ceil(a/(b*2+1)))'] | ['Runtime Error', 'Accepted'] | ['s735836863', 's201598279'] | [8804.0, 9152.0] | [26.0, 27.0] | [68, 68] |
p02970 | u729133443 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d=map(int,input().split());print(0--n//d-~d)', 'n,d=map(int,input().split());print(0--n//(d-~d))'] | ['Wrong Answer', 'Accepted'] | ['s636633873', 's789451981'] | [2940.0, 2940.0] | [18.0, 17.0] | [46, 48] |
p02970 | u729300713 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\nif n%(2*d+1) == 0:\n print(n/(2*d+1))\nelse:\n print((n/(2*d+1)+1)', 'n, d = map(int, input().split())\nif n%(2*d+1) == 0:\n print(int(n/(2*d+1)))\nelse:\n print(int((n/(2*d+1)))+1)\n'] | ['Runtime Error', 'Accepted'] | ['s237128434', 's069106789'] | [2940.0, 2940.0] | [17.0, 17.0] | [98, 110] |
p02970 | u730710086 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['# -*- coding: <encoding name> -*-\n\nimport math\nn, d = map(int, input())\nrange = d * 2 + 1\nprint(math.ceil(n / range))', '# -*- coding: <encoding name> -*-\n\nimport math\nn, d = map(int, input().split())\nrange = d * 2 + 1\nprint(math.ceil(n / range))'] | ['Runtime Error', 'Accepted'] | ['s394697580', 's003641876'] | [2940.0, 2940.0] | [18.0, 17.0] | [117, 125] |
p02970 | u730751996 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D=map(int,input().split())\nprint(N)\nprint(D)\nimport math\nprint(N/(1+2*D))\nmath.ceil(N/(1+2*D))', 'N,D=map(int,input().split())\nprint(N)\nprint(D)\nimport math\nprint(N/(1+2*D))\nmath.ceil(N/(1+2*D)', 'N,D=map(int,input().split())\n\nimport math\n\nprint(math.ceil(N/(1+2*D)))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s104283012', 's248149957', 's817598450'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [96, 95, 70] |
p02970 | u733814820 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\n\nfor i in range(N):\n if N - (2*D + 1)*i <= 0:\n print(i)\n break\n\nprint(N)\n', 'import sys\n\nN, D = map(int, input().split())\n\nfor i in range(N):\n if N - (2*D + 1)*i <= 0:\n print(i)\n sys.exit(0)\n\nprint(N)\n'] | ['Wrong Answer', 'Accepted'] | ['s834825059', 's991264556'] | [2940.0, 2940.0] | [17.0, 17.0] | [123, 141] |
p02970 | u736524428 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int,input())\n\nwatch = D * 2 + 1\n\nans = ( N + watch - 1 ) // watch\n\nprint(ans)', 'N, D = map(int,input().split())\n \nwatch = D * 2 + 1\n \nans = ( N + watch - 1 ) // watch\n \nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s181039265', 's963510103'] | [2940.0, 2940.0] | [18.0, 17.0] | [88, 99] |
p02970 | u739959951 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nn,d=map(int,input().split())\nprint(math.ceil(n/(2*d+1))', 'n,d=map(int,input().split())\nprint(math.ceil(n/(2*d+1))', 'import math\n\nn,d=map(int,input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s146175699', 's236601758', 's583671406'] | [2940.0, 2940.0, 2940.0] | [17.0, 19.0, 17.0] | [67, 55, 69] |
p02970 | u740767776 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int,input().split())\nprint(int((n+(2*d))/d))', 'n, d = map(int,input().split())\ncov = 2 * d\nprint(int((n+cov)/(cov+1)))'] | ['Wrong Answer', 'Accepted'] | ['s400192609', 's515544894'] | [2940.0, 2940.0] | [20.0, 17.0] | [55, 71] |
p02970 | u746849814 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\nd = []\ni = 1\nwhile len(d) <= N:\n d += [i]*(D*2+1)\n i += 1\nlen(set(d))', 'N, D = map(int, input().split())\nd = []\ni = 1\nwhile len(d) <= N:\n d += [i]*(D*2+1)\n i += 1\nprint(len(set(d[:N])))'] | ['Wrong Answer', 'Accepted'] | ['s340862822', 's364564299'] | [2940.0, 2940.0] | [17.0, 17.0] | [108, 119] |
p02970 | u747309718 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = map(int, input().split())\n\nans=(n/(d*2))\nansint =int(n/(d*2))\n\nif(ansint - ans >= 0.5):\n ansint = ansint + 1\n\nprint(ansint)', 'n,d = map(int, input().split())\n\nhani = d*2 + 1\n\nans = int(n/hani)\n\nprint(ans)', 'n,d = map(int, input().split())\n\nprint(int(n/(d*2)))', 'n,d = map(int, input().split()... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s114372301', 's427465223', 's971537846', 's627641701'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [130, 78, 52, 114] |
p02970 | u748311048 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['#int(input())\n#map(int, input().split())\nN,D=map(int, input().split())\nprint(N//(D*2))', 'N,D=map(int, input().split())\nprint(N//(D*2)+1 if N%D!=0 else N//(D*2))', '#int(input())\n#map(int, input().split())\nN,D=map(int, input().split())\nif N<=D*2:\n print(1)\nelif N%(D*2)==0:\n print(N//(D*2)-1)\nelse:\n pri... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s583370188', 's674255357', 's976296648', 's622071276'] | [3060.0, 2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0, 17.0] | [86, 71, 153, 159] |
p02970 | u749770850 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\n\nprint((n + d * 2) / (d * 2 + 1))', 'N, D = map(int,input().split())\n \nnum = D*2 + 1\nif N % num == 0:\n print(int(N / num))\nelse:\n print(N // num + 1)'] | ['Wrong Answer', 'Accepted'] | ['s794065950', 's067420439'] | [2940.0, 2940.0] | [23.0, 17.0] | [66, 118] |
p02970 | u757030836 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int,input().split())\n\ncan = ((2*D)+1)\n\nans = 0\n\nwhile N >= can:\n ans += 1\n N -= can\n \n \nprint(ans)\n\n\n', 'N,D = map(int,input().split())\n\ncan = ((2*N)+1)\n\nans = 0\n\nwhile N > can:\n ans += 1\n N -= can\n \n \nprint(ans)\n', 'N,D = map(int,input().split())\nprint(((N//(2*D+1))+1) if... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s576710140', 's692094006', 's689939110'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [115, 112, 93] |
p02970 | u757274384 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = map(int, input().split())\nk = n%(2*d + 1)\nif k == 0:\n print(n//(2*d+1))\nelse:\n print(n//(2*d+1))', 'import math\nn,d = map(int, input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Wrong Answer', 'Accepted'] | ['s066070731', 's816142004'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 71] |
p02970 | u760794812 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int,input().split())\nAnswer = (N-1)//(2D+1)+1\nprint(Answer)', 'n, d = map(int, input().split())\nAnswer = n//(2*d+1)\nif n%(2*d+1) != 0:\n Answer +=1\n \nprint(Answer)'] | ['Runtime Error', 'Accepted'] | ['s157461350', 's258582260'] | [2940.0, 2940.0] | [17.0, 17.0] | [69, 101] |
p02970 | u766393261 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D=map(int,input().split())\nprint((N+D*2)/(D*2+1))\n', 'N,D=map(int,input().split())\nprint(int((N+D*2)/(D*2+1)))'] | ['Wrong Answer', 'Accepted'] | ['s791661541', 's580376044'] | [2940.0, 2940.0] | [17.0, 18.0] | [52, 56] |
p02970 | u768256617 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nn.d=map(int,input().split())\nx=d*2+1\nprint(math.ceil(n/x))', 'import math\nn,d=map(int,input().split())\nx=d*2+1\nprint(math.ceil(n/x))'] | ['Runtime Error', 'Accepted'] | ['s878207821', 's775739755'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 70] |
p02970 | u772371451 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN,D = map(int,input().split())\nprint(math.ceil(D/(N*2+1)))', 'import math\nN,D = map(int,input().split())\nprint(math.ceil(D/N/2))', 'import math\nN,D = map(int,input().split())\nprint(math.ceil(N/(D*2+1)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s291408131', 's558375438', 's040843799'] | [9152.0, 8824.0, 9100.0] | [27.0, 29.0, 27.0] | [70, 66, 70] |
p02970 | u774985302 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int,input().split())\n\nif N & (D*2 + 1 ) = 0:\n print(N/(D*2 + 1))\nelse :\n print(round(N//(D*2 + 1)+1))\n ', 'N,D = map(int,input().split())\n \nif N % (D*2 + 1 ) == 0:\n print(round(N/(D*2 + 1)))\nelse :\n print(round(N//(D*2 + 1)+1))'] | ['Runtime Error', 'Accepted'] | ['s943907994', 's286220125'] | [2940.0, 2940.0] | [17.0, 17.0] | [122, 126] |
p02970 | u776338097 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['def main():\n import sys\n input = sys.stdin.readline\n \n n, d = map(int, input().split())\n print((n + d - 1) // d)\n \n return 0\n\nmain()', 'def main():\n import sys\n input = sys.stdin.readline\n \n n, d = map(int, input().split())\n d = 2 * d + 1\n print((n + d - 1) // d)\... | ['Wrong Answer', 'Accepted'] | ['s802057712', 's187570371'] | [3064.0, 2940.0] | [18.0, 17.0] | [153, 171] |
p02970 | u777148280 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['x, y = map( int, input().split())\nprint(x//(y*2+1))', 'import math\nx,y=input().split()\nprint(math.ceil(int(x)/(int(y)*2+1)))'] | ['Wrong Answer', 'Accepted'] | ['s878605094', 's132674466'] | [2940.0, 2940.0] | [17.0, 17.0] | [51, 69] |
p02970 | u779728630 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\n\n# 2D + 1\nprint( N // (2*D+1) )', 'N, D = map(int, input().split())\nprint( (N + 2*D) // (2*D+ 1))'] | ['Wrong Answer', 'Accepted'] | ['s709616433', 's997896348'] | [9016.0, 9156.0] | [27.0, 26.0] | [64, 62] |
p02970 | u780143117 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['shuru=input()\nshuru=shuru.split()\nn=int(shuru[0])\nd=int(shuru[1])\nd=2*d+1\nans=n//d\nif n%d==0 :\n ans+=1\nprint(ans)', 'shuru=input()\nshuru=shuru.split()\nn=int(shuru[0])\nd=int(shuru[1])\nd=2*d+1\nans=n//d\nif n%d!=0 :\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s284681121', 's037100723'] | [3188.0, 3060.0] | [20.0, 17.0] | [114, 114] |
p02970 | u790301364 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['def main11():\n data = input().split()\n num = []\n for i in range(2):\n num.append(int(data[i]))\n result = int(num[0] / (num[1] * 2 + 1))\n print(result)\n\nif __name__ == "__main__":\n main11()', 'def main11():\n data = input().split()\n num = []\n for i in range(2):\n num.... | ['Wrong Answer', 'Accepted'] | ['s095253834', 's414940870'] | [2940.0, 3060.0] | [18.0, 20.0] | [212, 284] |
p02970 | u791527495 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN,D =map(int,input().split())\n\nx = D * 2 + 1\n\npre_answer = N / X\nprint(math.ceil(pre_answer))\n', 'N,D =map(int,input().split())\n\nx = D * 2 + 1\n\npre_answer = - (-N // X)\nprint(int(pre_answer))\n', 'import math\nN,D =map(int,input().split())\n\nX = D * 2 + 1\n\npre_answer = N / X\nprint(math.cei... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s165733270', 's800484615', 's978906985'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [106, 94, 106] |
p02970 | u800058906 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d=map(int,input().split())\n\nans=n//(2*(d+1))\n\nif n%(2*(d+1))==0:\n print(ans)\nelse:\n print(ans+1)', 'n,d=map(int,input().split())\n\nans=n//((2*d)+1)\n\nif n%((2*d)+1)==0:\n print(ans)\nelse:\n print(ans+1)'] | ['Wrong Answer', 'Accepted'] | ['s832553159', 's424731825'] | [9020.0, 9160.0] | [27.0, 28.0] | [100, 100] |
p02970 | u809457879 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D=map(int,input().split())\nprint((N//(2D+1))+1)', 'import math\nN,D=map(int,input().split())\nprint(math.ceil(N//(2*D))) ', 'import math\nN,D=map(int,input().split())\nprint(math.ceil(N/(2*D+1)))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s347216982', 's818761292', 's965104792'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [49, 68, 68] |
p02970 | u811436126 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\n\nans = n // d + 1\nprint(ans)\n', 'n, d = map(int, input().split())\n\nif n % (2 * d + 1) == 0:\n ans = n // (2 * d + 1)\nelse:\n ans = n // (2 * d + 1) + 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s896316638', 's699946199'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 135] |
p02970 | u813953440 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int,input().split())\n#print(N,D)\nA = [i for i in range(1,N+1)]\n#print(A)\n\ndef people(t):\n t = t + 2*D\n return t\nif N<D:\n print(1)\n\nelse:\n t = 1\n c = 0\n while t < N:\n #print(t)\n t = people(t+1)\n c+=1\n print(c)\n ', 'N,D = map(int,input().split())... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s525386678', 's891648796', 's579681371'] | [3060.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [265, 216, 209] |
p02970 | u814650736 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ["nd=input()\nndlis=['' for i in range(2)]\nndlis=nd.split()\nn=int(ndlis[0])\nd=int(ndlis[1])\non=0\ncnt=0\nwhile on==0:\n\tcnt=cnt+1\n\tif n<=cnt*d:\n\t\ton=1\nprint(cnt)", "nd=input()\nndlis=['' for i in range(2)]\nndlis=nd.split()\nn=int(ndlis[0])\nd=int(ndlis[1])\non=0\ncnt=0\nwhile on==0:\n\tcnt=cnt+1\n\tif n<=cn... | ['Wrong Answer', 'Accepted'] | ['s302564286', 's309168668'] | [3060.0, 3060.0] | [18.0, 17.0] | [155, 161] |
p02970 | u817760251 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\nprint((n + d + d) / (d + d + 1))\n', 'n, d = map(int, input().split())\nprint(int((n + d + d) / (d + d + 1)))'] | ['Wrong Answer', 'Accepted'] | ['s888333818', 's502741837'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 70] |
p02970 | u818349438 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int,input().split())\nprint(N/D+1)\n', 'N,D = map(int,input().split())\nprint(N/(2*D)+1)\n', 'N,D = map(int,input().split())\nans = N //(2*D+1)+1\nif N%(2*D+1)== 0:\n ans-=1\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s342486626', 's913117471', 's261513287'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [44, 48, 90] |
p02970 | u821588465 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\n\nprint((N-1)//D + 1)\n\n', 'from math import floor,ceil\nN, D = map(int, input().split())\n\nprint(ceil(N/(2*D + 1)))\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s822826615', 's975668388'] | [9180.0, 9124.0] | [28.0, 27.0] | [55, 90] |
p02970 | u836939578 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN, D = map(int, input().split())\n\nprint(math.ceil((N-2)/(D*2)))', 'import math\nN, D = map(int, input().split())\n\nans = math.ceil((N-1)/(D*2+1))\n\nif (N-1) % (D*2+1) == 0:\n ans += 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s905444996', 's860530093'] | [2940.0, 2940.0] | [17.0, 17.0] | [75, 128] |
p02970 | u840958781 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,p=map(int,input().split())\nif n%(2p+1)==0:\n print(n//(2p+1))\nelse:\n print(n//(2p+1)+1)', 'n,p=map(int,input().split())\nif n%(2*p+1)==0:\n print(n//(2*p+1))\nelse:\n print(n//(2*p+1)+1)'] | ['Runtime Error', 'Accepted'] | ['s831851645', 's876567256'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 97] |
p02970 | u840988663 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\n\nsyou=N//D\namari=N%D\n\nif amari != 0:\n syou=syou+1\n\nprint(syou)\n', 'N, d = map(int, input().split())\n\nD=2*d+1\nsyou=N//D\namari=N%D\n\nif amari != 0:\n syou=syou+1\n\nprint(syou)\n'] | ['Wrong Answer', 'Accepted'] | ['s913106965', 's635317645'] | [2940.0, 2940.0] | [18.0, 17.0] | [97, 105] |
p02970 | u844123804 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['num = input().split()\nans = int(num[0]) // (int(num[1])*2+1)\nif int(num[0])%int(num[1])!=0: ans += 1\nprint(ans)', 'num = input().split()\nans = int(num[0]) // (int(num[1])*2+1)\nif int(num[0])%(int(num[1])*2+1)!=0: ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s209997748', 's429184119'] | [2940.0, 2940.0] | [17.0, 17.0] | [111, 117] |
p02970 | u847497464 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = [ int(_) for _ in input().split() ]\nx = n / (2*d+1)\nif x.is_integer()\n print( x )\nelse:\n print( x + 1 )\n\n\n\n', 'n, d = [ int(_) for _ in input().split() ]\nx = n / (2*d+1)\n\nif x.is_integer():\n print( x//1 )\nelse:\n print( (x//1) + 1 )\n\n\n\n', 'n, d = [ int(_) for _ in input().split(... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s334982905', 's416191207', 's802599880', 's947314328'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [121, 131, 118, 141] |
p02970 | u857673087 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN, D = map(int, input().split())\n\nprint(math.ceil(N/(2*D+1))', 'import math\nN,D = map(int, input().split())\nprint(math.ceil(N/(2*D+1)))'] | ['Runtime Error', 'Accepted'] | ['s818822288', 's412365493'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 71] |
p02970 | u864276028 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int, input().split())\nD = 2*D + 1\nfor i in range (N+1):\n if i >= D:\n print(i)', 'N,D = map(int, input().split())\nD = 2*D + 1\nk = N/D\nl = N//D\nif k == l:\n print(int(k))\nelse:\n print(l+1)'] | ['Wrong Answer', 'Accepted'] | ['s059843029', 's321147507'] | [2940.0, 2940.0] | [17.0, 17.0] | [91, 110] |
p02970 | u866769581 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = map(int,input().split())\nprint(n//(d*2+1))', 'n,d = map(int,input().split()) \nprint((n+(d*2))//(d*2+1))'] | ['Wrong Answer', 'Accepted'] | ['s691576413', 's152196259'] | [2940.0, 2940.0] | [17.0, 17.0] | [48, 146] |
p02970 | u869519920 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['a, b=list(map(int, input()))\nprint((a-1)/(2*b + 1)/1)', 'a, b=list(map(int, input().split()))\nprint(int((a-1)/(2*b + 1))+1)'] | ['Runtime Error', 'Accepted'] | ['s779884593', 's625382656'] | [9152.0, 9104.0] | [26.0, 26.0] | [53, 66] |
p02970 | u873134970 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nn,d=map(int,input())\nk=math.ceil(n/(2*d))\nprint(k)', 'import math\nn,d=map(int,input().split())\nk=math.ceil(n/(2*d+1))\nprint(k)'] | ['Runtime Error', 'Accepted'] | ['s963483730', 's456392264'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 72] |
p02970 | u873269440 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['\ndef main():\n\n N,D = map(int,input().split())\n D += 4\n\n if N < D:\n N=D\n\n if N%D==0:\n print(int(N/D))\n else:\n print(int((N/D)+1))\n\n\n\nif __name__== "__main__":\n main() \n', '\ndef main():\n\n N,D = map(int,input().split())\n\n power = D*2+1\n\n if N <= po... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s582752335', 's731324905', 's780930623'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [206, 243, 251] |
p02970 | u879248892 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN, D = int(input())\nperson = math.cell(N / (D*2+1))\nprint(person)', 'N,D = map(int,input().split())\nif N % (D*2+1) != 0:\n p = n // (d*2+1) + 1\nelse:\n p = n // (d*2+1)\n \nprint(p)', 'import math\nN, D = map(int, input().split())\nperson = math.cell(N / (D*2+1))\nprint(person)\n', 'N,D = map(int,... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s116412784', 's422643273', 's778129793', 's081402454'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [77, 111, 91, 111] |
p02970 | u885932660 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\n\nnd = input().strip().split()\nn = nd[0]\nd = nd[1]\n\ninspectors = math.ceil(n / (2 * d + 1))\nprint(inspectors)', 'import math\n\nnd = [int(x) for x in input().strip().split()]\nn = nd[0]\nd = nd[1]\n\ninspectors = math.ceil(n / (2 * d + 1))\nprint(inspectors)'] | ['Runtime Error', 'Accepted'] | ['s371607575', 's608400661'] | [2940.0, 2940.0] | [17.0, 18.0] | [120, 138] |
p02970 | u887080340 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\n\nprint(N//(2*D+1))\n', 'import math\nN, D = map(int, input().split())\nans = math.ceil(N/(2*D+1))\nprint(ans)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s236620051', 's944971497'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 84] |
p02970 | u888512581 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\ni = (n // 2*r) + 1\nprint(i)', 'n, d = map(int, input().split())\nif n % (2*d + 1) == 0:\n print(n // (2*d + 1))\nelse:\n print(n // (2*d + 1) + 1)'] | ['Runtime Error', 'Accepted'] | ['s545171410', 's237219688'] | [2940.0, 2940.0] | [17.0, 18.0] | [60, 113] |
p02970 | u891161439 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n = int(input())\nd = int(input())\nans = n/(2*d + 1)\nif n % (2*d + 1) != 0:\n print(ans+1)\nelse:\n print(ans)\n', 'n = int(input())\nd = int(input())\nans = n/(2*d + 1)\nif n % (2*d + 1) != 0:\n print("{}".format(ans+1))\nelse:\n print("{}".format(ans))', 'n = int(input())\nd = int(input())\nans = n // (2*d + ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s251959282', 's281122463', 's859284679', 's985008476', 's658569646'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [109, 134, 112, 108, 109] |
p02970 | u893270619 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN, D = map(int, input().split())\nprint(math.floor(N/(2*D+1)))', 'import math\nN, D = map(int, input().split())\nprint(math.ceil(N/(2*D+1)))'] | ['Wrong Answer', 'Accepted'] | ['s004939421', 's151417118'] | [2940.0, 2940.0] | [18.0, 17.0] | [73, 72] |
p02970 | u898967808 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nn,d= map(int,input().split())\nmath.ceil(n/(d*2+1))', 'import math\nn,d= map(int,input().split())\nprint(math.ceil(n/(d*2+1)))'] | ['Wrong Answer', 'Accepted'] | ['s703358909', 's990257764'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 69] |
p02970 | u899909022 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN,D=map(int,input().split())\ntmp = D *2.0 + 1\nprint(tmp)\nprint(math.ceil(N / tmp))', 'import math\nN,D=map(int,input().split())\ntmp = D *2.0 + 1\nprint(tmp)\nprint(int(math.ceil(N / tmp)))', 'import math\nN,D=map(int,input().split())\ntmp = D *2.0 + 1\nprint(int(math.ceil(N / tmp)))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s237884762', 's987970282', 's433516489'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [94, 99, 89] |
p02970 | u904995051 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = map(int,input().split())\nprint((n+d+4-1)//(d+4))', 'n,d = map(int,input().split())\nprint((n+d*2)//(d*2+1))'] | ['Wrong Answer', 'Accepted'] | ['s830858132', 's466017541'] | [9156.0, 9160.0] | [29.0, 33.0] | [54, 54] |
p02970 | u912318491 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nN,D = map(int,input().split())\n\npeople = math.ceil(N // (2D+1))\nprint(people)', 'N, D = map(int, input().split())\n\npeople = N / (2*D+1)\nif people % 1.0 != 0:\n people+=1\nprint(int(people))'] | ['Runtime Error', 'Accepted'] | ['s621461470', 's257424761'] | [2940.0, 3060.0] | [17.0, 17.0] | [89, 149] |
p02970 | u918601425 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = [int(s) for s in input().split()]\nprint(math.ceil(N/(2*D+1)))', 's1,s2=input().split()\nN=int(s1)\nD=int(s2)\nn=N\nans=0\nwhile n>0:\n n=n-(2*D+1)\n ans=ans+1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s439499982', 's290624588'] | [2940.0, 9048.0] | [17.0, 26.0] | [67, 100] |
p02970 | u932868243 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d=map(int,input())\nif n%(2*d+i)==0:\n print(n//(2*d+1))\nelse:\n print(n//(2*d+1)+1)', 'n,d=map(int,input().split())\nif n%(2*d+i)==0:\n print(n//(2*d+1))\nelse:\n print(n//(2*d+1)+1)', 'import math\nn,d=map(int,input().split())\nprint(math,ceil(n/(d*2+1)))', 'import math\nn,d=map(int,input().split())\nprint(m... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s071961611', 's396616788', 's449318273', 's532225866'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0, 17.0] | [85, 93, 68, 70] |
p02970 | u933129390 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\nspl_num = d*2+1\nif not n % spl_num:\n print(n // spl_num + 1)\nelse:\n print(n // spl_num)', 'n, d = map(int, input().split())\nspl_num = d*2+1\nif not n % spl_num:\n print(n // spl_num)\nelse:\n print(n // spl_num + 1)'] | ['Wrong Answer', 'Accepted'] | ['s562954813', 's024387966'] | [2940.0, 2940.0] | [17.0, 18.0] | [126, 126] |
p02970 | u933341648 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\nprint(n//(d*2))', 'n, d = map(int, input().split())\nprint((n+d*2)//(d*2+1))'] | ['Wrong Answer', 'Accepted'] | ['s821799760', 's888565471'] | [2940.0, 2940.0] | [18.0, 17.0] | [48, 56] |
p02970 | u933962236 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = (int(x) for x in input().split())\nprint(n/2d)', 'n,d = (int(x) for x in input().split())\nif n//(2*d) = 0:\n print(n/(2*d))\nelse:\n print(n/(2*d)+1)', 'N,D = array(input(),input())\nprint(roundup(N/2D ,0)', 'n,d = (int(x) for x in input().split())\nif n % (2*d + 1) == 0:\n print(n//(2*d + 1))\nelse:\n pri... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s084597841', 's931583128', 's954499534', 's922523769'] | [2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0] | [51, 98, 51, 116] |
p02970 | u935522051 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D = map(int,input().split())\na = N%(2*D+1)\nb = N//(2*D+1)\nif a=0:\n print(int(b))\nelse:\n print(int(b+1))\n', 'N,D = map(int,input().split())\na = N%(2*D+1)\nb = N//(2*D+1)\nif a=0:\n print(b)\nelse:\n print(int(b+1))\n', 'N,D = map(int,input().split())\na = N%(2*D+1)\nb = N//(2*D+1)\nif a==0:\n print(int(... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s065101771', 's728180088', 's321068718'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [108, 103, 109] |
p02970 | u941284420 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N,D =map(int,input().split())\nans=0\nwhile True:\n ans+=1\n tmp=ans*2+1\n if tmp >= N:\n break\nprint(ans)', 'N,D =map(int,input().split())\nans=0\nwhile True:\n ans+=1\n tmp=(D*2+1)*ans\n if tmp >= N:\n break\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s784613602', 's822307938'] | [3064.0, 3064.0] | [19.0, 17.0] | [106, 110] |
p02970 | u945641805 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\n\ni = 1\nleft = 1\nres = 0\nwhile i <= N:\n if i - D == left:\n print(i, left)\n left = i + D + 1\n res += 1\n i += 1\n\nif left <= N: res += 1\n\nprint(res)', 'N, D = map(int, input().split())\n\ni = 1\nleft = 1\nres = 0\nwhile i <= N:\n if i - D == lef... | ['Wrong Answer', 'Accepted'] | ['s122451711', 's762067371'] | [3060.0, 3060.0] | [17.0, 20.0] | [204, 181] |
p02970 | u951665306 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nn, d = map(int, input().split)\nprint(math.ceil(n/(2*d+1)))', 'import math\nn, d = map(int, input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Runtime Error', 'Accepted'] | ['s305908553', 's683620992'] | [2940.0, 3060.0] | [17.0, 19.0] | [70, 72] |
p02970 | u953379577 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['a,b = map(int,input().split())\n\nr = b*2+1\n\nif a%b == 0:\n print(a//r)\nelse:\n print(a//r+1)\n', 'a,b = map(int,input().split())\n\nr = b*2+1\n\nif a%b == 0:\n print(a//b)\nelse:\n print(a//b+1)\n', 'a,b = map(int,input().split())\n\nr = b*2+1\n\nif a%r == 0:\n print(a//r)\nelse:\n print(a//r+1)... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s085039359', 's807142127', 's117127700'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [96, 96, 96] |
p02970 | u958053648 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d=map(int ,input().split())\nprint((n+2*d)/(2*d+1))', 'n,d=map(int ,input().split())\nprint(n/(2*d+1))', 'import math\nn,d=map(int,input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s048420546', 's358667842', 's547574464'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [52, 46, 68] |
p02970 | u962356464 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import math\nnum_list = list(map(int, input().split()))\n\nN = num_list[0]\nD = num_list[1]\n\nprint (math.ceil(N//(2*D+1)))', 'import math\nN,D= list(map(int, input().split()))\n\nprint (math.ceil(N/(2*D+1)))'] | ['Wrong Answer', 'Accepted'] | ['s206807228', 's364333920'] | [3060.0, 3064.0] | [17.0, 17.0] | [118, 78] |
p02970 | u965033073 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['a,b=map(int,input().split())\nc=a//(2b+1)+1\nprint(c)', 'n, d = map(int, input().split())\nif n%(2*d+1) == 0:\n print(n//(2*d+1))\nelse:\n print(n//(2*d+1)+1)\n'] | ['Runtime Error', 'Accepted'] | ['s480779932', 's089705114'] | [2940.0, 2940.0] | [17.0, 18.0] | [51, 104] |
p02970 | u966000628 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n,d = map(int,input().split())\nsight = 2*d+1\ni = 1\nwhile(True)\n if n <= i*sight:\n print(i)\n break\n i += 1\n ', 'n,d = list(map(int,input().split()))\nsight = 2*d+1\nprint((n//sight) + (n%sight != 0))'] | ['Runtime Error', 'Accepted'] | ['s210618514', 's635173802'] | [2940.0, 2940.0] | [18.0, 17.0] | [118, 85] |
p02970 | u969848070 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['a, b = int(input())\nif a%(1+b) !=0:\n print(a//(1+b)+1)\nelse:\n print(a//(1+b))', 'a, b = map(int, input().split())\nif a%(1+2*b) !=0:\n print(a//(1+2*b)+1)\nelse:\n print(a//(1+2*b))'] | ['Runtime Error', 'Accepted'] | ['s582088396', 's391595187'] | [2940.0, 2940.0] | [17.0, 18.0] | [79, 98] |
p02970 | u978962055 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int, input().split())\nif N%D == 0:\n print(N//(2*D+1))\nelse:\n print(N//(2*D+1)+1)', 'N, D = map(int, input().split())\nif N%(2*D+1) == 0:\n print(N//(2*D+1))\nelse:\n print(N//(2*D+1)+1)'] | ['Wrong Answer', 'Accepted'] | ['s068856380', 's805403666'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 99] |
p02970 | u981304949 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N, D = map(int,input().split())\na = N//(2D+1)\nif N%(2D+1)==0:\n print(a)\nelse:\n print(a+1)', 'N, D = map(int,input().split())\na = N//(2*D+1)\nif N%(2*D+1)==0:\n print(a)\nelse:\n print(a+1)'] | ['Runtime Error', 'Accepted'] | ['s157652627', 's358911001'] | [2940.0, 2940.0] | [17.0, 18.0] | [91, 93] |
p02970 | u982462877 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | [',d = map(int,input().split())\n\na = d * 2 + 1\n\nb=n/a\nb = int(b)\nc=n%a\nif c>0:\n b = b + 1\n \nprint(b)', 'n,d = map(int,input().split())\n\na = d * 2 + 1\n\nb=n/a\nb = int(b)\nc=n%a\nif c>0:\n b = b + 1\n \nprint(b)\n'] | ['Runtime Error', 'Accepted'] | ['s983548565', 's511492208'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 106] |
p02970 | u983943108 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['N=int(input())\nD=int(input())\nmaximum=2*D+1\nif N%maximum==0:\n print(int(N/maximum))\nelse:\n print(int(N/maximum+1))', 'inputing=input()\nN=int(inputing.split()[0])\nD=int(inputing.split()[1])\n\nmaximum=2*D+1\nif N%maximum==0:\n print(int(N/maximum))\nelse:\n print(int(N/maximum+1))'] | ['Runtime Error', 'Accepted'] | ['s451899988', 's412707339'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 162] |
p02970 | u989089752 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['n, d = map(int, input().split())\nans = (n+2*d)/(2*d+1)\nprint(ans)\n', 'n,d = map(int,input().split())\ns = 2*d+1\nans = (n + s -1)/s\nprint(ans)', 'n,d = map(int,input().split())\ns = 2*d + 1\nans = (n+s-1)/s\nprint(ans)', 'n, d = map(int, input().split())\ns = 2*d+1\nans = (n+s-1)/s\nprint(ans)', 'n, d = map(int, ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s225520331', 's317127214', 's325222107', 's633902247', 's868019764', 's021473610'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [66, 70, 69, 69, 68, 67] |
p02970 | u989157442 | 2,000 | 1,048,576 | There are N apple trees in a row. People say that one of them will bear golden apples. We want to deploy some number of inspectors so that each of these trees will be inspected. Each inspector will be deployed under one of the trees. For convenience, we will assign numbers from 1 through N to the trees. An inspector ... | ['import mth\nn, d = map(int,input().split())\nprint(math.ceil(n / (2 * d + 1)))\n', 'import mth\nn, d = map(int,input().split())\nprint(math.seil(n / (2 * d + 1)))\n', 'import math\nn, d = map(int,input().split())\nprint(math.ceil(n / (2 * d + 1)))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s451253156', 's825582160', 's613513306'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 18.0] | [77, 77, 78] |
p02971 | u003501233 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['N = int(input())\nA = [int(input()) for i range(N)]\n\nx = sorted(A)\n\nfor i in range(N):\n if A[i] == x[N-1]:\n print(x[N-2])\n else:\n print(x[N-1])', 'N=int(input())\nA=[int(input()) for i range(N)]\n\nx=sorted(A)\n\nfor i in range(N):\n if A[i] == x[N-1]:\n print(x[N-2])\n else:\n print(x[N-1])',... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s653039292', 's968394997', 's338212822'] | [2940.0, 2940.0, 14152.0] | [17.0, 17.0, 581.0] | [150, 144, 153] |
p02971 | u006883624 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['def main():\n N = int(input())\n\n max_left = [0] * N\n max_right = [0] * N\n\n ary = []\n\n for i in range(N):\n v = int(input())\n ary.append(v)\n\n for i in range(N - 1):\n max_left[i+1] = max(max_left[i], ary[i])\n\n for i in range(N - 1, 0, -1):\n max_right[i-1] = max(max_right[i], ary[i])\n\n... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s138719228', 's780189222', 's788523955', 's790580044', 's921170191', 's689146917'] | [3060.0, 3060.0, 3060.0, 3060.0, 3188.0, 15656.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 576.0] | [375, 392, 364, 368, 375, 422] |
p02971 | u015490689 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['n=int(input())\nv=[int(input()) for i in range(n)]\nt=sorted(v)\nfor i in v:\n print(t[1] if i==t[0] else t[0])', 'n=int(input())\nv=[int(input()) for i in range(n)]\nm1=v[0]\nm2=v[1]\nif m2>m1:m1,m2=m2,m1\nfor i in v:\n if i > m1:\n m2=m1\n m1=i\n elif i>m2:\n m2=i\nfor i in v:\n print(m2 if i==m1 else ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s335154053', 's419373717', 's147438041'] | [14112.0, 12512.0, 14112.0] | [527.0, 489.0, 537.0] | [108, 193, 121] |
p02971 | u015593272 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['N = int(input())\nl = [int(input()) for i in range(N)]\nl_sort = sorted(l)\n\nfor i in range(N):\n\n if (l[i] != l_sort[-1]):\n print(l_sort[-2])\n else:\n print(l_sort[-1])', 'N = int(input())\nl = [int(input()) for i in range(N)]\nl_sort = sorted(l)\n\nfor i in range(N):\n\n if (l[i] != l_sor... | ['Wrong Answer', 'Accepted'] | ['s973151035', 's275533803'] | [14112.0, 14744.0] | [547.0, 557.0] | [184, 185] |
p02971 | u016901717 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['import copy\nn=int(input())\nA=[int(input()) for i in range(n)]\nB=copy.copy(A)\nfor i in range(n):\n A.pop(i)\n print(max(A))\n A = B\n ', 'n=int(input())\nA=[int(input()) for i in range(n)]\nB=sorted(A)\nfor a in A:\n if a == B[-1]:\n print(B[-1])\n else:\n print(B[-2])', 'n=int(input(... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s366015334', 's711637613', 's868627421'] | [13080.0, 14068.0, 14112.0] | [2104.0, 536.0, 548.0] | [141, 142, 142] |
p02971 | u017064954 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['n = int(input())\nA = []\nfor i in range(n):\n A.append(int(input()))\n \nfor i in range(n):\n Ai = A\n Ai.pop(i)\n print(max(Ai))\n', 'n = int(input())\nA = [int(input()) for i in range(n)]\nfor i in range(n):\n Ai = A\n Ai.pop(i)\n print(max(Ai))', 'n = int(input())\nA = [int(a) for input() in range(n)]\nfo... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s001613841', 's101529270', 's376213268', 's457409201', 's989028454'] | [11180.0, 11180.0, 2940.0, 11052.0, 14112.0] | [2104.0, 2104.0, 17.0, 369.0, 544.0] | [128, 110, 111, 123, 181] |
p02971 | u017415492 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['import heapq\nn=int(input())\nd=[]\nfor i in range(n):\n heapq.heappush(d,int(input()))\nfor j in range(n):\n if d[j]==d[n-1]:\n print(d[n-2])\n else:\n print(d[n-1])', 'n=int(input())\nd=[]\nfor i in range(n):\n d.append(int(input()))\nx=sorted(d)\nfor j in range(n):\n if d[j]==d[-1]:\n print(x[-2])\n ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s066994486', 's647313036', 's929346580', 's935656606'] | [12552.0, 15808.0, 11072.0, 19028.0] | [564.0, 587.0, 384.0, 352.0] | [166, 156, 166, 135] |
p02971 | u017624958 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ['N = int(input())\nA = [int(input()) for i in range(N)]\n\n\nsorted_A = list(reversed(sorted(A)))\n\nmaxiuam = sorted_A[0]\n\nis_there_tow_maximum = A.count(maxiuam) >= 2\nif is_there_tow_maximum:\n answer = (str(maxiuam) + "\\n") * N\n print(answer)\n exit()\n\nsecond = None\nfor Ai in sorted_A:\n if Ai <... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s500226850', 's763603476', 's314976041'] | [16516.0, 3064.0, 28060.0] | [408.0, 18.0, 474.0] | [471, 459, 458] |
p02971 | u020962106 | 2,000 | 1,048,576 | You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question: * Find the maximum value among the N-1 elements other than A_i in the sequence. | ["n = int(input())\nH = list(map(int,input().split()))\n\ntmp = H[0]\nfor k in H:\n if tmp - k > 1:\n print('No')\n exit()\n if k > tmp:\n tmp = k\nprint('Yes')", 'n = int(input())\nA = [int(input()) for _ in range(n)]\nB = A[:]\nB.sort(reverse = True)\nmax_A = max(A)\nfor i in range(n):\n ... | ['Wrong Answer', 'Accepted'] | ['s660935773', 's716823048'] | [3060.0, 14112.0] | [17.0, 556.0] | [175, 192] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.