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 | u336721073 | 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+1) + int(N%(2*D+1)>0)\nprint(ans)', 'N, D = map(int, input().split(" "))\nans = (N-1) / (2*D+1) + 1\nprint(ans)', 'N, D = map(int, input().split(" "))\nans = N // (2*D+1) + int(N%(2*D+1)>0)\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s399391570', 's852741428', 's363587936'] | [2940.0, 3064.0, 2940.0] | [17.0, 17.0, 17.0] | [83, 72, 84] |
p02970 | u343019314 | 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\nn,d=list(map(int(input().split()))\n \nprint (math.ceil(n/1+2*d))', 'import math\n\nn, d = list(map(int, input().split()))\n\nprint(math.ceil(n / (1+2*d)))'] | ['Runtime Error', 'Accepted'] | ['s461435193', 's502915732'] | [2940.0, 3060.0] | [17.0, 21.0] | [84, 82] |
p02970 | u344030307 | 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\n\nn,d = map(int, input().split())\nprint(math.ceil(n / (2*d + 1)))'] | ['Runtime Error', 'Accepted'] | ['s646108729', 's476828925'] | [8924.0, 9092.0] | [22.0, 30.0] | [56, 76] |
p02970 | u347184682 | 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())\nn=n-1\nif n%(1+2*d)==0:\n print(n//(1+2*d))\nelse:\n print((n//(1+2*d))+1)\n', 'n,d=map(int,input().split())\n\nif n%(1+2*d)==0:\n print(n//(1+2*d))\nelse:\n print((n//(1+2*d))+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s113256427', 's326249190'] | [9160.0, 9080.0] | [27.0, 27.0] | [102, 97] |
p02970 | u350093546 | 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=n/(n*d+1)\nprint(math.ceil(x))', 'import math\nn,d=map(int,input().split())\nx=n/(2*d+1)\nprint(math.ceil(x))\n'] | ['Wrong Answer', 'Accepted'] | ['s933785418', 's317904525'] | [2940.0, 2940.0] | [18.0, 18.0] | [72, 73] |
p02970 | u350578302 | 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(N, D)\ncnt = math.floor(N/(2*D+1))\nif N%(2*D+1) != 0:\n cnt += 1\nprint(cnt)', 'import math\nN, D = map(int,input().split())\ncnt = math.floor(N/(2*D+1))\nif N%(2*D+1) != 0:\n cnt += 1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s633819129', 's827972527'] | [2940.0, 2940.0] | [17.0, 18.0] | [124, 112] |
p02970 | u362563655 | 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 = 2D+1\nprint(N//d+1)', 'N,D = map(int, input().split())\nprint(N//(2D+1)+1)\n', 'N,D = map(int, input().split())\nprint(N//D+1)', 'N,D = map(int, input().split())\ncount = 0\ni = 0\nwhile i < N:\n i += 2*D+1\n count +=1\nprint(count+1)\n', 'N,D = map(int, input().split())\ncount ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s171861224', 's230743150', 's630375511', 's696986716', 's566939361'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [54, 51, 45, 101, 99] |
p02970 | u363599046 | 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(int(n/d)+1)', 'n, d = map(int,input().split())\nans = int(n/(2*d+1))\nif n%(2*d+1) == 0:\n\tprint(int(ans))\nelse:\n\tprint(ans+1)'] | ['Wrong Answer', 'Accepted'] | ['s821943213', 's058731685'] | [3064.0, 2940.0] | [20.0, 20.0] | [50, 108] |
p02970 | u363768711 | 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(input())\nA = (2D+1)//N\nif A == 0:\n print(A)\nelif A == 1:\n print(A+1)\n \n', 'n, d = map(int, input().split())\nt = 2*d+1\nprint(n//t+1 if n%t else n//t)'] | ['Runtime Error', 'Accepted'] | ['s364418752', 's320219755'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 73] |
p02970 | u364785529 | 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(y//2*n+1)', 'x,y = map(int,input().split())\ni=0\nwhile x>0:\n i+=1\n x = x-(2*y+1)\nprint(i) '] | ['Runtime Error', 'Accepted'] | ['s837814895', 's681716233'] | [2940.0, 2940.0] | [17.0, 17.0] | [46, 79] |
p02970 | u365243017 | 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-1)//(2*D)\nif (N-1)%(2*D) == 0:\n\tprint(a)\nelse:\n \tprint((N-1)//(2*D+1))\n', 'N,D = map(int,input(),split())\na = (N-1)/(2*D)\nif (N-1)%(2*D)==0:\n\tprint(a)\nelse:\n \tprint((N-1)//(2*D+1))\n', 'N,D = map(int,input().split())\na = (N-1)/(2*D+1)\nif (N-1)%(2*D+1) == 0:\n\tpr... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s086324592', 's139815206', 's316661851', 's389397766', 's487612137', 's694536117', 's706902271', 's902880345', 's606677398'] | [2940.0, 2940.0, 3064.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [109, 106, 114, 116, 109, 108, 98, 105, 94] |
p02970 | u366482170 | 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)))', 'import math\nn, d = map(int,input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Runtime Error', 'Accepted'] | ['s516034654', 's082556239'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 71] |
p02970 | u366886346 | 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=d*2+1\nprint(-(n//-d))\n', 'n,d=map(int,input().split())\na=d*2+1\nprint(-(n//-a))\n'] | ['Wrong Answer', 'Accepted'] | ['s420447707', 's175422798'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 53] |
p02970 | u369105927 | 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 import ceil\n\nn, d = map(int, input().split())\n\nt = 2d + 1\n\nprint(ceil(n/t))', 'from math import ceil\n\nn, d = map(int, input().split())\n\nt = 2 * d + 1\n\nprint(ceil(n/t))'] | ['Runtime Error', 'Accepted'] | ['s932927277', 's908403579'] | [2940.0, 2940.0] | [18.0, 17.0] | [87, 88] |
p02970 | u374765578 | 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(x) for x in input().split())\n\nc = a//b\n\nprint(c+1)', 'n, d = map(int, input().split())\n\nif n%(2d+1) == 0:\n print(n%(2d+1))\nelse:\n print(n%(2d+1)+1)\n ', 'a,b = map(int.input())\n\nc = a//b\n\nprint(c+1)\n', 'n, d = map(int, input().split())\n \nif n%(2*d+1) == 0:\n print(n//(2*d+1))\nelse:\n ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s426323309', 's506415170', 's706072385', 's365147341'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [59, 98, 45, 110] |
p02970 | u380933932 | 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=list(map(int,input().split()))\nans=nd[0]//(2*nd[1]+1)\nif nd%(2*nd[1]+1)!=0:\n ans+=1\nprint(ans)', 'nd=list(map(int,input().split()))\nans=nd[0]//(2*nd[1]+1)\nif nd[0]%(2*nd[1]+1)!=0:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s779833008', 's388703768'] | [2940.0, 2940.0] | [17.0, 17.0] | [98, 101] |
p02970 | u388297793 | 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/(s*2+1)))\n', 'import math \nn,d=map(int,input().split())\nprint(math.ceil(n/(d*2+1)))\n'] | ['Runtime Error', 'Accepted'] | ['s217120857', 's252972852'] | [9100.0, 9096.0] | [29.0, 31.0] | [70, 70] |
p02970 | u388323466 | 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 = mat(int,input().split())\n\nif n % (d*2+1) != 0:\n print(int(n % (d*2+1) + 1)) \n else:\n print(int(n % (d*2+1)))', 'n,d = map(int,input().split())\n \nif n % (d*2+1) != 0:\n print(int(n // (d*2+1) + 1)) \nelse:\n print(int(n // (d*2+1)))'] | ['Runtime Error', 'Accepted'] | ['s779143126', 's467461347'] | [2940.0, 2940.0] | [17.0, 17.0] | [116, 118] |
p02970 | u390170391 | 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 ... | ['l = list(map(int,input().split()))\nn = l[0]\nd = l[1]\n\nif n % (2d+1) == 0:\n print(n // (2d+1))\nelse:\n print(n // (2d+1) + 1)', 'l = list(map(int,input().split()))\nn = l[0]\nd = l[1]\n\nif n % (2*d+1) == 0:\n print(n // (2*d+1))\nelse:\n print(n // (2*d+1) + 1)\n'] | ['Runtime Error', 'Accepted'] | ['s224497755', 's850506736'] | [2940.0, 2940.0] | [17.0, 18.0] | [125, 129] |
p02970 | u392361133 | 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 / (2d + 1)))', 'import math\nn, d = map(int, input().split())\nprint(math.ceil(n / ((2 * d) + 1)))'] | ['Runtime Error', 'Accepted'] | ['s341574066', 's058967655'] | [2940.0, 9100.0] | [17.0, 30.0] | [75, 80] |
p02970 | u396495667 | 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 ans == 0:\n print(ans +1)\nelse:\n print(ans)', 'import math\nn,d = map(int, input().split())\na = n/(2*d+1)\nprint(math.ceil(a))'] | ['Wrong Answer', 'Accepted'] | ['s370119217', 's522372895'] | [2940.0, 2940.0] | [17.0, 17.0] | [102, 77] |
p02970 | u401487574 | 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())\nimport math\nprint(math.ceil((n-1)/(2*d+1)) )\n', 'n,d = map(int,input().split())\nimport math\nprint(math.ceil(n/(2*d+1)) )\n'] | ['Wrong Answer', 'Accepted'] | ['s810172426', 's721821514'] | [2940.0, 2940.0] | [18.0, 18.0] | [76, 72] |
p02970 | u407891541 | 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 ... | ['\nS=input()\n\ntmp=S.split()\nN=int(tmp[0])\nD=int(tmp[1])\n\nList=[0]*N\n\ncount=0\n\nfor i in range(0+D,N-D,D+1):\n count+=1\n\nprint(count)', '\nS=input()\n\ntmp=S.split()\nN=int(tmp[0])\nD=int(tmp[1])\n\nList=[0]*N\n\ncount=0\n\nfor i in range(0+D,N-D,D+1):\n if i>=N-D:\n break\n count+=1\n\nprint... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s831097174', 's907434859', 's108824056'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 18.0] | [131, 160, 173] |
p02970 | u412481017 | 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\nn,d=map(int,input().split())\n\nprint(math.ceil(n/(2d+1.0)))\n', 'import math\n\nn,d=map(int,input().split())\n\nprint(math.ceil(n/(2*d+1.0)))\n'] | ['Runtime Error', 'Accepted'] | ['s029780584', 's632368953'] | [2940.0, 2940.0] | [17.0, 17.0] | [72, 73] |
p02970 | u413165887 | 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 = n // (2*d+1)\n\nif n%(2*d+1) == 0:\n print(a)\nelse:\n print(a+1)', "n,d = list(map(int, input().split(' ')))\n\na = n // (2*d+1)\n\nif n%(2*d+1) == 0:\n print(a)\nelse:\n print(a+1)"] | ['Runtime Error', 'Accepted'] | ['s493340889', 's270743964'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 112] |
p02970 | u416758623 | 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 = (d+1) *2\nprint((n + b -1) // b)', 'n,d = map(int, input().split())\nprint((n + d) // d+1)', 'n,d = map(int, input().split())\nb = d *2 + 1\nprint((n + b -1) // b)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s456078023', 's463651547', 's350071298'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [67, 53, 67] |
p02970 | u419877586 | 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)))'] | ['Wrong Answer', 'Accepted'] | ['s668678053', 's250501900'] | [2940.0, 3060.0] | [18.0, 17.0] | [71, 70] |
p02970 | u433380437 | 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/(2*d+1))', 'import math\nn,d = map(int,input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Wrong Answer', 'Accepted'] | ['s993811992', 's393534046'] | [9040.0, 9140.0] | [24.0, 29.0] | [63, 70] |
p02970 | u434872492 | 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\ncount = 0\nwhile(count>=N):\n count += 2*D + 1\n ans += 1\nprint(ans)', 'N, D = map(int,input().split())\nans = 0\ncount = 0\nwhile(count < N):\n count += 2*D + 1\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s331316417', 's198707758'] | [2940.0, 2940.0] | [17.0, 17.0] | [111, 112] |
p02970 | u437215432 | 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 ... | ['# ABC001A\n\nn, d = map(int, input().split())\nprint(sp.ceil(n / (2 * d + 1)))\n', '# ABC001A\n\nn, d = map(int, input().split())\nprint(-(-n // (2 * d + 1)))\n'] | ['Runtime Error', 'Accepted'] | ['s879715351', 's419129305'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 72] |
p02970 | u441320782 | 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())\nx = N//(D*2+1)\nif N%(D*2+1)1=0:\n print(x+1)\nelse:\n print(x)', 'N,D = map(int,input().split())\nx = N//(D*2+1)\nif N%(D*2+1)!=0:\n print(x+1)\nelse:\n print(x)'] | ['Runtime Error', 'Accepted'] | ['s572443366', 's907907688'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 92] |
p02970 | u455533363 | 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 (2*d+1) > N:\n print(1)\nelse:\n print(int(n / (2*d+1)))', 'n,d = map(int.input(),split())\n\nif (2*d+1) > N:\n print(1)\nelse:\n print(int(n / (2*d+1)))', 'n,d = map(int,input().split())\n\nif (2*d+1) > n:\n print(1)\nelse:\n print(int(n / (2*d+1)))', 'n,d = map(int,input()... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s546435394', 's558347780', 's785256226', 's947943034', 's380769893'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [90, 90, 90, 92, 90] |
p02970 | u455957070 | 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((2 * d + n) / (2 * d + 1))', 'n, d = map(int, input().split())\n while((2 * (d + i) + 1) * 2 >= n):\nprint((2 * d + n) / (2 * d + 1))\n\n', 'n, d = map(int, input().split())\ni = 0\nif(((d + i) + 1) * 2 >= n):\n i += 0\nelse:\n while((2 * (d + i) + 1) * 2 >= n):\n i += 1\... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s094125896', 's108095041', 's381311356', 's419571693', 's574184991'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 16.0, 2104.0, 17.0, 17.0] | [65, 104, 144, 147, 67] |
p02970 | u465101448 | 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()]\n\nans=N/(2*D+1)\nint_ans=int(ans)\nprint(ans)\n\nif ans-int_ans!=0:\n ans+=1\n\nprint(int(ans))', 'N,D=[int(x) for x in input().split()]\n\nans=N/(2*D+1)\nint_ans=int(ans)\n\nif ans-int_ans!=0:\n ans+=1\n\nprint(int(ans))'] | ['Wrong Answer', 'Accepted'] | ['s908919541', 's078456899'] | [3316.0, 3316.0] | [19.0, 21.0] | [128, 117] |
p02970 | u471828790 | 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 ... | ["inp = list(map(int, input().strip().split(' ')))\n\na = inp[0]\nb = inp[1]\n\nr = b * 2 + 1\nm = math.ceil(a / r)\nprint(m)\n", "import math\n\ninp = list(map(int, input().strip().split(' ')))\n\na = inp[0]\nb = inp[1]\n\nr = b * 2 + 1\nm = math.ceil(a / r)\nprint(m)\n"] | ['Runtime Error', 'Accepted'] | ['s732743929', 's218768159'] | [2940.0, 3060.0] | [17.0, 17.0] | [117, 130] |
p02970 | u473092610 | 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))', 'n,d=map(int,input().split())\nprint(-(-n//2d))', 'n,d=map(int,input().split())\nprint(-(-n//(2*d+1)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s186284195', 's337020874', 's722977317'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [47, 45, 50] |
p02970 | u474925961 | 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 sys\n\nif sys.platform =='ios':\n sys.stdin=open('input_file.txt')\n \na,b=map(int,input().split())\n\nprint(-(-a)//(2*b+1))", 'a,b = map(int(input().split())\n\nc=(-((-a)//(2*b+1)))\nprint(c)', 'a,b = map(int(input().split())\n\nprint(-(a//(2*b+1)))', "import sys\n\nif sys.platform =='ios':\n sys.std... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s099970070', 's411569101', 's503828603', 's692041161', 's969524438', 's261356112'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0, 17.0, 17.0] | [130, 61, 52, 129, 129, 55] |
p02970 | u477901663 | 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())\nt = 2d + 1\n \nif n % t == 0:\n\tans = n/t\nelse:\n\tans = n/t\n ans = ans + 1\n\nprint(ans)', 'n,d = (int(x) for x in input().split())\nt = 2d + 1\n\nif n % t == 0:\n ans = n/t\nelse:\n ans = n/t + 1\n \nprint(ans)', 'n,d = input().split()\nn = int(n)\nd = int(d)\nt... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s092603953', 's249111860', 's309430466', 's011450751'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [129, 114, 133, 151] |
p02970 | u477977638 | 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+1))\n', 'n,d=map(int,input())\nprint(int(n//(2*d+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)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s603334409', 's640545842', 's582506595'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [51, 42, 103] |
p02970 | u483873684 | 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 ... | ['l=list(map(int,input().rstrip().split()))\na=l[0]\nb=l[1]\nc=(2*b)+1\nu=int(a/c)\nif(a%c==0):\n print(u)\nelse():\n print(u+1)', 'l=list(map(int,input().rstrip().split()))\na=l[0]\nb=l[1]\nc=(2*b)+1\nu=int(a/c)\nif(a%c==0):\n print(u)\nelse:\n print(u+1)\n'] | ['Runtime Error', 'Accepted'] | ['s552299527', 's949963810'] | [2940.0, 2940.0] | [17.0, 18.0] | [120, 119] |
p02970 | u484052148 | 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 = d*2+1\nans = 0\nwhile d*ans < n:\n ans += 1\nprint(ans)', 'n, d = map(int, input().split())\na = d*2+1\nans = 0\nwhile a*ans < n:\n ans += 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s438627396', 's146402613'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 90] |
p02970 | u491462774 | 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\ndef func():\n num_apple, index = input('').rstrip().split(' ')\n return math.ceil(int(num_apple) / (2*int(index) + 2))\n\nif __name__ == '__main__':\n print(func())", "import math\ndef func():\n num_apple, index = input('').rstrip().split(' ')\n return math.ceil(int(num_apple) / (2*int(ind... | ['Wrong Answer', 'Accepted'] | ['s263594638', 's167968161'] | [2940.0, 2940.0] | [17.0, 18.0] | [180, 180] |
p02970 | u492447501 | 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\nS = input()\n\nS = S.split()\n\nN = int(S[0])\nD = int(S[1])\n\nprint(math.ceil(N*(2*D+1)))', 'import math\n\nS = input()\n\nS = S.split()\n\nN = int(S[0])\nD = int(S[1])\n\nprint(math.ceil(N/(2*D+1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s187001022', 's900829821'] | [2940.0, 2940.0] | [17.0, 18.0] | [97, 98] |
p02970 | u497047499 | 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 = 0\nif n % d != 0:\n a = 1\nprint(n / d + a)', 'n,d = map(int,input().split())\na = 0\nif n % d != 0:\n a = 1\nprint(n / (2 * d) + a)', 'n,d = map(int,input().split())\na = 0\nif n % d != 0:\n a = 1\nprint(n // (2 * d) + a)', 'n,d = map(int,input().split())\na = 0\nif n % (2 * d ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s029221268', 's402452193', 's837975359', 's461253021'] | [2940.0, 2940.0, 3060.0, 2940.0] | [17.0, 17.0, 19.0, 17.0] | [76, 82, 83, 97] |
p02970 | u497952650 | 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 N,D = map(int,input().split())\n if (N//(2*D+1))%1==0:\n print(N//(2*D+1))\n else:\n print(N//(2*D+1)+1)\n \nif __name__=="__main__":\n main()', 'def main():\n import math\n\n N,D = map(int,input().split())\n print(math.ceil(N/(2*D+1)))\n\n \nif __name__=="__main... | ['Wrong Answer', 'Accepted'] | ['s930037169', 's501777171'] | [2940.0, 2940.0] | [18.0, 17.0] | [177, 137] |
p02970 | u505893372 | 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\nif N%(2D+1) == 0 :\n\tans = 0\n\tans = int(N//(2D+1))\n\tprint(ans)\nelse:\n\tans = 0\n\tans = int(N//(2D+1))+1\n\tprint(ans)', 'N,D = map(int,input().split())\n\n\nif N%(2*D+1) == 0 :\n\tans = 0\n\tans = N//(2*D+1)\n\tprint(ans)\nelse:\n\tans = 0\n\tans = int(N//(2*D+1))+1\n\tprin... | ['Runtime Error', 'Accepted'] | ['s007002071', 's486364387'] | [2940.0, 2940.0] | [17.0, 18.0] | [145, 143] |
p02970 | u506858457 | 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)\nprint(ans)', 'N,D=map(int,input().split())\nif N%(2*D+1)==0:\n ans=N/(2*D+1)\nelse:\n ans=N//(2*D+1)+1\nprint(int(ans))'] | ['Wrong Answer', 'Accepted'] | ['s361515663', 's663576642'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 102] |
p02970 | u506944347 | 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())\ns = 0\nq = 0\nwhile s < n:\n s += (d * 2 + 1)\n q += 1\n\nprint(q)', "m = input()\nm = m.split(' ')\nn = int(m[0])\nd = int(m[1])\ns = 0\nq = 0\nwhile s < n:\n s += (d * 2 + 1)\n q += 1\n\nprint(q)"] | ['Runtime Error', 'Accepted'] | ['s866009713', 's434815348'] | [2940.0, 2940.0] | [18.0, 17.0] | [100, 123] |
p02970 | u508273185 | 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())\ncount = 0\n\nfor i in range(n):\n if n >= 2*d+1:\n count += 1\n n = n - (2*d+1)\nprint(n)\nif n != 0:\n count += 1\nprint(count)', '\nimport math\nn, d = map(int,input().split())\n\nprint(math.ceil(n/(2*d + 1)))'] | ['Wrong Answer', 'Accepted'] | ['s066732516', 's901143017'] | [2940.0, 2940.0] | [17.0, 18.0] | [173, 85] |
p02970 | u509830642 | 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 sys\ninput = sys.stdin.readline\nimport math\ndef print_ans(N, D):\n """Test Case\n >>> print_ans(6, 2)\n 2\n >>> print_ans(14, 3)\n 2\n >>> print_ans(20, 4)\n 3\n """\n print(math.ceil(N / (D * 2 + 1)))\n \n\nif __name__ == \'__main__\':\n N, D = map(int,input().rstrip().sprit... | ['Runtime Error', 'Accepted'] | ['s825485323', 's098979273'] | [3060.0, 3060.0] | [18.0, 17.0] | [324, 324] |
p02970 | u514118270 | 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().split())\nif a % b == 0:\n print(a//b)\nelse:\n print(a//b+1)', 'a,b = list(map(int,input().split()))\nif a % b == 0:\n print(a//b)\nelse:\n print(a//b+1)\n', 'a,b = list(map(int,input().split()))\nif a % (b*2+1)== 0:\n print(a//(b*2+1))\nelse:\n print(a//(b*2+1)+1)\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s000386411', 's986457653', 's514572664'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0] | [77, 88, 105] |
p02970 | u517447467 | 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 = list(map(int, input().split()))\nprint(math.ceil(N/D))', 'import math\nN, D = list(map(int, input().split()))\nprint(math.ceil(N/(D*2+1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s799889854', 's616284193'] | [2940.0, 2940.0] | [17.0, 18.0] | [72, 79] |
p02970 | u518042385 | 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())\nin n%(2*d+1)==0:\n print(n//(2*d+1))\nelse:\n print(n//(2*d+1)+1)\n', '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'] | ['s029572481', 's678418659'] | [2940.0, 2940.0] | [17.0, 17.0] | [94, 93] |
p02970 | u518987899 | 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().strip().split(' '))\narea = 2*D+1\nprint((N+area-1)///area)", "N,D = map(int, input().strip().split(' '))\narea = 2*D+1\nprint((N+area-1)//area)\n"] | ['Runtime Error', 'Accepted'] | ['s564030226', 's953331739'] | [2940.0, 2940.0] | [17.0, 17.0] | [80, 80] |
p02970 | u522293645 | 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)/(d+1)))', 'n,d = map(int,input().split())\n\nprint((n-d)//(d+1))', 'n,d = map(int,input().split())\n\nprint(-(-n//(2*d+1)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s071590550', 's444841932', 's190682219'] | [2940.0, 3316.0, 2940.0] | [17.0, 20.0, 17.0] | [54, 51, 53] |
p02970 | u523545435 | 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\nN,D=int(input().split())\n\nif N%(2*D+1)==0:\n print(N//(2*D+1))\nelse:\n print((N//(2*D+1))+1)', 'import math\n\nN,D=map(int,input().split())\n\nif N%(2*D+1)==0:\n print(N//(2*D+1))\nelse:\n print((N//(2*D+1))+1)'] | ['Runtime Error', 'Accepted'] | ['s891389727', 's788074372'] | [3060.0, 2940.0] | [18.0, 17.0] | [109, 113] |
p02970 | u534081198 | 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 = input().split()\neach = D*2 + 1 \nprint(-(-N // each))\n', 'N, D = input().split()\neach = int(D)*2 + 1 \nprint(-(-int(N) // each))'] | ['Runtime Error', 'Accepted'] | ['s695584130', 's921611110'] | [3064.0, 2940.0] | [18.0, 17.0] | [60, 69] |
p02970 | u536685012 | 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 ... | ['ns, ds = input().split()\nn, d = int(ns), int(ds)\n\nif n % (2 * d + 1) == 0:\n ans = n / (2 * d + 1)\nelse:\n ans = floor(n / (2 * d + 1)) + 1\n\nprint(ans)', 'import math\nns, ds = input().split()\nn, d = int(ns), int(ds)\n\nif n % (2 * d + 1) == 0:\n ans = n / (2 * d + 1)\nelse:\n ans = math.floor(n / (2 * d +... | ['Runtime Error', 'Accepted'] | ['s382751175', 's506615941'] | [2940.0, 2940.0] | [17.0, 18.0] | [151, 174] |
p02970 | u538956308 | 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())\ns = 0\ncnt = 0\nwhile s > N:\n s += 1\n s += 2*D\n cnt += 1 \nprint(cnt)', 'N,D = map(int(input().split()))\nsum = 1\ncnt = 0\nwhile sum > N:\n sum += 2D\n cnt += 1\n\nprint(cnt)', 'N,D = map(int, input().split())\nsum = 1\ncnt = 0\nwhile sum > N:\n sum += 2*D\n cnt += 1\n \npr... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s383076904', 's536710202', 's760449952', 's806272896', 's950942249', 's990416928'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0] | [101, 97, 99, 93, 95, 91] |
p02970 | u539367121 | 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)//(2*d))', 'n,d=map(int,input().split())\nprint((n+(2*d))//(2*d+1))\n'] | ['Wrong Answer', 'Accepted'] | ['s416445373', 's967044044'] | [9136.0, 9128.0] | [29.0, 28.0] | [52, 55] |
p02970 | u540799318 | 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 numpy as np\n\nn,d= int(input())\n\nprint(int(np.ceil(n/(2*d+1))))\n', 'import numpy as np\n\nn, d = map(int, input().split())\n\nprint(int(np.ceil(n/(2*d+1))))\n\n'] | ['Runtime Error', 'Accepted'] | ['s866376954', 's097138994'] | [12500.0, 12392.0] | [151.0, 149.0] | [70, 86] |
p02970 | u546686251 | 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) + 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 )\n'] | ['Wrong Answer', 'Accepted'] | ['s991529843', 's641294055'] | [2940.0, 2940.0] | [18.0, 17.0] | [61, 127] |
p02970 | u549497563 | 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))', 'import math\nn,d = map(int,input().split())\nprint(math.ceil(n/(d*2+1)))'] | ['Wrong Answer', 'Accepted'] | ['s589704846', 's902225624'] | [2940.0, 2940.0] | [17.0, 18.0] | [64, 70] |
p02970 | u550535134 | 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/(2D+1)))', 'import math\nN, D = map(int, input().split())\nprint(math.ceil(N/(2*D+1)))\n'] | ['Runtime Error', 'Accepted'] | ['s264468181', 's637692803'] | [2940.0, 2940.0] | [17.0, 17.0] | [71, 73] |
p02970 | u551692187 | 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))', 'import math \nN,D = map(int, input().split())\nprint(math.ceil(N/(D*2+1)))'] | ['Wrong Answer', 'Accepted'] | ['s574182310', 's441408302'] | [2940.0, 3188.0] | [17.0, 19.0] | [49, 72] |
p02970 | u556225812 | 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))', 'import math\nN, D = map(int, input().split())\nprint(math.ceil(N/(2*D+1)))'] | ['Wrong Answer', 'Accepted'] | ['s284667211', 's546579082'] | [2940.0, 2940.0] | [18.0, 18.0] | [50, 72] |
p02970 | u556371693 | 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*2==0:\n print(n//2*d)\nelse:\n print(n//2*d+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'] | ['s147478644', 's500766464'] | [2940.0, 3064.0] | [19.0, 18.0] | [87, 99] |
p02970 | u561295749 | 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 ... | ['try:\n temp = input().split()\n N=int(temp[0])\n print(N)\n D=int(temp[1])\n print(D)\n can_read=2*D+1\n cnt=0\n while(N>0):\n N=N-can_read\n cnt=cnt+1\n print(cnt)\nexcept ValueError:\n print("input miss")', 'try:\n temp = input().split()\n N=int(temp[0])\n D=int(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s069561642', 's295581335', 's573199843', 's945561780', 's990708247', 's065654376'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 20.0] | [237, 214, 214, 237, 145, 127] |
p02970 | u562550538 | 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\nprint(N//D)', 'N, D = map(int, input().split())\nD = 2*D + 1\nprint((N+D-1)//D)'] | ['Wrong Answer', 'Accepted'] | ['s278718533', 's717700782'] | [2940.0, 2940.0] | [17.0, 17.0] | [56, 62] |
p02970 | u571969099 | 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(i) for i in input().split()]\na = 2*d+1\nprint((n+d-1)//d)\n', 'n,d = [int(i) for i in input().split()]\na = 2*d+1\nprint((d+d-1)//d)', 'n,d = [int(i) for i in input().split()]\na = 2*d+1\nprint((n+a-1)//a)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s214028508', 's417028036', 's100013883'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [68, 67, 68] |
p02970 | u580199868 | 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=input().split()\nprint(math.ceil(N/(D*2+1)))', 'import math\nN,D=map(int,input().split())\nprint(math.ceil(N/(D*2+1)))'] | ['Runtime Error', 'Accepted'] | ['s808178777', 's939470202'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 68] |
p02970 | u582663624 | 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\nl=list(map(int,input().split()))\nn=l[0]\nd=l[1]\nprint(math.ceil(n/(2d+1)))\n ', 'import math\n\nl=list(map(int,input().split()))\nn=l[0]\nd=l[1]\nprint(math.ceil(n/(2*d+1)))\n '] | ['Runtime Error', 'Accepted'] | ['s481089880', 's249375598'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 90] |
p02970 | u584083761 | 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 ... | ['i1 = list(map(int, f.input().split()))\n\no1 = ((i1[0]) // (i1[1]*2 + 1))\no2 = ((i1[0]) % (i1[1]*2 + 1))\nif o2 == 0:\n print(o1)\nelse:\n print(o1 + 1)', 'i1 = list(map(int, input().split()))\n\no1 = ((i1[0]) // (i1[1]*2 + 1))\no2 = ((i1[0]) % (i1[1]*2 + 1))\nif o2 == 0:\n print(o1)\nelse:\n print(o1 + ... | ['Runtime Error', 'Accepted'] | ['s570853245', 's449422856'] | [3060.0, 3060.0] | [17.0, 17.0] | [152, 150] |
p02970 | u586759271 | 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/(2*d+1))', 'import math\nn,d=map(int,input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Wrong Answer', 'Accepted'] | ['s649720396', 's334905872'] | [2940.0, 2940.0] | [17.0, 17.0] | [61, 68] |
p02970 | u597622207 | 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\nq, mod = divmod(a, 2*b+1)\n\nprint(a) if mod == 0 else a+1', 'a, b = map(int, input().split())\n \nq, mod = divmod(a, 2*b+1)\n \nprint(q) if mod == 0 else print(q+1)'] | ['Wrong Answer', 'Accepted'] | ['s893719979', 's089512662'] | [2940.0, 2940.0] | [17.0, 17.0] | [90, 99] |
p02970 | u599547273 | 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())\n\nprint(-(-N//(2*D+1)))', 'N, D = map(int, input().split(" "))\n\nprint(-(-N//(2*D+1)))'] | ['Runtime Error', 'Accepted'] | ['s865716116', 's377525090'] | [2940.0, 2940.0] | [17.0, 17.0] | [42, 58] |
p02970 | u599925824 | 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(round(N / (D * 2 + 1)))\n', 'import math\nN, D = map(int, input().split())\nprint(math.ceil(N / (2*D+1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s627608369', 's312701599'] | [2940.0, 2940.0] | [17.0, 18.0] | [63, 75] |
p02970 | u600717568 | 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())\nm=(N-1)//(2D+1)\nn=m+1\nprint(n)', 'n, d = map(int, input().split())\nprint(1 + n//(2*d+1)) if n%(2*d+1) else print(n//(2*d+1))'] | ['Runtime Error', 'Accepted'] | ['s028075898', 's179430430'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 90] |
p02970 | u602773379 | 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 ... | ['from math import factorial as fact\nimport math\nimport sys\nimport itertools\nimport numpy as np\nfrom collections import Counter\nimport datetime\nfrom collections import deque\n\n\n\ndef input1():\n\treturn int(input())\n\n\ndef input2():\n\treturn map(int,input().split())\n\n\ndef input_array():\n\treturn list(ma... | ['Wrong Answer', 'Accepted'] | ['s646206238', 's945022505'] | [12492.0, 12492.0] | [154.0, 150.0] | [1656, 1655] |
p02970 | u607075479 | 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-1)//(D*2+1)+1)', 'N,D=map(int, input().split())\nprint((N-1)//(D*2+1)+1)'] | ['Runtime Error', 'Accepted'] | ['s675661872', 's761155755'] | [2940.0, 2940.0] | [17.0, 17.0] | [51, 53] |
p02970 | u607754357 | 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\nS = input().split()\nN = int(S[0])\nD = int(S[1])\n\nprint(N)\nprint(D)\n\nprint(math.ceil(N / (D * 2 + 1)))', 'import math\n\nS = input().split()\nN = int(S[0])\nD = int(S[1])\n\nprint(math.ceil(N / (D * 2 + 1)))'] | ['Wrong Answer', 'Accepted'] | ['s504545182', 's659067793'] | [2940.0, 3060.0] | [18.0, 17.0] | [114, 95] |
p02970 | u614964888 | 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/D))', 'import math \nN,D=map(int, input().split())\n\nprint(math.ceil(N/2*D))', 'import math\nN,D=map(int, input().split())\n\nprint(math.ceil(N/(2*D+1)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s077939006', 's544621511', 's854889672'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [64, 67, 70] |
p02970 | u620846115 | 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())\np = n/(2d+1)\nif p % 1 ==0:\n print(p)\nelse:\n print((p//1)+1)', 'import math\nn,d = map(int,input().split())\nprint(math.ceil(n/(2d+1)))', 'import math\nn,d = map(int,input().split())\nprint(math.ceil(n/(2*d+1)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s682240641', 's883492405', 's004073638'] | [8880.0, 8988.0, 9144.0] | [21.0, 21.0, 28.0] | [92, 69, 70] |
p02970 | u621509924 | 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=0\nwhile a*((2*D)+1)>=N:\n a=a+1\nprint(a)', 'N,D=map(int,input().split())\na=0\nwhile a*((2*D)+1)>=N:\n a=a+1\nprint(a)', 'N,D=map(int,input().split())\na=0\nwhile a*((2*D)+1)<N:\n a=a+1\nprint(a)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s074263947', 's934460374', 's036501146'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [73, 73, 72] |
p02970 | u626228246 | 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))))'] | ['Runtime Error', 'Accepted'] | ['s501348565', 's486916196'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 72] |
p02970 | u626337957 | 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())\nhani = 2*D+1\nif N%hani:\n print(N//hani)\nelse:\n print(N//hani+1)', 'N, D = map(int, input().split())\nhani = 2*D+1\nif N%hani == 0:\n print(N//hani)\nelse:\n print(N//hani+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s330579051', 's569749294'] | [2940.0, 2940.0] | [17.0, 18.0] | [98, 104] |
p02970 | u634682697 | 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\nwhile True:\n a = n- i*(2*d+1)\n if a<=0:\n print(i)\n break\n', 'n,d = map(int, input().split())\na = 0\nct=0\n\nfor i in range(n):\n a = n- i*(2*d+1)\n ct +=1\n if a<=0:\n break\n\nprint(ct)', '\nn,d = map(int, input().split())\n\nwhile True:\n ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s450475575', 's588668946', 's900102484', 's309624417'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 18.0] | [110, 132, 138, 197] |
p02970 | u635538726 | 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 / (2*D+1))', 'import math\nN, D = map(int,input().split())\nprint(math.ceil(N / (2*D+1)))'] | ['Wrong Answer', 'Accepted'] | ['s995426151', 's543281189'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 73] |
p02970 | u647287452 | 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.cell(N/(2*D)))\n', 'import math\nN,D = map(int,input().split())\nprint(math.floor(N/(2D)))\n', 'import math\nN,D = map(int,input().split())\nprint(math.floor(N/(2*D)))\n', 'import math\nN,D = map(int,input().split())\nprint(math.floor(N/D))', 'import math\nN,D =... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s518384965', 's549785566', 's639826725', 's839416086', 's523316516'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 18.0] | [69, 69, 70, 65, 71] |
p02970 | u652892331 | 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(i) for i in input().split())\n\nd = d*2 +1\nd = d*2\nq = n//d\nmod = n % d\nans = q\nif mod != 0:\n ans += 1\n\nprint(ans)', 'n,d = (int(i) for i in input().split())\n\nd = d*2 +1\nif d >= n:\n ans = 1\nelse:\n q = n//d\n mod = n % d\n ans = q\n if mod != 0:\n ans += 1\n\nprint(ans... | ['Wrong Answer', 'Accepted'] | ['s240040669', 's378426792'] | [3060.0, 3060.0] | [17.0, 17.0] | [126, 167] |
p02970 | u653175574 | 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 // D + 1\nprint(ans)', 'N, D = map(int, input().split())\nif N % (2 * D + 1) == 0:\n ans = N // (2 * D + 1)\nelse:\n ans = N // (2 * D + 1) + 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s802023476', 's592466085'] | [2940.0, 2940.0] | [18.0, 17.0] | [60, 128] |
p02970 | u653837719 | 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 // (2 * d + 1))\n', 'n, d = map(int, input().split())\n\nprint((n + 2 * d) // (2 * d + 1))\n'] | ['Wrong Answer', 'Accepted'] | ['s576283367', 's875502034'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 68] |
p02970 | u657994700 | 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\nN, D = map(int,input().split())\nprint(math.floor(N / (D*2+1)))', 'import math\n\nN, D = map(int,input().split())\nprint(math.ceil(N / (D*2+1)))'] | ['Wrong Answer', 'Accepted'] | ['s537930862', 's004677932'] | [2940.0, 2940.0] | [17.0, 19.0] | [75, 74] |
p02970 | u658288444 | 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)))', 'n, d = map(int, input().split())\nprint(-(-n//(2*d+1)))'] | ['Runtime Error', 'Accepted'] | ['s679787928', 's658004402'] | [2940.0, 3316.0] | [17.0, 21.0] | [53, 54] |
p02970 | u662449766 | 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 sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n n, d = [int(i) for i in input().split()]\n num = n / (d * 2 + 1)\n print(num + (n % (d * 2 + 1) != 0))\n\n\nif __name__ == "__main__":\n main()\n', 'import sys\n\ninput = sys.stdin.readline\n\n\ndef main():\n n, d = [int(i) for i in input().sp... | ['Wrong Answer', 'Accepted'] | ['s814594726', 's659956698'] | [2940.0, 2940.0] | [17.0, 17.0] | [204, 205] |
p02970 | u673338219 | 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 = int(input())\nd = int(input())\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'] | ['s335446050', 's352179512'] | [2940.0, 2940.0] | [17.0, 18.0] | [73, 70] |
p02970 | u685662874 | 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)', 'n,d=map(int,input().split())\nimport math\nprint(math.ceil(n/(2*d+1)))\n'] | ['Wrong Answer', 'Accepted'] | ['s154938696', 's204644677'] | [2940.0, 2940.0] | [17.0, 17.0] | [43, 69] |
p02970 | u688375653 | 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())\nint(N/(2*D) + 0.5)', 'N, D=map(int,input().split())\na=N/(2*D)\nif a>int(a):\n print(a+1)\nelse:\n print(a)', 'N, D=map(int,input().split())\na=N/(2*D+1)\nif a>int(a):\n print(int(a)+1)\nelse:\n print(int(a))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s291943069', 's412282938', 's610388750'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [48, 86, 98] |
p02970 | u692054751 | 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()]\ntotal = 0\ncount = 0\n\nfor i in range(N,0,-1):\n total += (i-D + i+D)\n count += 1\n if total >= N:\n break\n\nprint(count)', 'N, D = [int(s) for s in input().split()]\nprint(N // (2 * D + 1) + (N % (2 * D + 1) != 0) )'] | ['Wrong Answer', 'Accepted'] | ['s904080176', 's568923841'] | [3060.0, 2940.0] | [17.0, 17.0] | [161, 90] |
p02970 | u693694535 | 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)%(2*D)!=0:\n print((N-2)//(2*D)+1)\nelse:\n print((N-2)//(2*D))', 'N,D=map(int,input().split())\nif (N-2)%(2*D)!=0:\n print((N-2)//(2*D)+1)\nelse:\n print((N-2)//(2*D))', 'N,D=map(int,input().split())\nif N%(2*D+1)!=0:\n print(N//(2*D+1)+1)\nelse:\n print(N//(2*... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s401861089', 's701481479', 's311378606'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [103, 103, 97] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.