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 |
|---|---|---|---|---|---|---|---|---|---|---|
p03220 | u300968187 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\ndif = list(map(lambda x: abs(T - int(x) * 0.006 - A), input().split()))\nprint(dif.index(min(x_list)) + 1)', 'n = int(input())\nt, a = map(int, input().split())\nt = (a - t) * 1000\nh = list(map(int, input().split()))\nmin_val = 10 ** 9\nfor i, x in enumerate(h):\n if min_val > abs(t + x * 6):\n min_val = abs(t + x * 6)\n ans = i\nprint(ans + 1)'] | ['Runtime Error', 'Accepted'] | ['s996452320', 's433960907'] | [3060.0, 3064.0] | [21.0, 18.0] | [155, 245] |
p03220 | u304630225 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N=int(input())\nT,A=map(int,input().split())\nH=list(map(int,input().split()))\nprint(H)\nP=X=B=0\nfor i in range(N) :\n X=abs(A-(T-H[i]*0.006))\n if X<=P :\n B=i\n P=X\nprint(B+1)', 'N=int(input())\nT,A=map(int,input().split())\nL=[]\nfor i in map(int,input().split()) :\n B=abs(A-(T-i*0.006))\n L.append(B)\nprint(L.index(min(L))+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s098233463', 's944277012'] | [3064.0, 3060.0] | [19.0, 18.0] | [176, 147] |
p03220 | u305452255 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ["n = int(input())\nt, a = map(int, input().split(' '))\nH = list(map(int, input().split(' ')))\n\nret = []\nfor i, h in enumerate(H):\n ret.append(abs(a - (t - 0.006 * h)))\nprint(H[ret.index(min(ret))])", "n = int(input())\nt, a = map(int, input().split(' '))\nH = list(map(int, input().split(' ')))\n\nret = []\nfor i, h in enumerate(H):\n ret.append(abs(a - (t - 0.006 * h)))\nprint(ret.index(min(ret)) + 1)"] | ['Wrong Answer', 'Accepted'] | ['s627859713', 's000131087'] | [3060.0, 3060.0] | [21.0, 18.0] | [198, 199] |
p03220 | u307159845 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int, input().split())\nH = list(map(int, input().split()))\n\nmin_val = 10000\n\nfor i in range(len(H)):\n tmp = T - H[i] * 0.006\n sub = abs(tmp - A)\n if min_val > sub:\n ans = i\n min_val = sub2\n\n\nprint(ans+1)\n', 'N = int(input())\nT,A = map(int, input().split())\nH = list(map(int, input().split()))\n\nmin_val = 10000\n\nfor i in range(len(H)):\n tmp = T - H[i] * 0.006\n sub = abs(tmp - A)\n if min_val > sub:\n ans = i\n min_val = sub\n\n\nprint(ans+1)\n'] | ['Runtime Error', 'Accepted'] | ['s639084277', 's107081655'] | [3060.0, 3060.0] | [20.0, 18.0] | [253, 252] |
p03220 | u309039873 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input().strip())\nT,A = map(int,input().strip().split())\nHs = [int(x) for x in input().strip().split()]\nposTempDiv = 10000000\nposId = 0\nfor i in range(N):\n if posTempDiv > abs(A - (T - Hs[i] * 0.006)):\n posTempDIv = abs(A - (T - Hs[i] * 0.006))\n posId = i + 1\nprint(posId)', 'N = int(input().strip())\nT,A = map(int,input().strip().split())\nHs = [int(x) for x in input().strip().split()]\nposTemp = 10000000\nposId = 0\nfor i in range(N):\n if posTemp > abs(A - (T - Hs[i] * 0.006)):\n posTemp = abs(A - (T - Hs[i] * 0.006))\n posId = i + 1\nprint(posId)'] | ['Wrong Answer', 'Accepted'] | ['s766080974', 's872390177'] | [3064.0, 3060.0] | [18.0, 18.0] | [296, 287] |
p03220 | u309977459 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nans = 0\ntemp = 10**9\nfor i in range(N):\n if abs(T-H[i]*0.006) < temp:\n ans = i+1\n temp = abs(T-H[i]*0.006)\nprint(ans)\n', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nans = 0\ntemp = 10**9\nfor i in range(N):\n if abs(T-H[i]*0.006-A) < temp:\n ans = i+1\n temp = abs(T-H[i]*0.006-A)\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s256224534', 's862328179'] | [3060.0, 3060.0] | [18.0, 18.0] | [222, 226] |
p03220 | u311669106 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nln=[int(h) for h in input().split()]\nln = sorted(ln)\ni=0\nfor h in ln:\n while (t-h*0.006)<=a:\n i+=1\nprint(min(ln[i],ln[i+1]).index())', 'n=int(input())\nt,a=map(int,input().split())\nln=[abs(a-(t-0.006*int(x))) for x in input().split()]\nprint(ln.index(min(ln)))', 'n=int(input())\nt,a=map(int,input().split())\nln=[t-0.006*int(a) for a in input().split()]\nlm=[]\nfor x in ln:\n lm.append(abs(a-x))\nprint(lm.index(min(lm)))', 'n=int(input())\nt,a=map(int,input().split())\nln=[t-0.006*int(x) for x in input().split()]\nprint(min(ln))', 'n=int(input())\nt,a=map(int,input().split())\ntem=[abs(t-0.006*int(m)-a) for m in input().split()]\nprint(tem.index(min(tem)))', 'n=int(input())\nt,a=map(int,input().split())\ntem=[abs(t-0.006*int(m)-a) for m in input().split()]\nprint(min(tem))', 'n=int(input())\nt,a=map(int,input().split())\nln=[t-0.006*int(a) for a in input().split()]\nlm=[]\nfor x in ln:\n lm.append(abs(a-x))\nprint(lm.index(min(lm))+1)'] | ['Time Limit Exceeded', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s084712724', 's188020787', 's686897720', 's701112932', 's762528430', 's818671705', 's070136813'] | [3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0, 3060.0] | [2104.0, 20.0, 18.0, 17.0, 20.0, 18.0, 18.0] | [186, 122, 156, 103, 123, 112, 158] |
p03220 | u314089899 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH_list = [int(e) for e in input().split()]\n\ndiff=1000000\nans = 0\n\nfor i in H_list:\n\t \n if abs(A-(T−i*0.006)) < diff\n \tdiff = abs(A-(T−i*0.006))\n ans=i\n \nprint(ans)', 'N = int(input())\nT, A = map(int, input().split())\nH_list = [int(e) for e in input().split()]\n \ndiff=1000000\nans = 0\n \nfor i in range(len(H_list)):\n if abs(T-H_list[i]*0.006-A)<diff:\n diff = abs(T-H_list[i]*0.006-A)\n ans = i\n \nprint(ans+1)'] | ['Runtime Error', 'Accepted'] | ['s074805845', 's580302729'] | [2940.0, 3060.0] | [17.0, 18.0] | [237, 256] |
p03220 | u316386814 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import numpy as np\n\nn = int(input())\nt, a = list(map(int, input().split()))\nli = np.asarray(list(map(int, input().split())))\n\nli2 = np.abs(t - li * 0.006 - a)\nprint(np.argmin(li2))', 'import numpy as np\n\nn = int(input())\nt, a = list(map(int, input().split()))\nli = np.asarray(list(map(int, input().split())))\n\nli2 = np.abs(t - li * 0.006 - a)\nprint(np.argmin(li2) + 1)'] | ['Wrong Answer', 'Accepted'] | ['s227355831', 's826824715'] | [21008.0, 12508.0] | [304.0, 163.0] | [180, 184] |
p03220 | u317440328 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N=int(input())\nT,A=map(int,input().split())\nH=[int(i) for i in input().split()]\nI=[T-item*0.006 for item in H]\nprint(I)\nD=[abs(A-item) for item in I]\nprint((D.index(min(D)))+1)', 'N=int(input())\nT,A=map(int,input().split())\nH=[int(i) for i in input().split()]\nI=[T-item*0.006 for item in H]\nprint(I)\nD=[abs(A-item) for item in I]\nprint((D.index(min(D)))+1)', 'N=int(input())\nT,A=map(int,input().split())\nH=[int(i) for i in input().split()]\nI=[T-item*0.006 for item in H]\nprint(I)\nD=[abs(A-item) for item in I]\nprint((D.index(min(D)))+1)', 'N=int(input())\nT,A=map(int,input().split())\nH=[int(i) for i in input().split()]\nI=[T-item*0.006 for item in H]\nD=[abs(A-item) for item in I]\nprint((D.index(min(D)))+1)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s047391738', 's272239142', 's481428740', 's462450750'] | [3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 18.0] | [176, 176, 176, 167] |
p03220 | u318427318 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['#-*-coding:utf-8-*-\nimport sys\ninput=sys.stdin.readline\nimport decimal\n\ndef main():\n numbers=[]\n n = int(input())\n t,a = map(int,input().split())\n numbers=list(map(int,input().split()))\n dp=[]\n hensu=decimal.Decimal(\'0.006\')\n for number in numbers:\n tmp=t-number*hensu\n dp.append(a-tmp)\n print(dp)\n print(dp.index(min(dp))+1)\n\nif __name__=="__main__":\n main()', '#-*-coding:utf-8-*-\nimport sys\ninput=sys.stdin.readline\nimport decimal\n\ndef main():\n numbers=[]\n n = int(input())\n t,a = map(int,input().split())\n numbers=list(map(int,input().split()))\n dp=[]\n hensu=decimal.Decimal(\'0.006\')\n for number in numbers:\n tmp=abs(t-number*hensu-a)\n dp.append(tmp)\n answer=dp.index(min(dp))+1\n print(answer)\n\nif __name__=="__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s732291287', 's992948498'] | [9848.0, 9928.0] | [35.0, 35.0] | [403, 412] |
p03220 | u327532412 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['from operator import itemgetter\nN = int(input())\nT, A = map(int, input().split())\n*H, = map(int, input().split())\navg = sorted([[i+1, abs(T - (h * 0.006))] for i, h in enumerate(H)], key=itemgetter(1))\nprint(avg[0][0])', 'from operator import itemgetter\nN = int(input())\nT, A = map(int, input().split())\n*H, = map(int, input().split())\navg = sorted([[i+1, abs(T - (h * 0.006)) - abs(A)] for i, h in enumerate(H)], key=itemgetter(1))\nprint(avg[0][0])', 'from operator import itemgetter\nN = int(input())\nT, A = map(int, input().split())\n*H, = map(int, input().split())\navg = sorted([[i+1, abs(T - (h * 0.006) - A)] for i, h in enumerate(H)], key=itemgetter(1))\nprint(avg[0][0])'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s172574646', 's610490950', 's696043809'] | [3188.0, 3188.0, 3188.0] | [22.0, 19.0, 19.0] | [218, 227, 222] |
p03220 | u329706129 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nt = [(T - H[i] * 0.006) for i in range(N)]\nprint(t)\ncur = 100000\nfor i in range(N):\n if (abs(t[i] - A) < cur): ans = i\nprint(ans)\n', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nt = [(T - H[i] * 0.006) for i in range(N)]\ncur = 100000\nfor i in range(N):\n if (abs(t[i] - A) < cur): cur, ans = abs(t[i] - A), i + 1\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s365603215', 's180804977'] | [3060.0, 3060.0] | [19.0, 18.0] | [219, 234] |
p03220 | u329865314 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['i=input;s=split;t,a=map(int,i().s());l=list(map(lambda x:abs(t-int(x)*0.006-a),i().s()));print(l.index(min(l))+1)', 'i=input;i();t,a=map(int,i().split());l=list(map(lambda x:abs(t-int(x)*0.006-a),i().split()));print(l.index(min(l))+1)'] | ['Runtime Error', 'Accepted'] | ['s426781825', 's070981823'] | [3060.0, 3060.0] | [18.0, 18.0] | [113, 117] |
p03220 | u333190709 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = input().split()\nH = input().split()\n\nmin = 10000000\nindex = -1\n\nfor i in range(N):\n temp = int(T) - int(H[i]) * 0.006\n print(temp)\n if min > abs(int(A) - temp):\n min = abs(int(A) - temp)\n index = i\n\nprint(index+1)', 'N = int(input())\nT, A = input().split()\nH = input().split()\n\nmin = 10000000\nindex = -1\n\nfor i in range(N):\n temp = int(T) - int(H[i]) * 0.006\n if min > abs(int(A) - temp):\n min = abs(int(A) - temp)\n index = i\n\nprint(index+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s281638309', 's971892570'] | [3188.0, 3060.0] | [20.0, 18.0] | [246, 233] |
p03220 | u333945892 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ["from collections import defaultdict\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpl_str(): return list(input().split())\n\nN = int(input())\nT,A = inpl()\nHH = inpl()\n\ntemp = [T-0.006*H for H in HH]\ntemp.sort()\n\nans = -1\nMIN = INF\nfor i,t in enumerate(temp):\n if MIN > abs(t-A):\n ans = i\n MIN = abs(t-A)\nprint(ans+1)\n", "from collections import defaultdict\nimport sys,heapq,bisect,math,itertools,string,queue,datetime\nsys.setrecursionlimit(10**8)\nINF = float('inf')\nmod = 10**9+7\neps = 10**-7\ndef inpl(): return list(map(int, input().split()))\ndef inpl_str(): return list(input().split())\n\nN = int(input())\nT,A = inpl()\nHH = inpl()\n\ntemp = [[T-0.006*H,i] for i,H in enumerate(HH)]\ntemp.sort()\n\nans = -1\nMIN = INF\nfor i,[t,ind] in enumerate(temp):\n if MIN > abs(t-A):\n ans = ind\n MIN = abs(t-A)\nprint(ans+1)\n"] | ['Wrong Answer', 'Accepted'] | ['s651744537', 's048553376'] | [4328.0, 4580.0] | [30.0, 34.0] | [478, 503] |
p03220 | u342051078 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int, input().split())\nh = list(map(int,input().split()))\nans = 1000000\nfor i in n:\n x = t - h[i]*0.006\n ans = min(ans, abs(x-a))\nprint(ans) ', 'n = int(input())\nans = []\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nfor i in range(n):\n ans.append(abs(t - h[i]*0.006 - a))\nprint(min(ans))', 'n = int(input())\nt,a = map(int, input().split())\nh = list(map(int,input().split()))\nans = 1000000\nfor i in range(n):\n x = t - h[i]*0.006\n ans = min(ans, abs(x-a))\nprint(ans) ', 'n = int(input())\nans = []\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nans = 100000\nfor i in range(n):\n if abs(t - h[i]*0.006 - a) < ans:\n num = i+1\n ans = abs(t - h[i]*0.006 - a)\nprint(num)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s174129762', 's356600815', 's846708059', 's475416943'] | [3060.0, 3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0, 18.0] | [174, 166, 181, 228] |
p03220 | u345483150 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt, a=map(int, input().split())\nh=list(int(i) for i input().split())\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n\n\n', 'n=int(input())\nt, a=map(int, input().split())\nh=[int(i) for i input.split()]\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n\n', 'n=int(input())\nt, a=map(int, input().split())\nh=list(int(i) for i input().split())\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n\n', 'n=int(input())\nt, a=map(int, input().split())\nh=list(int(i) for i input.split())\ntemp=[abs(a-(t-(k*0.006))) for k in h]\nprint(temp.index(min(temp))+1)\n\n', 'n=int(input())\nt, a=map(int, input().split())\nh=[int(i) for i input().split()]\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n', 'n=int(input())\nt, a=map(int, input().split())\nh=list(int(i) for i input().split())\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n\n', 'n=int(input())\nt, a=map(int, input().split())\nh=[int(i) for i input.split()]\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n\nn = int(input())\nt, a = map(int, input().split())\nh = [int(i) for i in input().split()]\ndifference = [abs(a - (t - i * 0.006)) for i in h]\nprint(difference.index(min(difference)) + 1)', 'n=int(input())\nt, a=map(int, input().split())\nh=list(int(i) for i in input().split())\ntemp=[abs(a-(t-k*0.006)) for k in h]\nprint(temp.index(min(temp))+1)\n\n\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s047896233', 's113515660', 's242383089', 's530352419', 's767893888', 's800017241', 's825915877', 's201054962'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 18.0] | [153, 146, 152, 152, 147, 152, 329, 156] |
p03220 | u348945811 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = list(map(int, input().split()))\nh = list(map(int, input().split()))\n\nkion = list(map(int, list(map(lambda x: t-x*0.006, h))))\nsub = list(map(int, list(map(lambda x: abs(a-x), kion))))\n\nprint(kion)\n\ntemp = sub.copy()\ntemp.sort()\nindex = sub.index(temp[0])\n\nprint(index+1)', 'n = int(input())\nt, a = list(map(int, input().split()))\nh = list(map(int, input().split()))\n\nkion = list(map(float, list(map(lambda x: t-x*0.006, h))))\nsub = list(map(float, list(map(lambda x: abs(a-x), kion))))\n\ntemp = sub.copy()\ntemp.sort()\nindex = sub.index(temp[0])\n\nprint(index+1)'] | ['Wrong Answer', 'Accepted'] | ['s669319190', 's910218483'] | [3064.0, 3064.0] | [19.0, 18.0] | [294, 285] |
p03220 | u350093546 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nx=list(map(int,input().split()))\nans=0\ncnt=10**3\nfor i in range(x):\n s=t-x[i]*0.006\n if abs(s-a)<cnt:\n cnt=abs(s-a)\n ans=i+1\nprint(ans)', 'n=int(input())\nt,a=map(int,input().split())\nx=list(map(int,input().split()))\nans=0\ncnt=10**3\nfor i in range(len(x)):\n s=t-x[i]*0.006\n if abs(s-a)<cnt:\n cnt=abs(s-a)\n ans=i+1\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s504472906', 's128989270'] | [9256.0, 9120.0] | [28.0, 25.0] | [187, 193] |
p03220 | u352429976 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nh = [i for i in map(int, input().split())]\npalace = None\nfor x in range(n):\n cand = t * h[x] * 0.006\n if not palace or abs(t - cand) < abs(a - (t * h[palace] * 0.006)):\n palace = x + 1\nprint(palace)', 'n = int(input())\nt, a = map(int, input().split())\nh = [i for i in map(int, input().split())]\npalace = 1\nfor x in range(n):\n diff_cand = abs(a - (t - (h[x] * 0.006)))\n diff_curr = abs(a - (t - (h[palace - 1] * 0.006)))\n if diff_cand < diff_curr:\n palace = x + 1\nprint(palace)'] | ['Wrong Answer', 'Accepted'] | ['s903626971', 's882423642'] | [3060.0, 3060.0] | [18.0, 18.0] | [261, 290] |
p03220 | u352676541 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\ndiff = []\nfor i in H:\n\tdiff.append(abs(A-T+i*0.006))\n\ndiffmin = diff[0]\nfor i in diff:\n\tif diffmin > i:\n\t\tdiffmin = i\nprint(diffmin)', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\ndiff = []\nfor i in H:\n\tdiff.append(abs(A-T+i*0.006))\n\ndiffmin = diff[0]\nans = 0\nfor i in range(N):\n\tif diffmin > diff[i]:\n\t\tdiffmin = diff[i]\n\t\tans = i\nprint(ans)', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\ndiff = []\nfor i in H:\n\tdiff.append(abs(A-T+i*0.006))\n\ndiffmin = diff[0]\nans = 0\nfor i in range(N):\n\tif diffmin > diff[i]:\n\t\tdiffmin = diff[i]\n\t\t\tans = i\nprint(ans)', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\ndiff = []\nfor i in H:\n\tdiff.append(abs(A-T+i*0.006))\n\ndiffmin = diff[0]\nans = 0\nfor i in range(N):\n\tif diffmin > diff[i]:\n\t\tdiffmin = diff[i]\n\t\tans = i\nprint(ans+1)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s540602380', 's717210972', 's779683194', 's608518374'] | [9208.0, 9212.0, 8988.0, 9132.0] | [31.0, 29.0, 26.0, 27.0] | [216, 246, 247, 248] |
p03220 | u353548710 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['def calc(T, x):\n return T - x * 0.0006\n\nN = int(input())\nT, A = map(int, input().split())\nL = list(map(int, input().split()))\nl = []\nfor i in L:\n l.append(abs(A - calc(T, i)))\n\nmi = min(l)\nprint(l.index(mi)+1)', 'def calc(T, x):\n return T - x * 0.006\n\nN = int(input())\nT, A = map(int, input().split())\nL = list(map(int, input().split()))\nl = []\nfor i in L:\n l.append(abs(A - calc(T, i)))\n\nmi = min(l)\nprint(l.index(mi)+1)'] | ['Wrong Answer', 'Accepted'] | ['s064543136', 's448276961'] | [9264.0, 9236.0] | [28.0, 31.0] | [211, 210] |
p03220 | u354411673 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nnums = list(map(int, input().split()))\n\ndiff = [0]*len(nums)\n\nfor i in len(nums):\n diff[i] = abs(A - (T - nums[i] * 0.006))\n\nprint(diff.index(min(diff[i])) + 1)', 'n = int(input())\nt, a = map(int, input().split())\nnums = list(map(int, input().split()))\n\ndiff = [0] * n\n\nfor i in range(0, n):\n diff[i] = abs(a - (t - nums[i] * 0.006))\n\nprint(diff.index(min(diff)) + 1)'] | ['Runtime Error', 'Accepted'] | ['s474702754', 's594583014'] | [3060.0, 3060.0] | [17.0, 18.0] | [213, 206] |
p03220 | u354847446 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\ndiff = [0]*n\n\nfor i in range(n):\n diff[i] = abs(a - t + h[i]*0.006)\n print(diff[i])\n \nprint(diff.index(min(diff))+1)', 'n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\ndiff = [0]*n\n\nfor i in range(n):\n diff[i] = abs(a - t + h[i]*0.006)\n \nprint(diff.index(min(diff))+1)'] | ['Wrong Answer', 'Accepted'] | ['s080089435', 's722054087'] | [3188.0, 3060.0] | [19.0, 18.0] | [206, 189] |
p03220 | u357218223 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['# coding: utf-8\nN = int(input())\nT,A = map(int,input().split())\nH = list(map(lambda x : abs(T - int(x)*0.006) , input().split()))\nprint(H.index(min(H)) + 1)', '# coding: utf-8\nN = int(input())\nT,A = map(int,input().split())\nH = list(map(lambda x : abs(A - (T - int(x)*0.006)) , input().split()))\nprint(H.index(min(H)) + 1)'] | ['Wrong Answer', 'Accepted'] | ['s132533830', 's130847459'] | [3060.0, 3060.0] | [18.0, 19.0] | [157, 163] |
p03220 | u357751375 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['\nn = int(input())\n#t - h[i] * 0.006\n\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\n\no = []\n\nfor i in range(n):\n o.append(t - h[i] * 0.006)\n\n\np = abs(a - h[0])\n\nq = 0\nfor i in range(n)[1:]:\n if abs(a - o[i]) < p:\n p = abs(a - o[i])\n q = i\n\nprint(q + 1)', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\np = 10 ** 8\nans = 0\nfor i in range(n):\n x = t - h[i] * 0.006\n x = abs(a - x)\n if p > x:\n p = x\n ans = i + 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s628161274', 's151790331'] | [9268.0, 9252.0] | [30.0, 26.0] | [418, 224] |
p03220 | u362560965 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int, input().split())\nH = [int(i) for i in input().split]\n\ndif = float("inf")\n\nfor i in range(N):\n temp = T - H[i] * 0.006\n dif2 = abs(A-temp)\n if dif2 < dif:\n dif = dif2\n ans = i\n\nprint(ans)', 'N = int(input())\nT,A = map(int, input().split())\nH = [int(i) for i in input().split()]\n\ndif = float("inf")\n\nfor i in range(N):\n temp = T - H[i] * 0.006\n dif2 = abs(A-temp)\n if dif2 < dif:\n dif = dif2\n ans = i\n\nprint(ans+1)'] | ['Runtime Error', 'Accepted'] | ['s487609919', 's121759608'] | [3060.0, 3060.0] | [17.0, 19.0] | [241, 245] |
p03220 | u363074342 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int,input()\nt, a = map(int,input().split())\nlist_oA = [51]\nlist_lA = [10*5-6/1000]\no_kome = []\nl_kome = []\nH = list(map(int,input().split()))\nkome = 0\nfor i in H:\n T = t -i*6/1000\n kome += 1\n if T == a:\n print(kome)\n elif T > a:\n list_oA.append(T)\n o_kome.append(kome)\n else:\n list_lA.append(T)\n l_kome.append(kome)\nsa_o = min(list_oA)- a\nsa_l = a - max(list_lA)\nif sa_o > sa_l:\n print(max(l_kome))\nelse:\n print(min(o_kome))\n', 'n = int,input()\nt, a = map(int,input().split())\ndic_oA = {}\ndic_lA = {}\nH = list(map(int,input().split()))\nkome = 0\n\nfor i in H:\n T = t -i*6/1000\n kome += 1 \n if T >= a:\n dic_oA[kome] = T\n else:\n dic_lA[kome] = T\n\nif len(dic_oA) == 0:\n print(max(dic_lA,key=dic_lA.get))\nelif len(dic_lA) == 0:\n print(min(dic_oA,key=dic_oA.get))\nelse:\n sa_o = min(dic_oA.values())- a\n sa_l = a - max(dic_lA.values())\n if sa_o > sa_l:\n print(max(dic_lA,key=dic_lA.get))\n else:\n print(min(dic_oA,key=dic_oA.get))\n\n\n\n'] | ['Wrong Answer', 'Accepted'] | ['s696331224', 's482838447'] | [3064.0, 3188.0] | [18.0, 19.0] | [485, 561] |
p03220 | u363407238 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ["n=int(input())\nt,a=map(int,input().split())\nh = list(map(int, input().split()))\n\nbest_point=0\nbest=float('inf')\ni=0\nfor hi in h:\n tmp = t - (hi * 0.006)\n dif = abs(a - tmp)\n if abs(dif) < abs(best):\n best = dif\n best_point = i + 1\n print(best_point)\n i += 1\nprint(best_point)", "n=int(input())\nt,a=map(int,input().split())\nhl=list(map(int,input().split()))\n\nbest=float('inf')\nbp=1\nfor i in range(n):\n avr = t-(hl[i]*0.006)\n dif = abs(avr-a)\n if dif < best:\n best = dif\n bp = i+1\nprint(bp)"] | ['Wrong Answer', 'Accepted'] | ['s718714910', 's484939578'] | [3064.0, 3064.0] | [18.0, 19.0] | [308, 232] |
p03220 | u370429695 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int,input().split())\nli = list(map(int,input().split()))\nnearest = 0\nfor i in li:\n if abs(nearest - a) > abs((t - i * 0.006) - a):\n nearest = i\nprint(l.index(nearest) + 1)', 'n = int(input())\nt,a = map(int,input().split())\nli = list(map(int,input().split()))\nnearest = 0\nfor i in li:\n if abs(nearest - a) < abs((t - i * 0.006) - a):\n nearest = i\nprint(li.index(nearest) + 1)', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\ndif = 1000\nfor i in range(N):\n Tx = T - H[i] * 0.006\n if abs(Tx - A) < dif:\n dif = abs(Tx - A)\n ans = i + 1\nprint(ans)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s341914083', 's843322637', 's500482117'] | [3060.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0] | [208, 209, 226] |
p03220 | u370721525 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nans = 10**10\nfor i in range(N):\n tmp = T - 0.006*H[i]\n ans = min(ans, abs(A-tmp))\nprint(ans)', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nindex = 0\nans = 10**10\nfor i in range(N):\n tmp = T - 0.006*H[i]\n if ans > abs(A-tmp):\n ans = abs(A-tmp)\n index = i+1\nprint(index)\n'] | ['Wrong Answer', 'Accepted'] | ['s150361224', 's504509287'] | [9256.0, 9192.0] | [28.0, 29.0] | [181, 225] |
p03220 | u371132735 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['# abc113_b.py\nN = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\nlowest = 10**9\nans = 0\nfor i in range(N):\n tmperture = abs(A-(T-H[i]*0.006))\n print(tmperture)\n if abs(tmperture) < lowest:\n ans = i + 1\n lowest = tmperture\nprint(ans)', '# abc113_b.py\nN = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\nlowest = 10**9\nans = 0\nfor i in range(N):\n tmperture = abs(A-(T-H[i]*0.006))\n if abs(tmperture) < lowest:\n ans = i + 1\n lowest = tmperture\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s100802727', 's542272991'] | [3188.0, 3064.0] | [20.0, 18.0] | [287, 266] |
p03220 | u374146618 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import numpy as np\n\nn = int(input())\nt, a = map(int, input().split())\nh = np.array(list(map(int, input().split())))\n\nA = list(map(lambda x: abs(t-x*0.006), h))\n[idx] = [i for i, x in enumerate(A) if x == min(A)]\n\nprint(idx+1)', 'import numpy as np\n\nn = int(input())\nt, a = map(int, input().split())\nh = np.array(list(map(int, input().split())))\n\nA = [abs(a-(t-x*0.006)) for x in h]\n[idx] = [i for i, x in enumerate(A) if x == min(A)]\n\nprint(idx+1)'] | ['Wrong Answer', 'Accepted'] | ['s288734799', 's412814898'] | [12504.0, 12388.0] | [186.0, 185.0] | [225, 218] |
p03220 | u375616706 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ["n=int(input())\nt ,a=list(map(int, input().split()))\nh = list(map(int,input().split(' ')))\n\nmin=100000000000000\nmin_index=n+1\nfor i in range(len(h)):\n v = abs(t - h[i]*0.006)\n if v < min:\n min=v\n min_index=i\nprint(min_index+1)\n", "n=int(input())\nt ,a=list(map(int, input().split()))\nh = list(map(int,input().split(' ')))\n\nmin=100000000000000\nmin_index=n+1\nfor i in range(len(h)):\n v = abs(t - h[i]*0.006-a)\n if v < min:\n min=v\n min_index=i\nprint(min_index+1)\n"] | ['Wrong Answer', 'Accepted'] | ['s545134330', 's539814976'] | [3188.0, 3060.0] | [18.0, 18.0] | [234, 236] |
p03220 | u375695365 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\n\nh=list(map(int,input().split()))\n\nans=[]\n\nfor i in range(n):\n ans.append(abs(a-(t-h[i]*0.006)))\n\nprint(min(ans))', 'n=int(input())\nt,a=map(int,input().split())\n\nh=list(map(int,input().split()))\n\nans=[]\n\nfor i in range(n):\n ans.append(abs(a-(t-h[i]*0.006)))\n\nprint(ans.index(min(ans))+1)'] | ['Wrong Answer', 'Accepted'] | ['s859761412', 's435799932'] | [3060.0, 3060.0] | [18.0, 18.0] | [160, 173] |
p03220 | u376476006 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['_ = input()\nt, desire = map(int, input().split())\nplaces_h = map(int, input().split())\n\ndef desire_delta(place_h, t, desire):\n avg_tmp = t - place_h * 0.006\n return max(desire - avg_tmp, avg_tmp - desire)\n\nres = [(idx, desire_delta(h, t, desire)) for idx, h in enumerate(place_h)]\n\nsorted_res = sorted(res, key=lambda idx, delta: delta)\n\nprint(sorted_res[0])\n', '_ = input()\nt, desire = map(int, input().split())\nplaces_h = map(int, input().split())\n\ndef desire_delta(place_h, t, desire):\n avg_tmp = t - place_h * 0.006\n return max(desire - avg_tmp, avg_tmp - desire)\n\nres = [(idx, desire_delta(h, t, desire)) for idx, h in enumerate(places_h)]\n\nsorted_res = sorted(res, key=lambda place: place[1])\n\nprint(sorted_res[0][0] + 1)'] | ['Runtime Error', 'Accepted'] | ['s209137610', 's476759364'] | [3060.0, 3188.0] | [18.0, 19.0] | [361, 366] |
p03220 | u379692329 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = [int(x) for x in input().split()]\nH = list(map(int, input().split()))\nmin = 100000\nresult = 0\n\nfor i in range(N):\n if abs(A - (T-H[i]*0.006)) < min:\n min = abs(A - (T-H[i]*0.006))\n result = i\n\nprint(result)', 'N = int(input())\nT, A = [int(x) for x in input().split()]\nH = list(map(int, input().split()))\nmin = 100000\nresult = 0\n\nfor i in range(N):\n if abs(A - (T-H[i]*0.006)) < min:\n min = abs(A - (T-H[i]*0.006))\n result = i+1\n\nprint(result)'] | ['Wrong Answer', 'Accepted'] | ['s938962338', 's369808187'] | [3064.0, 3060.0] | [22.0, 18.0] | [247, 249] |
p03220 | u379959788 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import numpy as np\n\nN = int(input())\nT, A = map(int, input().split())\nheight = list(map(int, input().split()))\n\ntemp = list(map(lambda x: T - x*0.006, height))\nprint(height)\nprint(temp)\n\ndef getNearesValue(list, num):\n idx = np.abs(np.asarray(list) - num).argmin()\n return list[idx]\n\nprint(temp.index(getNearesValue(temp, A)) + 1)\n', '# -*-coding: utf-8 -*-\nN = int(input())\nT, A = map(int, input().split())\n\nH = list(map(int, input().split()))\n\nbest_near = 100000000\nans = 0\nfor i in range(N):\n temp = T - H[i]*0.006\n if best_near > abs(A - temp):\n best_near = abs(A - temp)\n ans = i+1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s020108568', 's011475092'] | [12508.0, 3064.0] | [150.0, 18.0] | [337, 282] |
p03220 | u380051707 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = np.array(input().split(), dtype="int")[:2]\nH = [int(i) for i in input().split()]\n \nmin_dif = 10000\nplace = 0\nfor i in range(N):\n temp = T - H[i] *0.006\n dif = abs(A-temp)\n \n \n if min_dif >= dif:\n min_dif = dif\n place = i+1\n \nprint(place)', 'from unittest.mock import patch\nimport numpy as np\n\ndef palace():\n \n N = int(input())\n T, A = np.array(input().split(), dtype="int")[:2]\n H = [int(i) for i in input().split()]\n \n min_dif = 10000\n place = 0\n for i in range(N):\n temp = T - H[i] *0.006\n dif = abs(A-temp)\n \n \n if min_dif >= dif:\n min_dif = dif\n place = i+1\n \n print(place)', 'import numpy as np\n\ndef palace():\n \n N = int(input())\n T, A = np.array(input().split(), dtype="int")[:2]\n H = [int(i) for i in input().split()]\n \n min_dif = 10000\n place = 0\n for i in range(N):\n temp = T - H[i] *0.006\n dif = abs(A-temp)\n \n \n if min_dif >= dif:\n min_dif = dif\n place = i+1\n \n print(place)\n \n \npalace()'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s047817166', 's145998421', 's079884115'] | [9184.0, 32048.0, 27244.0] | [24.0, 149.0, 120.0] | [326, 465, 452] |
p03220 | u381416158 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = [int(i) for i in input().split()]\nH = [int(i) for i in input().split()]\nh = [abs(A - (T - x * 0.006)) for x in H]\n\nm = h[0]\nans = 1\nfor i in range(len(h)):\n if h[i] < m:\n m = h[i]\n ans = i + 1\n\n\nprint(h)', 'N = int(input())\nT, A = [int(i) for i in input().split()]\nH = [int(i) for i in input().split()]\nh = [abs(A - (T - x * 0.006)) for x in H]\n\nm = h[0]\nans = 1\nfor i in range(len(h)):\n if h[i] < m:\n m = h[i]\n ans = i + 1\n\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s510445813', 's729876448'] | [3060.0, 3064.0] | [19.0, 18.0] | [244, 246] |
p03220 | u382431597 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=list(map(int,input().split()))\nh=list(map(int,input().split()))\nimin=100000\nsuf=0\nfor i in range(n):\n h[i]=t- h[i]＊0.006\n if imin > abs(a- h[i]):\n imin=abs(a- h[i])\n suf=i\nprint(i)\n \n ', 'n=int(input())\nt,a=list(map(int,input().split()))\nh=list(map(int,input().split()))\nimin=100000\nsuf=0\nfor i in range(n):\n h[i]=t- h[i]*0.006\n if a>=h[i]:\n if imin>a-h[i]:\n #print("!!",a-h[i],h[i],i)\n imin=abs(a- h[i])\n suf=i\n else:\n if imin>h[i]-a:\n #print("!!",a-h[i],h[i],i)\n imin=abs( h[i]-a)\n suf=i \nprint(suf+1)'] | ['Runtime Error', 'Accepted'] | ['s088339453', 's925718348'] | [2940.0, 3188.0] | [17.0, 20.0] | [217, 354] |
p03220 | u384261199 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['#B - Palace\nimport numpy as np\nN = int(input())\nT,A = map(int, input().split())\nH = list(map(int, input().split()))\n\ntemp = np.argsort([abs(T-h*0.006) for h in H])[0]\nprint(temp+1)', 'import numpy as np\nN = int(input())\nT,A = map(int, input().split())\nH = list(map(int, input().split()))\n\ntemp = np.argsort([abs(A - (T-h*0.006)) for h in H])[0]\nprint(temp+1)'] | ['Wrong Answer', 'Accepted'] | ['s759677047', 's444306305'] | [21624.0, 21396.0] | [1272.0, 1094.0] | [181, 175] |
p03220 | u384679440 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\ncand = 10**9\nans = 0\nfor i in range(N):\n temp = T - H[i] * 0.006\n if abs(A - temp) < cand:\n cand = abs(A - temp)\n ans = i + 1\n print(cand, i+1)\n \nprint(ans)', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\ncand = 10**9\nans = 0\nfor i in range(N):\n temp = T - H[i] * 0.006\n if abs(A - temp) < cand:\n cand = abs(A - temp)\n ans = i + 1 \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s637434519', 's869913167'] | [3064.0, 3064.0] | [18.0, 18.0] | [256, 234] |
p03220 | u386819480 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = (float(_) for _ in input().split())\nh = [float(_) for _ in input().split()]\n\np = 0\nans = 9999999999\nfor i in range(n):\n at = t - h[i]*0.006\n print(abs(at-a))\n if(abs(at-a) < ans):\n ans = abs(at-a)\n p = i\n\nprint(p)', 'n = int(input())\nt, a = (float(_) for _ in input().split())\nh = [float(_) for _ in input().split()]\n \np = 0\nans = 9999999999\nfor i in range(n):\n at = t - h[i]*0.006\n if(abs(at-a) < ans):\n ans = abs(at-a)\n p = i+1\n \nprint(p)'] | ['Wrong Answer', 'Accepted'] | ['s971815737', 's462321086'] | [3188.0, 3060.0] | [19.0, 19.0] | [260, 243] |
p03220 | u389679466 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nh = list(map(int, input().split()))\n \n \nmin = 10000\nmini = 0\n \nfor i, x in enumerate(h):\n val = T - x*0.006\n gap = abs(A-val)\n if gap < min:\n min = gap\n mini = i\n \nprint(mini)', 'N = int(input())\nT, A = map(int, input().split())\nh = list(map(int, input().split()))\n\n\nmin = 10000\nmini = 0\n\nfor i, x in enumerate(h):\n val = T - x*0.006\n gap = abs(A-val)\n if gap < min:\n min = gap\n mini = i\n\nprint(mini+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s300601193', 's570502260'] | [3064.0, 3060.0] | [18.0, 18.0] | [234, 233] |
p03220 | u393512980 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nans, min = 0, 1e9\nfor i in range(N):\n if abs((T-H[i]*0.006) - A) < m:\n ans = i\n m = abs((T-H[i]*0.006) - A)\nprint(i)', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nans, m = 0, 1e9\nfor i in range(N):\n if abs((T-H[i]*0.006) - A) < m:\n ans = i+1\n m = abs((T-H[i]*0.006) - A)\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s103839613', 's811512584'] | [3060.0, 3060.0] | [20.0, 18.0] | [209, 211] |
p03220 | u393881437 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nL = [abs(A-(T-i*0.006)) for i in H]\nprint(L.index(min(L)+1))\n', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nans = 1\nans_t = abs(A-(T-H[1]*0.006))\nfor i in range(N):\n if abs(A-(T-H[i]*0.006)) < ans_t:\n ans = i+1\n ans_t = abs(A-(T-H[i]*0.006))\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s478160113', 's574603672'] | [3060.0, 3060.0] | [18.0, 19.0] | [148, 249] |
p03220 | u394731058 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nl = list(map(int, input().split()))\nindex = 0\ndegree = 0\nfor i in range(len(l)):\n diff = (t-l[i]*0.006)-a\n if diff < 0 :\n diff = -diff\n if degree > diff:\n degree = diff\n index = i\nprint(i+1)', 'n = int(input())\nt, a = map(int, input().split())\nl = list(map(int, input().split()))\nindex = 0\ndegree = 0\nfor i in range(len(l)):\n diff = (t-l[i]*0.006)-a\n if degree > diff:\n degree = diff\n index = i\nprint(i+1)', "import sys\n\ninput = sys.stdin.readline\n\ndef main():\n l = []\n N = int(input())\n T, A = map(int, input().split())\n h = list(map(int, input().split()))\n for i in range(N):\n l.append(abs(A-(T-h[i]*0.006)))\n print(l.index(min(l))+1)\n\nif __name__ == '__main__':\n main()"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s167741691', 's554287727', 's392331707'] | [3064.0, 3060.0, 3060.0] | [18.0, 18.0, 18.0] | [252, 219, 290] |
p03220 | u394853232 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nt *= 1000\na *= 1000\nlst = list(map(int, input().split()))\ntmp = abs(t - 6 * lst[0] - a)\ntmpa = 0\nfor i in range(1, n):\n if temp < tmp:\n tmp = tmp\n tmpa = i\nprint(tmpa + 1)', 'n = int(input())\nt, a = map(int, input().split())\nt *= 1000\na *= 1000\nlst = list(map(int, input().split()))\ntmp = abs(t - 6 * lst[0] - a)\ntmpa = 0\nfor i in range(1, n):\n temp = abs(t - 6 * lst[i] - a)\n if temp < tmp:\n tmp = temp\n tmpa = i\nprint(tmpa + 1)'] | ['Runtime Error', 'Accepted'] | ['s603829791', 's275762964'] | [3064.0, 3064.0] | [17.0, 18.0] | [238, 274] |
p03220 | u397953026 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nans = 100000\ncount = 0\nfor i in range(n):\n ch = abs(a - (t - h[i]*6/1000))\n print(ch)\n if abs(ans-a) > ch:\n ans = ch\n count = i+1\nprint(count)', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nch = [10000]*n\nfor i in range(n):\n ch[i] = abs(a - (t - h[i]*6/1000))\nprint(ch.index(min(ch))+1)'] | ['Wrong Answer', 'Accepted'] | ['s220703488', 's086086574'] | [3188.0, 3060.0] | [20.0, 18.0] | [248, 182] |
p03220 | u399721252 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | [' n = int(input())\n t, a = [ int(v) for v in input().split() ]\n height_list = [ abs(t-a-int(V)*0.006) for v in input().split() ]\n print(height_list.index(min(height_list))+1)', 'n = int(input())\nt, a = [ int(v) for v in input().split() ]\nheight_list = [ int(v) for v in input().split() ]\nheight_list = [ abs(t-a-i*0.006) for i in height_list ]\nprint(height_list.index(min(height_list))-1)', 'n = int(input())\nt, a = [ int(v) for v in input().split() ]\nheight_list = [ abs(t-a-int(V)*0.006) forfor v in input().split() ]\nprint(height_list.index(min(height_list))+1)\n', 'n = int(input())\nt, a = [ int(v) for v in input().split() ]\nheight_list = [ abs(t-a-int(v)*0.006) for v in input().split() ]\nprint(height_list.index(min(height_list))+1)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s752666167', 's864192542', 's936796280', 's098277525'] | [2940.0, 3060.0, 2940.0, 3060.0] | [17.0, 18.0, 17.0, 20.0] | [185, 210, 173, 169] |
p03220 | u401487574 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['def tempDif(h,T,A):\n temp = T - 0.006*h\n dif = A -temp\n if dif < 0:\n dif = -dif\n return dif\n\nN = int(input())\nT,A = map(int,input().split())\nlis = [int(n) for n in input().split()]\n\nlisnew = [tempDif(H,T,A) for H in lis]\nprint(i for i,x in lisnew if x == min(lisnew))', 'def tempDif(h,T,A):\n temp = T - 0.006*h\n dif = A -temp\n if dif < 0:\n dif = -dif\n return dif\n\nN = int(input())\nT,A = map(int,input().split())\nlis = [int(n) for n in input().split()]\n\nlisnew = [tempDif(H,T,A) for H in lis]\nprint(i for i,x in enumerate(lisnew) if x == min(lisnew))', 'def tempDif(h,T,A):\n temp = T - 0.006*h\n dif = A -temp\n if dif < 0:\n dif = -dif\n return dif\n \nN = int(input())\nT,A = map(int,input().split())\nlis = [int(n) for n in input().split()]\n \nlisnew = [tempDif(H,T,A) for H in lis]\nprint(listnew.index(max(listnew)))', 'def tempDif(h,T,A):\n temp = T - 0.006*h\n dif = A -temp\n if dif < 0:\n dif = -dif\n return dif\n\nN = int(input())\nT,A = map(int,input().split())\nlis = [int(n) for n in input().split()]\n\nlisnew = [tempDif(H,T,A) for H in lis]\ns = [i for i,x in enumerate(lisnew) if x == min(lisnew)]\nprint(s[0])', 'def tempDif(h,T,A):\n temp = T - 0.006*h\n dif = A -temp\n if dif < 0:\n dif = -dif\n return dif\n \nN = int(input())\nT,A = map(int,input().split())\nlis = [int(n) for n in input().split()]\n \nlisnew = [tempDif(H,T,A) for H in lis]\nprint(lisnew.index(min(lisnew))+1)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s029758495', 's482965814', 's920975516', 's928848613', 's393351935'] | [3064.0, 3060.0, 3060.0, 3064.0, 3064.0] | [18.0, 19.0, 18.0, 41.0, 18.0] | [274, 285, 264, 296, 264] |
p03220 | u404629709 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\n\nh=[int(input()) for i in range(n)]\n\nmin=1000\nfor i in range(n):\n temp=abs(t-0.006*h[i]-a)\n if min>temp:\n min=temp\n id=i\nprint(id+1)', 'n=int(input())\nt,a=map(int,input().split())\n\nh=list(map(int,input().split()))\n\nmin=1000\nfor i in range(n):\n temp=abs(t-0.006*h[i]-a)\n print(temp)\n if min>temp:\n min=temp\n id=i\nprint(id+1)', 'n=int(input())\nt,a=map(int,input().split())\n\nh=[int(input()) for i in range(n)]\n\nmin=1000\nfor i in range(n):\n temp=abs(t-0.006*h[i]-a)\n print(temp)\n if min>temp:\n min=temp\n id=i\nprint(i+1)', 'n=int(input())\nt,a=map(int,input().split())\n\nh=list(map(int,input().split()))\n\nmin=1000\nfor i in range(n):\n temp=abs(a-t+0.006*h[i])\n if min>temp:\n min=temp\n id=i\nprint(id+1)'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s227653645', 's614401987', 's702228736', 's570696375'] | [3060.0, 3188.0, 3060.0, 3060.0] | [17.0, 19.0, 17.0, 18.0] | [184, 196, 197, 182] |
p03220 | u405256066 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['for sys import stdin\nN=int(stdin.readline().rstrip())\nT,A=[int(x) for x in stdin.readline().rstrip().split()]\nelev=[int(x) for x in stdin.readline().rstrip().split()]\ncnt=0\ncomp=10000\nfor i in elev:\n cnt+=1\n temperature=T-(i*0.006)\n tmp=abs(A-temperature)\n if comp > tmp:\n comp=tmp\n ans=cnt\nprint(ans)', 'for sys import stdin\nN=int(stdin.readline().rstrip())\nT,A=[int(x) for x in stdin.readline().rstrip().split()]\nelev=[int(x) for x in stdin.readline().rstrip().split()]\ncnt=0\ncomp=10000\nfor i in elev:\n cnt+=1\n tmperature=T-(i*0.006)\n tmp=abs(A-temperature)\n if comp > tmp:\n comp=tmp\n ans=cnt\npritn(ans)', 'from sys import stdin\nN=int(stdin.readline().rstrip())\nT,A=[int(x) for x in stdin.readline().rstrip().split()]\nelev=[int(x) for x in stdin.readline().rstrip().split()]\ncnt=0\ncomp=10000\nfor i in elev:\n cnt+=1\n temperature=T-(i*0.006)\n tmp=abs(A-temperature)\n if comp > tmp:\n comp=tmp\n ans=cnt\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s542562743', 's796470263', 's870596985'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 18.0] | [327, 326, 328] |
p03220 | u408375121 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nans = 0\nm = abs(A - T + H[0] * 0.006)\nfor i in range(N):\n d = T - H[i] * 0.006\n a = abs(A - d)\n if m >= a:\n m = a\n ans = i\nprint(ans)\n', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nans = 0\nm = abs(A - T + h[0] * 0.006)\nfor i in range(N):\n d = T - h[i] * 0.006\n a = abs(A - d)\n if m >= a:\n m = a\n ans = i\nprint(ans)', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\nans = 0\nm = abs(A - T + H[0] * 0.006)\nfor i in range(N):\n d = T - H[i] * 0.006\n a = abs(A - d)\n if m >= a:\n m = a\n ans = i + 1\nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s365731321', 's811522735', 's149295936'] | [3060.0, 3064.0, 3060.0] | [20.0, 18.0, 18.0] | [229, 228, 233] |
p03220 | u410118019 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\nm=a\nans=0\nfor i in h:\n if abs((t-i*0.006)-a) < m:\n m=abs((t-i*0.006)-a)\n ans=i+1\nprint(ans)', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\nm=a\nans=0\nfor i in n:\n if abs((t-h[i]*0.006)-a) < m:\n m=abs((t-h[i]*0.006)-a)\n ans=i+1\nprint(ans)', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\nm=100000\nans=0\nfor i in range(n):\n if abs((t-h[i]*0.006)-a) < m:\n m=abs((t-h[i]*0.006)-a)\n ans=i+1\nprint(ans)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s728548698', 's773241069', 's740859601'] | [3060.0, 3064.0, 3060.0] | [18.0, 18.0, 20.0] | [175, 181, 194] |
p03220 | u411858517 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\ntmp = 10 ** 10\nfor i in range(N):\n if tmp > abs(T - H[i]*0.006):\n tmp = abs(T - H[i]*0.006)\n res = i\nprint(res+1)\n ', 'N = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\ntmp = 10 ** 10\nfor i in range(N):\n if tmp > abs(A - T + H[i]*0.006):\n tmp = abs(A - T + H[i]*0.006)\n res = i\nprint(res+1)\n '] | ['Wrong Answer', 'Accepted'] | ['s066518872', 's553728084'] | [3060.0, 3060.0] | [18.0, 18.0] | [221, 229] |
p03220 | u416758623 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int, input().split())\nH = list(map(int, input().split()))\n\ndiff = 1000\nindex = 0\n\nfor i in range(N):\n tmp = abs(T - H[i]*0.006)\n if diff > tmp:\n diff = tmp\n index = i + 1\n \nprint(index)', "n = int(input())\nt,a = map(int, input().split())\nls = list(map(int, input().split()))\nres = float('inf')\n\nfor i in range(n):\n tmp = t - ls[i] * 0.006\n if res > abs(a-tmp):\n res = abs(a-tmp)\n ans = i + 1\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s527210970', 's791097563'] | [3060.0, 3060.0] | [18.0, 19.0] | [223, 233] |
p03220 | u419963262 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,input().split()))\nminn=10**10\nfor i in range(n):\n if minn>t*(1000)-6*H[i]:\n ans = H[i]\n minn=t*(1000)-6*H[i]\nprint(ans)\n ', 'n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,input().split()))\nminn=10**10\nfor i in range(n):\n if minn>abs((t*(1000)-6*H[i])-a):\n ans = H[i]\n minn=t*(1000)-6*H[i]\nprint(ans)\n \n', 'n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,input().split()))\nminn=10**10\nfor i in range(n):\n if minn>abs((t*(1000)-6*H[i])-a*1000):\n ans = H[i]\n minn=abs((t*(1000)-6*H[i])-a*1000)\nprint(ans)\n \n', 'n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,inpt().split()))\nminn=10**10\nfor i in range(n):\n if minn>t*(1000)-6*H[i]:\n ans = H[i]\n minn=t*(1000)-6*H[i]\nprint(ans)\n ', 'n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,inpt().split()))\nminn=10**10\nfor i in range(n):\n if minn>abs((t*(1000)-6*H[i])-a):\n ans = H[i]\n minn=t*(1000)-6*H[i]\nprint(ans)\n ', 'n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,input().split()))\nminn=10**10\nfor i in range(n):\n if minn>abs((t*(1000)-6*H[i])-a*1000):\n ans = H[i]\n minn=t*(1000)-6*H[i]\nprint(ans)\n \n', 'n=int(input())\nt,a=map(int,input().split())\nH=list(map(int,input().split()))\nminn=10**10\nfor i in range(n):\n if minn>abs((t*(1000)-6*H[i])-a*1000):\n ans = i\n minn=abs((t*(1000)-6*H[i])-a*1000)\nprint(ans+1)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s151524508', 's188745008', 's190190194', 's246660880', 's463104462', 's534175832', 's675110517'] | [9204.0, 9208.0, 9212.0, 9148.0, 9052.0, 9148.0, 9204.0] | [27.0, 27.0, 26.0, 22.0, 25.0, 29.0, 29.0] | [188, 198, 217, 187, 196, 203, 213] |
p03220 | u428132025 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nh = [int(_) for _ in input().split()]\n\nnearest = 100000000\nans = 0\n\nfor idx, i in enumerate(h):\n temp = abs(t - i * 0.006)\n if nearest > temp:\n nearest = temp\n ans = idx + 1\n\nprint(ans)', 'n = int(input())\nt, a = map(int, input().split())\nh = [int(_) for _ in input().split()]\n\nnearest = 100000000\nans = 0\n\nfor idx, i in enumerate(h):\n temp = t - i * 0.006\n temp = abs(a-temp)\n if nearest > temp:\n nearest = temp\n ans = idx + 1\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s660888264', 's704326292'] | [3060.0, 3064.0] | [18.0, 18.0] | [255, 273] |
p03220 | u430483125 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nlisth = list(map(int, input().split()))\ndiff = [abs((t-x*0.006)-a) for x in listh]\nprint(diff.index(min(diff)+1))\n', 'n = int(input())\nt, a = map(int, input().split())\nlisth = list(map(int, input().split()))\ndiff = [abs((t-x*0.006)-a) for x in listh]\nprint(diff.index(min(diff))+1)\n'] | ['Runtime Error', 'Accepted'] | ['s064355601', 's412700709'] | [9212.0, 9244.0] | [25.0, 27.0] | [164, 164] |
p03220 | u432226259 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ["def ave_temp(temp, height):\n\treturn temp - (height * 0.006)\n\nN = int(input())\nT, A = map(int, input().split(' '))\nH = list(map(int, input().split(' ')))\n\nans = []\nA_raw = []\nbuilt = []\nfor i in range(0, N):\n\tans.append(ave_temp(T, H[i]))\n\tA_raw.append(A)\n\tbuilt.append(abs(abs(ans[i]) - abs(A_raw[i])))\n\nprint(built)\n\nfor k in range(0, N):\n\tbuilt_num = 0\n\tif built[built_num] > built[built_num + k]:\n\t\tbuilt_num = k\n\nprint(str(built_num + 1))\n\n", "def ave_temp(temp, height):\n\treturn temp - (height * 0.006)\n\nN = int(input())\nT, A = map(int, input().split(' '))\nH = list(map(int, input().split(' ')))\n\nans = []\nA_raw = []\nbuilt = []\nfor i in range(0, N):\n\tans.append(ave_temp(T, H[i]))\n\tA_raw.append(A)\n\tbuilt.append(abs(ans[i] - A_raw[i]))\n\nfor k in range(0, N - 1):\n\tif built[k] > built[k + 1]:\n\t\tbuilt_num = k + 1\n\telse:\n\t\tbuilt_num = k\n\nprint(str(built_num))\n", "\ndef ave_temp(temp, height):\n\treturn temp - (height * 0.006)\n\nN = int(input())\nT, A = map(int, input().split(' '))\nH = list(map(int, input().split(' ')))\n\nans = []\nA_raw = []\nbuilt = []\nfor i in range(0, N):\n\tans.append(ave_temp(T, H[i]))\n\tA_raw.append(A)\n\tbuilt.append(abs(ans[i] - A_raw[i]))\n#print(ans)\n\n#print(built)\nindex = 0\n\na = min(built)\n\nfor k in range(0, N):\n\tif a == built[k]:\n\t\tbuilt_num = k\n\t\n\nprint(str(built_num + 1))\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s874067311', 's911741627', 's547629757'] | [3188.0, 3064.0, 3064.0] | [27.0, 19.0, 18.0] | [444, 415, 447] |
p03220 | u440129511 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nh=map(int,input().split())\nt1=[]\nfor i in range(n):\n t1.append(abs(a-(t-h[i]*0.006)))\nprint(t1.index(min(t1))+1)', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\nt1=[]\nfor i in range(n):\n t1.append(abs(a-(t-h[i]*0.006)))\nprint(t1.index(min(t1))+1)'] | ['Runtime Error', 'Accepted'] | ['s778656615', 's758252981'] | [3060.0, 3060.0] | [18.0, 18.0] | [159, 165] |
p03220 | u440161695 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N=int(input())\nT,A=map(int,input().split())\nH=list(map(int,input().split()))\nm=100100100100\nfor i in range(N):\n if abs(A-H[i])<m:\n m=abs(A-H[i])\n ans=i\nprint(ans)', 'N=int(input())\nT,A=map(int,input().split())\nH=list(map(int,input().split()))\nz=[abs(A-T+i*0.006) for i in H]\nprint(z.index(min(z))+1)'] | ['Wrong Answer', 'Accepted'] | ['s281369025', 's555740888'] | [3060.0, 3060.0] | [18.0, 18.0] | [169, 133] |
p03220 | u440191278 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import sys\ndef solve(a,b,lst_ab):\n li = [abs(b-(a-(i*0.006))) for i in lst_ab]\n n = li[0]\n for s in li:\n if n > s:\n n = s\n answer = li.index(n)+1 \n return print(answer)\n\ndef readQuestion():\n line1 = sys.stdin.readline().rstrip()\n line2 = sys.stdin.readline().rstrip()\n list1 = line2.split(" ")\n line3 = sys.stdin.readline().rstrip()\n list2 = line3.split(" ")\n return int(list1[0]),int(list1[1]),list2\n \ndef main():\n t,a,h = readQuestion()\n answer = solve(t,a,h)\n print(answer)\n \nif __name__ == \'__main__\':\n main()', 'import sys\n\ndef solve(N, T, A, ls_H):\n li = [abs(A-(T-(i*0.006))) for i in ls_H]\n n = li[0]\n for s in li:\n if n > s:\n n = s\n answer = li.index(n)+1 \n return answer\n\ndef readQuestion():\n ws = sys.stdin.readline().strip().split()\n N = int(ws[0])\n ws = sys.stdin.readline().strip().split()\n T = int(ws[0])\n A = int(ws[1])\n ws = sys.stdin.readline().strip().split()\n ls_H = list(map(int, ws))\n return (N, T, A, ls_H)\n\ndef main():\n print(solve(*readQuestion()))\n\nmain()'] | ['Runtime Error', 'Accepted'] | ['s643082142', 's784981067'] | [3064.0, 3064.0] | [18.0, 18.0] | [579, 524] |
p03220 | u445619807 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ["def main():\n n = int(input())\n t, a = list(map(float, input().split(' ')))\n\n min_diff = 100000000000000000000000000\n min_index = -1\n hs = list(map(float, input().split(' ')))\n for i in range(n):\n h = hs[i]\n cu_diff = abs(a - (t - h * 0.006))\n print(cu_diff)\n if cu_diff < min_diff:\n min_diff = cu_diff\n min_index = i\n\n print(min_index+1)\n\nif __name__ == '__main__':\n main()\n", "def main():\n n = int(input())\n t, a = list(map(float, input().split(' ')))\n\n min_diff = 100000000000000000000000000\n min_index = -1\n hs = list(map(float, input().split(' ')))\n for i in range(n):\n h = hs[i]\n cu_diff = abs(a - (t - h * 0.006))\n if cu_diff < min_diff:\n min_diff = cu_diff\n min_index = i\n\n print(min_index+1)\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s255265531', 's303119489'] | [3316.0, 3060.0] | [20.0, 18.0] | [448, 425] |
p03220 | u448655578 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['candidates = input()\nT, A = map(int, input().split())\nprint(T,A)\nheights = input().split()\nprint(heights)\nans = []\nfor i in range(len(heights)):\n ans.append(A - (T - int(heights[i])*0.006))\nanswer = ans.index(min(ans))\nprint(answer + 1)\n', 'candidates = input()\nT, A = map(int, input().split())\nheights = int(input().split())\nans = []\nfor i in range(len(heights)):\n ans.append(A - (T - heights[i]*0.006))\nanswer = ans.index(min(ans))\nprint(answer + 1)\n', 'candidates = input()\nT, A = map(int, input().split())\nprint(T,A)\nheights = input().split()\nprint(heights)\nans = []\nfor i in range(len(heights)):\n ans.append(A - (T - int(heights[i])*0.006))\nanswer = ans.index(min(ans))\nprint(answer + 1)', 'candidates = input()\nT, A = map(int, input().split())\nheights = input().split()\nans = []\nfor i in range(len(heights)):\n if T - int(heights[i])*0.006 >= A:\n ans.append((T - int(heights[i])*0.006) - A)\n else:\n ans.append(A - (T - int(heights[i])*0.006))\nanswer = ans.index(min(ans))\nprint(answer + 1)'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s471624955', 's787967389', 's984964005', 's301678960'] | [3060.0, 3060.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 18.0] | [238, 212, 237, 318] |
p03220 | u448720391 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nu = []\n\nfor i in range(n):\n u.append(abs(a-(t-0.006*h[i])))\n\nprint(u)\nprint(u.index(min(u))+1)', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nu = []\n\nfor i in range(n):\n u.append(abs(a-(t-0.006*h[i])))\n\nprint(u.index(min(u))+1)'] | ['Wrong Answer', 'Accepted'] | ['s744964203', 's571309633'] | [3188.0, 3060.0] | [21.0, 19.0] | [180, 171] |
p03220 | u457683760 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=[int(i) for i in input().split()]\nH=[int(i) for i in input().split()]\nT=[]\nfor i in H:\n ti=abs(t-i*0.006-a)\n T.append(ti)\nm=min(T)\ni=T.index(m)\nprint(i)\n', 'n=int(input())\nt,a=[int(i) for i in input().split()]\nH=[int(i) for i in input().split()]\nT=[]\nfor i in H:\n ti=abs(t-i*0.006-a)\n T.append(ti)\nm=min(T)\ni=T.index(m)\nprint(i+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s681316809', 's021747873'] | [3060.0, 3060.0] | [18.0, 18.0] | [174, 176] |
p03220 | u460745860 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\na_meter = (12-A*1000)//6\n\nans = -1\ndiff = 10**9\nfor i in range(N):\n d = abs(1000*T-6*H[i]-1000*A)\n if d < diff:\n d = diff\n ans = i + 1\nprint(ans)', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\na_meter = (12-A*1000)//6\n\nans = -1\ndiff = 10**6\nfor i in range(N):\n d = abs(1000*T-6*H[i]-1000*A)\n if d < diff:\n d = diff\n ans = i + 1\nprint(ans)', "N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\n\nans = -1\ndiff = float('inf')\nfor i in range(N):\n d = abs(1000*T-6*H[i]-1000*A)\n\n if d < diff:\n diff = d\n ans = i + 1\nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s122731108', 's546919412', 's083115058'] | [9204.0, 9168.0, 9252.0] | [30.0, 29.0, 28.0] | [249, 249, 232] |
p03220 | u463775490 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int(input().split()))\nh = list(map(int,input().split()))\ndeg = 11451419\nfor i in range(n):\n if deg > abs(a - h[i]*0.006):\n deg = abs(a - h[i]*0.006)\n ans = i+1\nprint(ans)', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\ndeg = 11451419\nfor i in range(n):\n if deg > abs(a - (t - h[i]*0.006)):\n deg = abs(a - (t - h[i]*0.006))\n ans = i+1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s353375147', 's699334249'] | [3060.0, 3188.0] | [17.0, 18.0] | [204, 215] |
p03220 | u467041847 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = list(map(int, input().split()))\nH = list(map(int, input().split()))\n\nans = 0\ntemp = 0\nfor i in range(len(H)):\n\ttemp = T - H[i] * 0.006\n\tif abs(temp - A) <= abs(H[ans] - A):\n\t\tans = i\n\nprint(ans+1)', 'N = int(input())\nT, A = list(map(int, input().split()))\nH = list(map(int, input().split()))\n\nans = 0\nanstemp = 2**20\ntemp = 0\nfor i in range(len(H)):\n\ttemp = T - H[i] * 0.006\n\tif abs(temp - A) <= abs(anstemp - A):\n\t\tans = i\n\t\tanstemp = temp\n\nprint(ans+1)'] | ['Wrong Answer', 'Accepted'] | ['s779409490', 's723789359'] | [3060.0, 3064.0] | [43.0, 18.0] | [220, 254] |
p03220 | u468206018 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\nfor i in range(n):\n temp = 12 - h[i]*0.006\n k = abs(a-temp)\n if i == 0:\n ans = i+1\n else:\n if k>temp:\n ans = i+1\nprint(ans)\n ', 'n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\nfor i in range(n):\n temp = t - h[i]*0.006\n k = abs(a-temp)\n if i == 0:\n ans = i+1\n keep = k\n else:\n if keep>k:\n ans = i+1\n keep = k\nprint(ans)\n '] | ['Wrong Answer', 'Accepted'] | ['s417301693', 's548260400'] | [3060.0, 3060.0] | [18.0, 18.0] | [231, 258] |
p03220 | u468972478 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nb = [abs(a - (t - i * 0.006)) for i in list(map(int, input().split()))]\nprint(min(b))\n', 'n = int(input())\nt, a = map(int, input().split())\nb = [abs(a - (t - i * 0.006)) for i in list(map(int, input().split()))]\nprint(b.index(min(b) + 1))\n', 'n = int(input())\nt, a = map(int, input().split())\nb = [abs(a - (t - i * 0.006)) for i in list(map(int, input().split()))]\nprint(b.index(min(b)) + 1)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s358779280', 's852227382', 's114922551'] | [9064.0, 9212.0, 9248.0] | [30.0, 25.0, 29.0] | [136, 149, 149] |
p03220 | u469700628 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import math\nN = int(input())\nT, A = list(map(int, input().split()))\nHn = list(map(int, input().split()))\n\nmtemp = math.fabs(A - (T - Hn[0] * 0.006))\nmidx = 0\nfor idx, v in enumerate(Hn):\n print(idx)\n print(v)\n tmp = math.fabs(A - (T - v * 0.006))\n if tmp < mtemp:\n mtemp = tmp\n midx = idx\n\nprint(midx + 1)', 'import math\nN = int(input())\nT, A = list(map(int, input().split()))\nHn = list(map(int, input().split()))\n\nmtemp = math.fabs(A - (T - Hn[0] * 0.006))\nmidx = 0\nfor idx, v in enumerate(Hn):\n tmp = math.fabs(A - (T - v * 0.006))\n if tmp < mtemp:\n mtemp = tmp\n midx = idx\n\nprint(midx + 1)'] | ['Wrong Answer', 'Accepted'] | ['s064067959', 's253569014'] | [3444.0, 3188.0] | [20.0, 20.0] | [331, 303] |
p03220 | u470359972 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=input()\nt,a=map(int,input().split())\nh=list(map(int,input()))\nh2=[abs(t-x*0.006) for x in h]\nprint(h2.index(min(h2))+1)\n \n ', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input()))\nh2=[abs(t-x*0.006-a) for x in h]\nprint(h2.index(min(h2))+1)\n \n ', 'n=input()\nt,a=map(int,input().split())\nh=list(map(int,input()))\nh2=[t-x*0.006 for x in h]\nprint(h2.index(min(h2))+1)\n \n ', 'n=input()\nt,a=map(int,input().split())\nh=list(map(int,input()))\nh2=[abs(t-x*0.006-a) for x in h]\nprint(h2.index(min(h2))+1)\n \n ', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\nh2=[abs(t-x*0.006-a) for x in h]\nprint(h2.index(min(h2))+1)\n \n '] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s072917561', 's182612106', 's557977188', 's724463004', 's148587254'] | [3064.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 19.0, 18.0] | [131, 138, 126, 133, 146] |
p03220 | u472883337 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nl = list(map(int, input().split()))\ndeltatemperature = []\n\nfor height in l:\n deltatemperature.append(abs(T- height* 0.006- A))\n \nm = min(deltatemperature)\nmindex = l.index(m)\nprint(mindex+ 1)', 'N = int(input())\nT, A = map(int, input().split())\nl = list(map(int, input().split()))\ndeltatemperature = []\n\nfor height in l:\n deltatemperature.append(abs(T- height* 0.006- A))\n \nm = min(deltatemperature)\nmindex = deltatemperature.index(m)\nprint(mindex+ 1)'] | ['Runtime Error', 'Accepted'] | ['s296091412', 's874963648'] | [3060.0, 3060.0] | [18.0, 18.0] | [243, 258] |
p03220 | u476048753 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT, A = map(int, input().split())\nhight_list = list(map(int, input().split()))\n\nans = 10000\nans_ind\n\nfor i in range(N):\n temp = T - 0.006 * hight_list[i]\n diff = abs(temp - A)\n if diff < ans:\n ans = diff\n ans_ind = i\n \nprint(i+1)\n \n ', 'N = int(input())\nT, A = map(int, input().split())\nhight_list = list(map(int, input().split()))\n \nans = 10000\nans_ind = 0\n \nfor i in range(N):\n temp = T - 0.006 * hight_list[i]\n diff = abs(temp - A)\n if diff < ans:\n ans = diff\n ans_ind = i\n \nprint(ans_ind+1)\n '] | ['Runtime Error', 'Accepted'] | ['s277461527', 's107561587'] | [3060.0, 3316.0] | [19.0, 19.0] | [267, 276] |
p03220 | u478870821 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N=int(input())\nT, A = list(map(int, input().split()))\nH = list(map(int, input().split()))\ntemp = [abs(1000*T - x - A) for x in H]\nm = min(temp)\ni = temp.index(m)\nprint(i+1)', 'ソースコード\nN=int(input())\nT, A = list(map(int, input().split()))\nH = list(map(int, input().split()))\ntemp = [abs(1000*T - 6*x - 1000*A) for x in H]\nm = min(temp)\ni = temp.index(m)\nprint(i+1)', 'N=int(input())\nT, A = list(map(int, input().split()))\nH = list(map(int, input().split()))\ntemp = [abs(1000*T - 6*x - 1000*A) for x in H]\nm = min(temp)\ni = temp.index(m)\nprint(i+1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s270953701', 's657469327', 's865714466'] | [3060.0, 3064.0, 3060.0] | [18.0, 17.0, 19.0] | [172, 198, 179] |
p03220 | u480200603 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\nm = float("INF")\nnum = 0\nfor i in range(n):\n if abs(t - h[i] * 0.006) < m:\n num = i\n m = abs(t - h[i] * 0.006)\n\nprint(num + 1)', 'n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\nm = float("INF")\nnum = 0\nfor i in range(n):\n if abs(t - h[i] * 0.006 - a) < m:\n num = i\n m = abs(t - h[i] * 0.006 - a)\n\nprint(num + 1)'] | ['Wrong Answer', 'Accepted'] | ['s789717611', 's209799637'] | [3060.0, 3064.0] | [18.0, 18.0] | [229, 237] |
p03220 | u485716382 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['from math import fabs\n\ndef main():\n n = int(input())\n T, A = list(map(int, input().split()))\n H = list(map(int, input().split()))\n \n place = 0\n m = 1000000000\n for i, h in enumerate(H):\n t_h = T - h * 0.006\n dif = fabs(A - t_h)\n print(dif)\n if dif < m:\n m = min(m, dif)\n place = i+1\n print(place)\nmain()', 'from math import fabs\n\ndef main():\n n = int(input())\n T, A = list(map(int, input().split()))\n H = list(map(int, input().split()))\n \n place = 0\n m = 1000000000\n for i, h in enumerate(H):\n t_h = T - h * 0.006\n dif = fabs(A - t_h)\n print(dif)\n if dif < m:\n m = min(m, dif)\n place = i+1\n\nmain()', 'from math import fabs\n\ndef main():\n n = int(input())\n T, A = list(map(int, input().split()))\n H = list(map(int, input().split()))\n \n place = 0\n m = 1000000000\n for i, h in enumerate(H):\n t_h = T - h * 0.006\n dif = fabs(A - t_h)\n if dif < m:\n m = min(m, dif)\n place = i+1\n print(place)\nmain()'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s361083314', 's834566680', 's783698131'] | [3188.0, 3188.0, 3060.0] | [21.0, 20.0, 19.0] | [333, 319, 318] |
p03220 | u496744988 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\n# print(n,t,a)\n# print(h)\ntemperture = [ t - h[i] * 0.006 for i in range(n)]\nprint(temperture)\ntmp = abs(a - temperture[0])\nans = 0\nfor i in range(n):\n if tmp > abs(a - temperture[i]):\n tmp = abs(a -temperture[i])\n ans = i\n\nprint(ans+1)\n', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\n# print(n,t,a)\n# print(h)\ntemperture = [ t - h[i] * 0.006 for i in range(n)]\n# print(temperture)\ntmp = abs(a - temperture[0])\nans = 0\nfor i in range(n):\n if tmp > abs(a - temperture[i]):\n tmp = abs(a -temperture[i])\n ans = i\n\nprint(ans+1)\n'] | ['Wrong Answer', 'Accepted'] | ['s691627058', 's414620902'] | [3064.0, 3064.0] | [19.0, 18.0] | [337, 339] |
p03220 | u500297289 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import sys\ninput = sys.stdin.readline\n\nN = int(input())\nT, A = map(int, input().split())\nH = input().split()\n\ntmp = 111\n\nfor i in range(N):\n tmp = min(tmp, abs(A - (T - int(H[i])*0.006)))\n ans = i+1\n \nprint(ans)', 'import sys\ninput = sys.stdin.readline\n\nN = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\nans = 1\nmin_tmp = 1000\n\nfor i in range(N):\n tmp = abs(A - (T - H[i]*0.006))\n if min_tmp > tmp:\n ans = i+1\n min_tmp = tmp\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s012578458', 's926226441'] | [3060.0, 3060.0] | [18.0, 18.0] | [214, 267] |
p03220 | u501750652 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import numpy as np\nN = int(input())\nT,A = input().split()\n\nAve = [0]*N\ngosa = [0]*N\n\nH = input().split()\nprint(H[0])\nfor i in range(N):\n H[i] = int(H[i])\n gosa[i] = abs(float(A) - float(T) + 0.006*H[i])\n\nprint(int(np.argmin(np.array(gosa)))+1)', 'import numpy as np\nN = int(input())\nT,A = input().split()\n\nAve = [0]*N\ngosa = [0]*N\n\nH = input().split()\n\nfor i in range(N):\n H[i] = int(H[i])\n gosa[i] = abs(float(A) - float(T) + 0.006*H[i])\n\nprint(str(int(np.argmin(np.array(gosa)))+1))'] | ['Wrong Answer', 'Accepted'] | ['s180566605', 's061452487'] | [12504.0, 16032.0] | [153.0, 1080.0] | [249, 243] |
p03220 | u511457539 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['import numpy as np\n\nN = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\ngap = 1000000000000000000000\n\nH = np.asarray(H)\n\nTem = T-H*0.006\n\nfor i in range(N):\n if abs(H[i]-A)<gap:\n palace = i+1\n\nprint(palace)\n', 'import numpy as np\n\nN = int(input())\nT, A = map(int, input().split())\nH = list(map(int, input().split()))\n\ngap = 1000000000000000000000\n\nH = np.asarray(H)\n\nTem = T-H*0.006\n\nfor i in range(N):\n\n if abs(Tem[i]-A)<gap:\n gap = abs(Tem[i]-A)\n palace = i+1\n\nprint(palace)\n'] | ['Wrong Answer', 'Accepted'] | ['s816634698', 's020163924'] | [12504.0, 12500.0] | [159.0, 150.0] | [252, 283] |
p03220 | u512138205 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['s = input()\n\nmin_diff = 1000\ns_list = list(s)\nfor i in range(1, len(s_list) - 1):\n diff = abs(int(s_list[i - 1] + s_list[i] + s_list[i + 1]) - 753)\n min_diff = min(min_diff, diff)\n\nprint(min_diff)\n', 'n = int(input())\nx, y = map(int, input().split())\nh_list = list(map(int, input().split()))\n\nmin_diff = 9999999999\nmin_index = 0\nfor i, h in enumerate(h_list):\n diff = abs(y - (x - h * 0.006))\n if min_diff > diff:\n min_diff = diff\n min_index = i\n\nprint(min_index + 1)\n'] | ['Wrong Answer', 'Accepted'] | ['s571184812', 's062850234'] | [2940.0, 3060.0] | [17.0, 18.0] | [203, 287] |
p03220 | u514299323 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = input()\nT,A = map(int,input().split(" "))\nh = input().split(" ")\nH_ = [abs(T-0.006*int(k)-A) for k in h]\nprint(argmin(H_)+1)', 'N = int("2")\nT,A = map(int,"12 5".split(" "))\nh = "1000 2000".split(" ")\nH_ = [abs(T-0.006*int(k)-A) for k in h]\n\nm = float("inf")\narg = 0\nfor i in range(N):\n if H_[i] < m:\n arg = i+1\n m = H[i]\n\nprint(arg)\n\n \n ', 'N = input()\nT,A = map(int,input().split(" ")\nh = input().split(" ")\nH_ = [abs(T-0.006*int(k)-A) for k in h]\nprint(argmin(H_)+1)\n \n\n\n ', 'N = int(input())\nT,A = map(int,input().split(" "))\nh = input().split(" ")\nH_ = [abs(T-0.006*int(k)-A) for k in h]\n \nm = float("inf")\narg = 0\nfor i in range(N):\n if H_[i] < m:\n arg = i+1\n m = H[i]\n \nprint(arg)', 'N = int(input())\nT,A = map(int,input().split(" "))\nh = input().split(" ")\nH_ = [abs(T-0.006*int(k)-A) for k in h]\n \nm = float("inf")\narg = 0\nfor i in range(N):\n if H_[i] < m:\n arg = i+1\n m = H_[i]\n \nprint(arg)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s103038733', 's685687407', 's909489624', 's924906055', 's299044401'] | [3060.0, 3060.0, 2940.0, 3064.0, 3064.0] | [19.0, 17.0, 18.0, 18.0, 18.0] | [128, 219, 151, 215, 224] |
p03220 | u518064858 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\ntemp=9999\nfor i in h:\n if temp>abs((t-h[i]*0.006)-a):\n temp=abs((t-h[i]*0.006)-a)\n ans=i+1\nprint(ans)\n', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\ntemp=9999\nfor i in range(len(h)):\n if temp>abs((t-h[i]*0.006)-a):\n temp=abs((t-h[i]*0.006)-a)\n ans=i+1\nprint(ans)\n\n'] | ['Runtime Error', 'Accepted'] | ['s018333868', 's512238292'] | [3060.0, 3060.0] | [20.0, 18.0] | [196, 209] |
p03220 | u518556834 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nans = []\nfor i in range(n):\n ans.append(abs((t-h[i]*0.06)-a))\nprint(a.index(min(a))+1)\n ', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nans = []\nfor i in range(n):\n ans.append(abs((t-h[i]*0.06)-a))\nprint(ans.index(min(a))+1)\n \n', 'n = int(input())\nt,a = map(int,input().split())\nh = list(map(int,input().split()))\nans = []\nfor i in range(n):\n ans.append(abs((t-h[i]*0.006)-a))\nprint(ans.index(min(ans))+1)\n \n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s687134085', 's730069932', 's964563216'] | [3444.0, 3060.0, 3060.0] | [22.0, 18.0, 18.0] | [173, 176, 179] |
p03220 | u521866787 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nS=list(map(int,input().split()))\nans = -1\nminsa = 10**10\nfor point,s in enumerate(S):\n sa = (t-s*0.006 - a)**2\n if minsa > sa:\n minsa = sa\n ans = point\n\nprint(ans)', 'n=int(input())\nt,a=map(int,input().split())\nS=list(map(int,input().split()))\nans = -1\nminsa = 10**10\nfor point,s in enumerate(S):\n sa = (t-s*0.006 - a)**2\n if minsa > sa:\n minsa = sa\n ans = point\n\nprint(ans+1)'] | ['Wrong Answer', 'Accepted'] | ['s320757426', 's601987310'] | [3316.0, 3060.0] | [20.0, 18.0] | [215, 217] |
p03220 | u527261492 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\ndef abs(k,l):\n if k>l:\n return k-l\n else:\n return l-k \nb=20000313\ncnt=0\nfor i in range(n):\n if b>abs(a,t-0.006*h[i]):\n b=t-0.006*h[i]\n cnt=i\n else:\n b=b\n cnt=cnt\nprint(cnt+1)\n\n \n \n \n', 'n=int(input())\nt,a=map(int,inout().split())\nh=list(map(int,input().split()))\ndef abs(k,l):\n if k>l:\n return k-l\n else:\n return l-k \nb=20000313\ncnt=0\nfor i in range(n):\n if b>abs(a,t-0.006*h[i]):\n b=t-0.006*h[i]\n cnt=i\n else:\n b=b\n cnt=cnt\nprint(cnt+1)\n\n \n \n ', 'n=int(input())\nt,a=map(int,input().split())\nh=list(map(int,input().split()))\ndef abs(k,l):\n if k>l:\n return k-l\n else:\n return l-k \nb=20000313\ncnt=0\nfor i in range(n):\n if b>abs(a,t-0.006*h[i]):\n b=abs(a,t-0.006*h[i])\n cnt=i\n else:\n b=b\n cnt=cnt\nprint(cnt+1)\n\n \n \n \n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s134290412', 's790656927', 's151856348'] | [3064.0, 3064.0, 3060.0] | [18.0, 17.0, 19.0] | [285, 284, 292] |
p03220 | u529722835 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT , A = (int(i) for i in input().split())\nH_list = [int(h) for h in input().split()]\n \nA_list = [abs((T-0.006*H_list[n])-A) for n in range(N)]\n\nnumber = 0\nfor n ,x in enumerate(A_list):\n if x == min(A_list):\n number = n\nprint(number)', 'N = int(input())\nT , A = (int(i) for i in input().split())\nH_list = [int(h) for h in input().split()]\n\nnumber = min([abs((T-0.006*H_list[n])-A) for n in range(N)])\nprint(number)\n ', 'N = int(input())\nT , A = (int(i) for i in input().split())\nH_list = [int(h) for h in input().split()]\n \nA_list = [abs((T-0.006*H_list[n])-A) for n in range(N)]\n\nfor n ,x in enumerate(A_list):\n if x == min(A_list):\n number == n\nprint(n)', 'N = int(input())\nT , A = (int(i) for i in input().split())\nH_list = [int(h) for h in input().split()]\n \nA_list = [abs((T-0.006*H_list[n])-A) for n in range(N)]\n \nnumber = 0\nfor n ,x in enumerate(A_list):\n if x == min(A_list):\n number = n+1\nprint(number)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s739659460', 's860846775', 's938536518', 's759891277'] | [3064.0, 3060.0, 3060.0, 3064.0] | [44.0, 18.0, 40.0, 42.0] | [254, 180, 239, 263] |
p03220 | u531599639 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N=int(input())\nT,A=map(int, input().split())\nlist=list(map(int, input().split()))\nl_b=[]\nd=0\nc=0\nfor i in range(N):\n d=A-(T-list[i]*0.006)\n if d<0:\n d=-d\n l_b.append(d)\nprint(l_b.index(min(l_b)))', 'N=int(input())\nT,A=map(int, input().split())\nlist=list(map(int, input().split()))\nl_b=[]\nd=0\nfor i in range(N):\n d=A-(T-list[i]*0.006)\n if d<0:\n d=-d\n l_b.append(d)\nprint(l_b.index(min(l_b))+1\n', 'N=int(input())\nT,A=map(int, input().split())\nlist=list(map(int, input().split()))\nl_b=[]\nd=0\nfor i in range(N):\n d=A-(T-list[i]*0.006)\n if d<0:\n d=-d\n l_b.append(d)\nprint(l_b.index(min(l_b))+1)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s321907364', 's641955895', 's300612070'] | [3064.0, 2940.0, 3064.0] | [18.0, 17.0, 18.0] | [201, 199, 199] |
p03220 | u533679935 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\na = 0\n\nlst=[]\n\nfor i in H:\n lst.append(A-(T-i*0.006))\n\nprint(lst)\nprint(lst.index(min(lst))+1) ', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\nlst=[]\n\nfor i in H:\n lst.append(abs(A-abs(T-i*0.006)))\n\nprint(lst)\nprint(lst.index(min(lst))+1) ', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\n\nlst=[]\n\nfor i in range(N):\n lst.append(abs(A-(T-H[i]*0.006)))\n\nprint(lst.index(min(lst))+1) '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s188014024', 's551466987', 's005576245'] | [3060.0, 3060.0, 3060.0] | [19.0, 19.0, 19.0] | [181, 183, 179] |
p03220 | u533885955 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int,input().split(" "))\ntemp = []\nfor i in range(N):\n temp.append(map(int,input().split(" ")))\nj = 0\nk = 0\nflag = 0\ns = []\nwhile j < N:\n k = T - (0.006)*temp[j]\n if k >= A:\n s.append(k - A)\n else:\n s.append(A - k)\n if s[j] <= s[flag]:\n flag = j\n j = j + 1\nprint(j)', 'N = int(input())\nT,A = map(int,input().split(" "))\ntemp = []\nfor i in range(N):\n temp.append(map(int,input().split(" ")))\nj = 0\nk = 0\nflag = 0\ns = []\nwhile j < N:\n k = T - (0.006)*temp[j]\n if k >= A:\n s.append(k - A)\n else:\n s.append(A - k)\n if s[j] <= s[flag]:\n flag = j\n j = j + 1\nprint(flag)', 'N = int(input())\nT,A = map(int,input().split(" "))\nH = list(map(int,input().split(" ")))\nj = 0\nk = 0\nflag = 0\ns = []\nwhile j < N:\n k = T - (0.006)*H[j]\n if k >= A:\n s.append(k - A)\n else:\n s.append(A - k)\n if s[j] <= s[flag]:\n flag = j\n j = j + 1\nprint(flag+1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s355801037', 's708265645', 's077026148'] | [2940.0, 3064.0, 3064.0] | [17.0, 20.0, 19.0] | [314, 309, 274] |
p03220 | u535907456 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nS = list(map(int,input().split()))\nH = list(map(int,input().split()))\nT = S[0]\nA = S[1]\nsub = abs(A - (T - H[0]*0.006))\nfor x in range(0,N):\n H_sub = abs(A -(T - H[x]*0.006))\n if H_sub < sub:\n sub = H_sub\n X = x\nprint(X+1)', 'N = int(input())\nS = list(map(int,input().split()))\nH = list(map(int,input().split()))\nT = S[0]\nA = S[1]\nsub = abs(A - (T - H[0]*0.006))\nfor x in range(0,N):\n H_sub = abs(A -(T - H[x]*0.006))\n if H_sub <= sub:\n sub = H_sub\n X = x\nprint(X+1)'] | ['Runtime Error', 'Accepted'] | ['s435845783', 's606477596'] | [3064.0, 3064.0] | [19.0, 19.0] | [259, 260] |
p03220 | u538956308 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input)\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\nB = list(range(N))\ndef Temp(x):\n Temp = T-0.006*x\n return(Temp)\nfor i in range(N):\n B[i] = abs(Temp(H[i])-A)\nans = min(B)\nprint(B.index(ans)+1)', 'N = int(input())\nT,A = map(int,input())\nH = list(map(int,input()))\nB = list(range(N))\ndef Temp(x):\n Temp = T-0.006*x\n return(Temp)\nfor i in range(N):\n B[i] = abs(Temp(H[i])-A)\nans = min(B)\nprint(B.index(ans)+1)', 'N = int(input())\nT,A = map(int,input().split())\nH = list(map(int,input().split()))\nB = list(range(N))\ndef Temp(x):\n Temp = T-0.006*x\n return(Temp)\nfor i in range(N):\n B[i] = abs(Temp(H[i])-A)\nans = min(B)\nprint(B.index(ans)+1)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s249302533', 's357777055', 's491356556'] | [3064.0, 3060.0, 3064.0] | [17.0, 17.0, 19.0] | [227, 213, 229] |
p03220 | u543954314 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\nv = t-a\nfor i in range(n):\n h[i] = abs(v-h[i])\nprint(h.index(min(h))-1)', 'n = int(input())\nt, a = map(int, input().split())\nh = list(map(int, input().split()))\nv = t-a\nfor i in range(n):\n h[i] = abs(v-h[i]*0.006)\nprint(h.index(min(h))+1)'] | ['Wrong Answer', 'Accepted'] | ['s347998897', 's928547032'] | [3060.0, 3060.0] | [18.0, 19.0] | [160, 166] |
p03220 | u545368057 | 2,000 | 1,048,576 | A country decides to build a palace. In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius. There are N places proposed for the place. The elevation of Place i is H_i meters. Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there. Print the index of the place where the palace should be built. It is guaranteed that the solution is unique. | ['N = int(input())\nT,A = map(int,input().split())\nHs = list(map(int,input().split()))\n\ndiff_T = [abs(T-h*0.006-A) for h in Hs]\nprint(diff_T.index(min(diff_T)))', 'N = int(input())\nT,A = map(int,input().split())\nHs = list(map(int,input().split()))\n\ndiff_T = [abs(T-h*0.006-A) for h in Hs]\nprint(diff_T.index(min(diff_T))+1)'] | ['Wrong Answer', 'Accepted'] | ['s976335440', 's322298699'] | [3060.0, 3060.0] | [18.0, 17.0] | [157, 159] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.