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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02594 | u912654120 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['x = int(raw_input())\nif (x >= 30):\n \tprint("Yes")\nelse:\n\tprint("No")', 'x = int(input())\nif (x >= 30):\n \tprint("Yes")\nelse:\n\tprint("No")'] | ['Runtime Error', 'Accepted'] | ['s797316743', 's619510496'] | [8924.0, 8972.0] | [25.0, 29.0] | [68, 64] |
p02594 | u914693053 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['temp=int(input())\nif temp>=30:\n print("YES")\nelse:\n print("NO")\n', 't=int(input())\nif t>=30:\n print("YES")\nelse:\n print("NO")', 't=int(input())\nif t>=30:\n print("Yes")\n else:\n print("No")', 't=int(input())\nif t>=30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s354733252', 's376124485', 's917050882', 's779742771'] | [9136.0, 9148.0, 8872.0, 9084.0] | [31.0, 34.0, 27.0, 26.0] | [66, 59, 60, 59] |
p02594 | u914883924 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['x=int(input())\nif x<=30:\n print("yes")\nelse:\n print("no")', 'x=int(input())\nif x<=30:\n print("Yes")\nelse:\n print("No")', 'x=int(input())\nif x>=30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s052293834', 's762125103', 's452637700'] | [9084.0, 9144.0, 9148.0] | [32.0, 32.0, 28.0] | [63, 63, 63] |
p02594 | u915737443 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['X = int(input())\nif X >= 30:\n print("YES")\nelse:\n print("NO")', 'X = int(input())\nif X >= 30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s196017810', 's522385212'] | [9144.0, 9144.0] | [32.0, 28.0] | [67, 67] |
p02594 | u917722390 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['X = int(input())\n\nif X >= 30:\n print("YES")\nelse:\n print("NO")', 'x = int(input())\n\nif x >= 30:\n print("NO")\nelse:\n print("YES")', 'x = int(input())\n\nif x >= 30:\n print("YES")\nelse:\n print("NO")', 'x = int(input())\n\nif x>=30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s340601353', 's733462272', 's960376689', 's512251275'] | [9100.0, 8964.0, 9048.0, 9100.0] | [27.0, 29.0, 30.0, 27.0] | [64, 64, 64, 62] |
p02594 | u919235786 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["#a\nx=int(input())\nif -40<=x<=40:\n print('Yes')\nelse:\n print('No')", "#a\nx=int(input())\nif x>=30:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s719150845', 's388710791'] | [9172.0, 9168.0] | [32.0, 27.0] | [71, 66] |
p02594 | u919519672 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["if int(input()) >= 30:\n print('Yes')\nelse:\n print('Np')", "def prob_A():\n if int(input()) >= 30:\n print('Yes')\n else:\n print('No')\n\ndef main():\n prob_A()\n\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s475833656', 's334996251'] | [9144.0, 9140.0] | [36.0, 26.0] | [57, 158] |
p02594 | u923464546 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["return 'Yes' if int(input()) >= 30 else 'No'", "print( 'Yes' if int(input().strip()) >=30 else 'No')"] | ['Runtime Error', 'Accepted'] | ['s762000015', 's760781358'] | [8980.0, 9148.0] | [22.0, 28.0] | [44, 52] |
p02594 | u928347588 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['x = input()\nif x>= 30:\n print("Yes")\nelse:\n print("No")', 'x = int(input())\nif x >= 30:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s931733229', 's039902517'] | [9080.0, 9140.0] | [24.0, 31.0] | [61, 68] |
p02594 | u928784113 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['import itertools\nfrom collections import deque,defaultdict,Counter\nfrom itertools import accumulate\nimport bisect\nfrom heapq import heappop,heappush,heapify\nimport math\nfrom copy import deepcopy\nimport queue\nimport numpy as np\n\nMod = 1000000007\nfact = [1, 1]\nfactinv = [1, 1]\ninv = [0, 1] \nfor i in range(2, 10**5 + 1):\n fact.append((fact[-1] * i) % Mod)\n inv.append((-inv[Mod % i] * (Mod // i)) % Mod)\n factinv.append((factinv[-1] * inv[-1]) % Mod)\n \ndef cmb(n, r, p):\n if (r < 0) or (n < r):\n return 0\n r = min(r, n - r)\n return fact[n] * factinv[r] * factinv[n - r] % p\n \ndef sieve_of_eratosthenes(n):\n if not isinstance(n,int):\n raise TypeError("n is not int")\n if n<2:\n raise ValueError("n is not effective")\n prime = [1]*(n+1)\n for i in range(2,int(math.sqrt(n))+1):\n if prime[i] == 1:\n for j in range(2*i,n+1):\n if j%i == 0:\n prime[j] = 0\n res = []\n for i in range(2,n+1):\n if prime[i] == 1:\n res.append(i)\n return res\n \n \nclass UnionFind:\n def __init__(self,n):\n self.parent = [i for i in range(n+1)]\n self.rank = [0 for i in range(n+1)]\n \n def findroot(self,x):\n if x == self.parent[x]:\n return x\n else:\n y = self.parent[x]\n y = self.findroot(self.parent[x])\n return y\n \n def union(self,x,y):\n px = self.findroot(x)\n py = self.findroot(y)\n if px < py:\n self.parent[y] = px\n else:\n self.parent[px] = py\n \n def same_group_or_no(self,x,y):\n return self.findroot(x) == self.findroot(y)\ndef pow_k(x, n):\n \n if n == 0:\n return 1\n \n K = 1\n while n > 1:\n if n % 2 != 0:\n K *= x\n x *= x\n n //= 2\n \n return K * x\ndef main(): #startline-------------------------------------------\n n = int(input())\n s = input()\n print(s[:n//2+1].count("W"))\n \n \nif __name__ == "__main__":\n main() ', 'import itertools\nfrom collections import deque,defaultdict,Counter\nfrom itertools import accumulate\nimport bisect\nfrom heapq import heappop,heappush,heapify\nimport math\nfrom copy import deepcopy\nimport queue\nimport numpy as np\n\nMod = 1000000007\nfact = [1, 1]\nfactinv = [1, 1]\ninv = [0, 1] \nfor i in range(2, 10**5 + 1):\n fact.append((fact[-1] * i) % Mod)\n inv.append((-inv[Mod % i] * (Mod // i)) % Mod)\n factinv.append((factinv[-1] * inv[-1]) % Mod)\n \ndef cmb(n, r, p):\n if (r < 0) or (n < r):\n return 0\n r = min(r, n - r)\n return fact[n] * factinv[r] * factinv[n - r] % p\n \ndef sieve_of_eratosthenes(n):\n if not isinstance(n,int):\n raise TypeError("n is not int")\n if n<2:\n raise ValueError("n is not effective")\n prime = [1]*(n+1)\n for i in range(2,int(math.sqrt(n))+1):\n if prime[i] == 1:\n for j in range(2*i,n+1):\n if j%i == 0:\n prime[j] = 0\n res = []\n for i in range(2,n+1):\n if prime[i] == 1:\n res.append(i)\n return res\n\n \nclass UnionFind:\n def __init__(self,n):\n self.parent = [i for i in range(n+1)]\n self.rank = [0 for i in range(n+1)]\n \n def findroot(self,x):\n if x == self.parent[x]:\n return x\n else:\n y = self.parent[x]\n y = self.findroot(self.parent[x])\n return y\n \n def union(self,x,y):\n px = self.findroot(x)\n py = self.findroot(y)\n if px < py:\n self.parent[y] = px\n else:\n self.parent[px] = py\n \n def same_group_or_no(self,x,y):\n return self.findroot(x) == self.findroot(y)\ndef pow_k(x, n):\n\n if n == 0:\n return 1\n\n K = 1\n while n > 1:\n if n % 2 != 0:\n K *= x\n x *= x\n n //= 2\n\n return K * x\ndef main(): #startline-------------------------------------------\n print("Yes" if int(input()) >= 30 else "No")\nif __name__ == "__main__":\n main() '] | ['Runtime Error', 'Accepted'] | ['s426629317', 's735574638'] | [38904.0, 38764.0] | [218.0, 213.0] | [2139, 2088] |
p02594 | u931732548 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['X = int(input())\nprint("YNeos")[X>29::2]', 'X = int(input())\nprint("YNeos")[x>29::2]', 'X = int(input())\nprint("YNeos"[X>29::2])', 'X = int(input())\nprint("YNeos"[not(X>=30)::2])'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s120709149', 's688514243', 's876468245', 's918647919'] | [9116.0, 9072.0, 9080.0, 9076.0] | [25.0, 20.0, 26.0, 30.0] | [40, 40, 40, 46] |
p02594 | u932783739 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["X = int(input('室温を入力 >>'))\nif X >= 30:\n print('yes')\nelse:\n print('no')", "X = int(input('室温を入力 >>'))\nif X >= 30:\n print('Yes')\nelse:\n print('No')", "X = int(input())\nif X >= 30:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s566841424', 's798039929', 's192150005'] | [9088.0, 9064.0, 8976.0] | [29.0, 30.0, 29.0] | [87, 87, 67] |
p02594 | u933375408 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['n = int(input()).\nif n>=30:\n print("Yes")\nelse:\n print("No")\n\n', "if X>=30:\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\nif n >= 30:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s357865979', 's402741058', 's505433406'] | [8840.0, 8972.0, 9152.0] | [23.0, 20.0, 29.0] | [64, 45, 63] |
p02594 | u933650305 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['K=int(input())\nif K%2==0:\n print(-1)\na=7\nb=1\nfor i in range(1000000):\n if a%K==0:\n print(b)\n break\n else:\n a=a*10+7\n b+=1\n if b==1000001:\n print(-1)\n', 'X=int(input())\nif X>=30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s741914419', 's564775135'] | [9200.0, 9144.0] | [2206.0, 32.0] | [172, 59] |
p02594 | u938933689 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["X = int(input())\nif X >= 30:\n print ('Yes')\nelse:\n print('NO')\n", "X = int(input())\nif X >= 30:\n print ('Yes')\nelse:\n print('No')\n"] | ['Wrong Answer', 'Accepted'] | ['s906174833', 's502453894'] | [9052.0, 9032.0] | [29.0, 27.0] | [65, 65] |
p02594 | u945405878 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["n = int(input())\nif n >= 30:\n print('Yes')\n else:\n print('No')", "n = int(input())\nif n >= 30:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s165588733', 's975213638'] | [9008.0, 9056.0] | [20.0, 29.0] | [67, 67] |
p02594 | u951480280 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['if int(input())>=30:\n print(Yes)\nelse:\n print(No)', 'if int(input())>=30:\n print(Yes)\nelse:\n print(No)\n', 'if int(input())>=30:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s650354641', 's677641583', 's490681471'] | [9080.0, 9144.0, 9148.0] | [25.0, 24.0, 27.0] | [51, 56, 59] |
p02594 | u951502681 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["X=int(input('X='))\nif X>=30:\n print('Yes')\nelse:\n print('No')\n ", "X=int(input())\nif X>=30:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s844127249', 's409294383'] | [8948.0, 9064.0] | [33.0, 28.0] | [72, 63] |
p02594 | u953379577 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['if __name__ == "__main__":\n n = int(input())\n if x<29:\n print("No")\n else:\n print("Yes")', 'n = int(input())\nif n<30:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s512987440', 's930029545'] | [9148.0, 9148.0] | [23.0, 33.0] | [111, 64] |
p02594 | u954153335 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['n=int(intput())\nif 30<=n:\n print("Yes")\nelse:\n print("No")', 'n=int(input())\nif 30<=n:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s812723521', 's162679018'] | [9024.0, 9144.0] | [26.0, 34.0] | [64, 63] |
p02594 | u955118579 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['if input() >=30:\n print("Yes")\nelse:\n print("No")', 'if input() => 30:\n print("Yes")\nelse:\n print("No")', 'if int(input()) >= 30:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s420623531', 's532737398', 's288762904'] | [9020.0, 8948.0, 8996.0] | [24.0, 23.0, 27.0] | [55, 56, 61] |
p02594 | u957764821 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['X = int(input())\nif X < -40 or 40 < X:\n print("No")\nelse:\n print("Yes")', 'X = int(input())\nif not X < -40 or 40 < X:\n if X >= 30:\n print("Yes")\n else:\n print("No")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s291892739', 's346423174'] | [9176.0, 9152.0] | [30.0, 28.0] | [78, 133] |
p02594 | u957799665 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['k = int(input())\ni = 0\ns = 0\nans = -1\n\nfor z in range(k):\n i += 1\n #s = (7 + 10*s) % k\n s = 7 + 10*s\n if s % k != 0:\n s = s % k\n else:\n ans = i\n break\n\nprint(ans)\n', 'k = int(input())\ni = 0\ns = 0\nans = -1\n\nfor z in range(k):\n i += 1\n s = 7 + 10*s\n if s % k != 0:\n s = s % k\n else:\n ans = i\n break\n\nprint(ans)', 'import math\ni = 1\nz = 0\nt = 0\nn, d = map(int, input().split())\nwhile i <= n:\n i += 1\n a, b = map(int, input().split())\n if math.sqrt(a**2 + b**2) <= d:\n t += 1\n\nprint(t)', 'import math\ni = 1\nz = 0\nt = 0\nn, d = map(int, input().split())\nwhile i <= n:\n i += 1\n a, b = map(int, input().split())\n if math.sqrt(a**2 + b**2) <= d:\n t += 1\n\nprint(t)', "a = int(input())\nif a >= 30:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s189078377', 's202541645', 's585549424', 's716735343', 's842906543'] | [9068.0, 9048.0, 9072.0, 9132.0, 9084.0] | [26.0, 29.0, 23.0, 24.0, 30.0] | [199, 174, 185, 185, 67] |
p02594 | u961523950 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['K = int(input())\n\ncur_seq = 1\ndig = 1\n\nif K%2 == 0:\n print(-1)\nelse:\n while(not(cur_seq%K == 0)):\n cur_seq = cur_seq * 10 + 1\n dig += 1\n \nprint(dig)', 'temp = int(input())\n\nif temp >= 30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s703024412', 's496040375'] | [9104.0, 9020.0] | [2206.0, 24.0] | [171, 70] |
p02594 | u969081133 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["a=input()\nif a>=30:\n print('Yes')\nelse:\n print('No')", "X=input()\nif X>=30:\n print('Yes')\nelse:\n print('No')", "X=input()\nif X >= 30:\n print('Yes')\nelse:\n print('No')\n", "X=int(input())\nif X >= 30:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s066020034', 's349567442', 's963460797', 's855851634'] | [8996.0, 8956.0, 9016.0, 9128.0] | [26.0, 35.0, 24.0, 26.0] | [54, 54, 57, 61] |
p02594 | u972991614 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['K=int(input())\nn = 0\nseven=7\nwhile n<=K:\n seven += ((7*10)*n)\n if seven%K==0:\n print(n)\n break\n n +=1\nif n==K+1:\n print(-1)', "X = int(input())\n\nif X>=30:\n print('Yes')\nelif X<30:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s125832741', 's073766342'] | [9088.0, 9140.0] | [28.0, 32.0] | [149, 71] |
p02594 | u974918235 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['a = int(input())\nif -40 <= a <= 40:\n print("Yes")\nelse:\n print("No")', 'a = int(input())\nif a >= 30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s153155686', 's654723958'] | [9148.0, 9092.0] | [33.0, 31.0] | [74, 67] |
p02594 | u975997984 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["C = list(input())\nC_ = sorted(C)\n\nwr = rw = 0\nfor i in range(len(C_)):\n if C[i] != C_[i]:\n if C[i] == 'R' and C_[i] == 'W':\n rw += 1\n else:\n wr += 1\n\nprint(max(wr, rw))\n", "def main(x):\n if x >= 30:\n print('Yes')\n else:\n print('No')\n ", "X = int(input())\nif X < 30:\n print('No')\nelse:\n print('Yes')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s306966845', 's964005265', 's775645228'] | [9068.0, 9028.0, 9004.0] | [30.0, 28.0, 28.0] | [208, 74, 62] |
p02594 | u976887940 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["X=int(input())\nif X >=30:\n print('Yes')\nelse:\n print('NO')", 'k=int(input())\nc=0\nx=0\nfor c in range(6):\n x=x+7*10**c\n if x%k==0:\n print(c+1)\n break\n elif c==6:\n print(-1)\n break', 'X=int(input())\nif X >=25:\n print("Yes")\nelse:\n print("NO")', 'X=int(input())\nif X >=30:\n print("Yes")\nelse:\n print("NO")', 'X=int(input())\nif X >=30:\n print("Yes")\nelse:\n print("NO")', 'X=int(input())\nif X >=30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s064406164', 's306793121', 's772193533', 's797184668', 's857708877', 's592047954'] | [9024.0, 9164.0, 9048.0, 9092.0, 9076.0, 9096.0] | [24.0, 24.0, 31.0, 28.0, 31.0, 30.0] | [60, 130, 60, 60, 60, 60] |
p02594 | u978789527 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["n = int(input())\nif n >= 30:\n l = 'Yes'\n else:\n l = 'No'\n print(l)", "n = int(input())\nif n >= 30:\n l = 'Yes'\nelse:\n l = 'No'\nprint(l)\n "] | ['Runtime Error', 'Accepted'] | ['s017848701', 's905027515'] | [8896.0, 9080.0] | [22.0, 27.0] | [68, 69] |
p02594 | u980812095 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['X = input()\n\nif (int(X) >= 30):\n print("Yes")\nelse:\n print("no")', 'X = input()\n\nif (int(X) >= 30):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s187207348', 's782285490'] | [9096.0, 9156.0] | [30.0, 27.0] | [66, 66] |
p02594 | u985930315 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['if int(input()) >=30:\n print("Yes")\nif else:\n print("No")', 'if int(input()) >=30:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s124328335', 's915074523'] | [9012.0, 9160.0] | [24.0, 28.0] | [59, 56] |
p02594 | u988466682 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['x = int(input())\nif x >= 30:\n print("Yes")\n else:\n print("No")', 'x = int(input())\nif x >= 30:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s393362189', 's940662655'] | [9004.0, 9156.0] | [25.0, 25.0] | [75, 67] |
p02594 | u990957471 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['temp = input()\nif temp >= 30:\n print("Yes")\nelse:\n print("No")', 'temp = int(input())\nif temp >= 30:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s463715669', 's162345967'] | [9076.0, 9140.0] | [22.0, 32.0] | [64, 69] |
p02594 | u995109095 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ['n=int(input())\nif n>=30:\n print("YES")\nelse:\n print("NO")', 'n=int(input())\nif n>=30:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s552471178', 's642983493'] | [9144.0, 9148.0] | [34.0, 35.0] | [59, 63] |
p02594 | u998082063 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["a = input()\nif a >= 30:\n print('Yes')\nelse:\n print('No')", "\na = int(input())\nif a >= 30:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s683498210', 's884607713'] | [9028.0, 9052.0] | [28.0, 28.0] | [62, 68] |
p02594 | u999287037 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["x = input()\nif x >= 30:\n print('Yes')\nelif x < 30:\n print('No')", "x = int(input())\nif x >= 30:\n print('Yes')\nelif x < 30:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s896309797', 's690300070'] | [8972.0, 9080.0] | [24.0, 28.0] | [69, 74] |
p02594 | u999803454 | 2,000 | 1,048,576 | You will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above. The current temperature of the room is X degrees Celsius. Will you turn on the air conditioner? | ["x=input()\nif x>=30 :\n put('Yes') \nelse : \n put('No')", "x=input()\nif x>=30 :\n\u3000\u3000put('Yes')\n else :\n put('No')", "x=int(input())\nif x>=30 : \n put('Yes') \nelse : \n put('No')", "x=int(input())\nif x>=30 : \n print('Yes') \nelse : \n pt('No')", "x=int(input())\nif x>=30 : \n put('Yes')\nelse :\n put('No')", "x=int(input())\nif x>=30:\n print('Yes') \nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s119293761', 's151593638', 's285222914', 's975092273', 's992272318', 's650825825'] | [8952.0, 9008.0, 9056.0, 9156.0, 9084.0, 9156.0] | [22.0, 28.0, 28.0, 28.0, 22.0, 29.0] | [55, 60, 66, 63, 58, 62] |
p02595 | u001490106 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import numpy as np\nN,D = map(int, input().split())\n\nxy = [list(map(int, input().split())) for i in range(N)]\nsum=0\nfor x,y in zip(xy):\n if np.sqrt(x*x+y*y)<=D:\n sum+=1\nprint(sum)', '#------------------------------------------------------\nimport numpy as np\nN,D = map(int, input().split())\n\nxy_list = [list(map(int, input().split())) for i in range(N)]\nsum=0\nfor xy in xy_list:\n if np.sqrt(xy[0]*xy[0]+xy[1]*xy[1])<=D:\n sum+=1\nprint(sum)'] | ['Runtime Error', 'Accepted'] | ['s547351780', 's192777369'] | [63412.0, 63464.0] | [510.0, 790.0] | [198, 274] |
p02595 | u005408592 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n\n if X*X + Y*T <= D*D:\n ans += 1\n \nprint(ans)', 'N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n\n d = X*X + Y*Y <= D*D:\n ans += 1\n \nprint(ans)', 'N, D = map(int, input().split())\nans = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n\n if X*X + Y*Y <= D*D:\n ans += 1\n \nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s279838612', 's494290216', 's948978666'] | [9008.0, 8960.0, 9080.0] | [25.0, 26.0, 398.0] | [155, 156, 155] |
p02595 | u006425112 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\n\nans = 0\nfor i in range(n):\n x, y = map(int, input())\n if x ** 2 + y ** 2 <= d:\n ans += 1\n\nprint(ans)', 'n, d = map(int, input().split())\n\nans = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x ** 2 + y ** 2 <= d:\n ans += 1\n\nprint(ans)', 'n, d = map(int, input().split())\n\nans = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x ** 2 + y ** 2 <= d ** 2:\n ans += 1\n\nprint(ans)'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s215422581', 's747968423', 's674223300'] | [9112.0, 9108.0, 9056.0] | [27.0, 451.0, 480.0] | [147, 155, 160] |
p02595 | u009041760 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['impourt sys\n\ncount = 0\nn, d = [int(i) for i in input().split()]\nfor i in range(n):\n x, y = [int(i) for i in input().split()]\n if x * x + y * y <= d * d:\n count += 1\nprint(count)\n', 'import sys\n\ncount = 0\nn, d = [int(i) for i in input().split()]\nfor i in range(n):\n x, y = [int(i) for i in input().split()]\n if x * x + y * y <= d * d:\n count += 1\nprint(count)\n'] | ['Runtime Error', 'Accepted'] | ['s898367465', 's329875327'] | [8932.0, 9088.0] | [22.0, 405.0] | [183, 182] |
p02595 | u029568245 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = list(map(int, split().input()))n, d = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n x, y = list(map(int, input().split()))\n p = x **2 + y **2\n if p <= d**2:\n count += 1\n \nprint(count)', 'n, d = list(map(int, split().input()))', 'n, d = map(int, input().split())\n\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if d ** 2 >= x**2 + y**2:\n count = count+1\n\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s249931090', 's404178414', 's224712425'] | [8888.0, 8904.0, 9120.0] | [28.0, 22.0, 484.0] | [215, 38, 160] |
p02595 | u029918772 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\nxy = 0\nfor i in range(n):\n a, b = map(int, input().split())\n xy += xi**2 + yi**2 <= d**2 for xi, yi in xy\n\nprint(xy)', 'n, d = map(int, input().split())\nxy = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append([a, b])\n \ncount = 0\nfor xi, yi in xy:\n count += xi**2 + yi**2 <= d**2\n \nprint(count)', 'n, d = map(int, input().split())\nxy = []\nfor i in range(n):\n a, b = map(int, input().split())\n x.append([a, b])\n \ncount = 0\nfor xy in xy:\n count += xy[0]**2 + xy[1]**2 <= d**2\n \nprint(count)', 'n, d = map(int, input().split())\nxy = 0\nfor i in range(n):\n xi, yi = map(int, input().split())\n xy += xi**2 + yi**2 <= d**2\n \nprint(xy)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s000364874', 's499363080', 's959639644', 's584830614'] | [8956.0, 9140.0, 9136.0, 9116.0] | [29.0, 26.0, 26.0, 483.0] | [151, 191, 193, 137] |
p02595 | u029929095 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,r=map(int,input().split())\nc=0\nfor i in range(n):\n x,y=map(int,input().split())\n if x**2+y**2<r**2:\n c+=1\nprint(c)', 'n,r=map(int,input().split())\nc=0\nfor i in range(n):\n x,y=map(int,input().split())\n if x**2+y**2<=r**2:\n c+=1\nprint(c)'] | ['Wrong Answer', 'Accepted'] | ['s903762644', 's246294871'] | [9164.0, 9168.0] | [505.0, 490.0] | [121, 122] |
p02595 | u032491280 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['Z = list(input(""))\nN = int(Z[0])\nD = int(Z[1])\ncount = 0\n\nwhile(N--):\n Z1 = list(input(""))\n X = int(Z[0])\n Y = int(Z[1])\n \n d = (X**2 + Y**2)**0.5\n \n if d<=D:\n count += 1\n \nprint(count) ', 'Z = list(input(""))\nN = int(Z[0])\nD = int(Z[1])\ncount = 0\n \nwhile(N--):\n Z1 = list(input(""))\n X = int(Z1[0])\n Y = int(Z1[1])\n \n d = (X**2 + Y**2)**0.5\n \n if d<=D:\n count += 1\n \nprint(count)', 'Z = input("").split()\nN = int(Z[0])\nD = int(Z[1])\ncount = 0\n \nwhile(N):\n Z1 = input("").split()\n X = int(Z1[0])\n Y = int(Z1[1])\n \n d = (X**2 + Y**2)**0.5\n \n if d<=D:\n count += 1\n N = N -1\nprint(count)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s283714959', 's434569447', 's805346933'] | [9012.0, 8952.0, 9648.0] | [23.0, 26.0, 534.0] | [204, 203, 227] |
p02595 | u034441456 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\ncount = 0\nfor i in range(N):\n x, y = map(int, input().split())\n if x^2+y^2 <= D^2:\n count += 1\nreturn count', 'N, D = map(int, input().split())\ncount = 0\nfor i in range(N):\n x, y = map(int, input().split())\n if x*x + y*y <= D*D:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s142995702', 's161951992'] | [9020.0, 9060.0] | [25.0, 388.0] | [151, 153] |
p02595 | u034984919 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\n\nnum, dist = map(int, input().split())\ncount = 0\nfor i in range(0,num):\n x, y = map(int, input().split())\n distance = math.sqrt(x**2 + y**2)\n print("distance" + str(distance))\n if distance <= dist:\n count += 1\n\nprint(count)\n \n\n', 'import math\n\nnum, dist = map(int, input().split())\ncount = 0\nfor i in range(0,num):\n x, y = map(int, input().split())\n distance = math.sqrt(x**2 + y**2)\n if distance <= dist:\n count += 1\n\nprint(count)\n \n\n'] | ['Wrong Answer', 'Accepted'] | ['s826746533', 's792313031'] | [9088.0, 9176.0] | [1094.0, 493.0] | [265, 227] |
p02595 | u037807721 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\n\nend = 0\n\nn = input().split(" ")\nato = n[0]\n\nfor i in range(int(ato)): \n x = input().split(" ")\n exec("intX%d = %d" % (i,int(x[0])))\n exec("intY%d = %d" % (i,int(x[1])))\n\nfor i in range(int(ato)):\n answer = math.sqrt(pow(eval("intX" + str(i),2)) + pow(eval("intY" + str(i))))\n if answer <= n[1]:\n end = end + 1\n\nprint(end)', 'from math import sqrt\n \nn, d = map(int, input().split())\nxy = [list(map(int, input().split()))for _ in range(n)]\n \nans = 0\nfor x, y in xy:\n s = sqrt(x ** 2 + y ** 2)\n if s <= d:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s605822369', 's206626596'] | [59264.0, 45292.0] | [2207.0, 557.0] | [386, 211] |
p02595 | u042209706 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d = map(int,input().split())\nans = 0\nfor i in range(n):\n x,y = map(int,input().split())\n D = x **2 + y ** 2\n if D <= d:\n ans = ans + 1\nprint(ans)', 'n,d = map(int,input().split())\nans = 0\nfor i in range(n):\n x,y = map(int,input().split())\n D = x **2 + y ** 2\n if D <= d **2:\n ans = ans + 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s298995877', 's519142264'] | [9176.0, 9188.0] | [454.0, 510.0] | [153, 157] |
p02595 | u044026875 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d=map(int,input().split())\n\ncnt=0\ndist=0\n\nfor i in range(n){\n x,y=map(int,input().split())\n dist = x**2 + y**2\n if (dist <= d){\n cnt+=1\n }\n}\n\nprint(cnt)', 'n,d=map(int,input().split())\n\ncnt=0\ndist=0\n\nfor i in range(n):\n x,y=map(int,input().split())\n dist = x**2 + y**2\n if dist <= d**2:\n cnt+=1\n\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s219096338', 's953550633'] | [8944.0, 9172.0] | [24.0, 491.0] | [161, 156] |
p02595 | u047197186 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\nres = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x ** 2 + y ** 2 <= d:\n res += 1\nprint(res)', 'n, d = map(int, input().split())\nres = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if x ** 2 + y ** 2 <= d ** 2:\n res += 1\nprint(res)'] | ['Wrong Answer', 'Accepted'] | ['s732576764', 's310512882'] | [9116.0, 9168.0] | [438.0, 473.0] | [145, 150] |
p02595 | u050779044 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().strip().split())\nnumber = 0\n\nfor i in range(N):\n X,Y = map(int, input().split())\n distance = sqrt(X*X+Y*Y)\n if distance <= D:\n number += 1', 'N, D = map(int, input().split())\nnumber = 0\n\nfor i in range(N):\n X,Y = map(int, input().split())\n distance = sqrt(X*X+Y*Y)\n if distance <= D:\n number += 1\n', 'import numpy\n\nN, D = map(int, input().split())\nnumber = 0\n\nfor i in range(N):\n X,Y = map(int, input().split())\n distance = numpy.sqrt(X*X+Y*Y)\n if distance <= D:\n number += 1\nprint(number)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s150630452', 's359706943', 's398994658'] | [9104.0, 9076.0, 27028.0] | [27.0, 21.0, 972.0] | [178, 171, 204] |
p02595 | u050809439 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\ncount = 0\n\nfor _ in range(N):\n x,y = map(int, input().split())\n \n if (x**2 + y**2) < D**2:\n count += 1\n \n \nprint(count)', 'N, D = map(int, input().split())\ncount = 0\n\nfor _ in range(N):\n x,y = map(int, input().split())\n \n if (x**2 + y**2) <= D**2:\n count += 1\n \n \nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s613767487', 's285469946'] | [9152.0, 9112.0] | [472.0, 479.0] | [160, 161] |
p02595 | u053550236 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['c = 0\nN, D = map(float(), input().split())\nfor i in range(int(N)):\n a,b = map(float(), input().split())\n if a**2 + b**2 <= D:\n c+=1\nprint(c)', 'c = 0\nN, D = list(map(float, input().split()))\nfor i in range(int(N)):\n a, b = map(float, input().split())\n if a ** 2 + b ** 2 <= D**2:\n c += 1\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s220378458', 's891220953'] | [9060.0, 9096.0] | [24.0, 404.0] | [145, 165] |
p02595 | u054825571 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import sqrt\nN,D=map(int,input())\nans=0\nfor _ in range(N):\n p,q=map(int,input().split())\n if math.sqrt(p**2+q**2)<=D:\n ans+=1\nprint(ans)', 'import math\nN,D=map(int,input().split())\nans=0\nfor _ in range(N):\n p,q=map(int,input().split())\n if math.sqrt(p**2+q**2)<=D:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s857334873', 's782934073'] | [8892.0, 9152.0] | [23.0, 473.0] | [140, 148] |
p02595 | u059903069 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N,D=map(int, input().split())\nA = 0\nfor i in range(N):\n X,Y=map(int, input().split())\n if (D*D) >= (X*X)+(Y*Y):\n A +=1 \n print(A)\nprint(A)', 'N,D=map(int, input().split())\nA = 0\nfor i in range(N):\n X,Y=map(int, input().split())\n if (D*D) >= (X*X)+(Y*Y):\n A +=1 \nprint(A)'] | ['Wrong Answer', 'Accepted'] | ['s949926135', 's169524246'] | [9156.0, 9168.0] | [782.0, 382.0] | [158, 141] |
p02595 | u061930435 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d = map(int,input(),split(" "))\nd *= d\nc = 0\nfor i in range(n):\n a,b =map(int,input().split(" "))\n if(a**2 + b**2 == d):\n c += 1\nprint(c)', 'n,d=map(int,input().split(" "))\nc = 0\nd *= d\nfor i in range(n):\n a,b=map(int,input().split(" "))\n if(a**2+b**2==d):\n c+=1\nprint(c)', 'n,d=int(input()),int(input())\nc = 0\nd *= d\nfor i in range(n):\n a,b=int(input()),int(input())\n if(a**2+b**2==d):\n c+=1\nprint(c)', 'n,d = map(int,input().split(" "))\nd *= d\nc = 0\nfor i in range(n):\n a,b =map(int,input().split(" "))\n if(a**2 + b**2 == d):\n c += 1\nprint(c)\n', 'n,d = map(int,input().split(" "))\nd *= d\nc = 0\nfor i in range(n):\n a,b =map(int,input().split(" "))\n if(a**2 + b**2 <= d):\n c += 1\nprint(c)\n'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s230877009', 's293454225', 's889142378', 's896939726', 's713262793'] | [8936.0, 9172.0, 9176.0, 9184.0, 9172.0] | [24.0, 460.0, 29.0, 450.0, 446.0] | [144, 135, 131, 145, 145] |
p02595 | u062393996 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\n\nn,d = map(int,input().split())\ncou = 0\n\nfor i in range(n):\n a,b = map(int,input().split())\n dis = math.sqrt(a*a+b*b)\n if dis < d:\n cou +=1\n \nprint(cou)\n\n', 'import math\n\nn,d = map(int,input().split())\ncou = 0\n\nfor i in range(n):\n a,b = map(int,input().split())\n dis = math.sqrt(a*a+b*b)\n if dis <= d:\n cou +=1\n \nprint(cou)\n\n'] | ['Wrong Answer', 'Accepted'] | ['s630369829', 's568234298'] | [9184.0, 9116.0] | [421.0, 424.0] | [172, 173] |
p02595 | u062571807 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import numpy\nn,d = map(int,input().split())\na=[]\nb=[]\ncnt = 0\nfor i in range(n):\n a[i],b[i] = map(int,input().split())\n if numpy.sqrt(a[i]**2+b[i]**2)<=d:\n cnt += 1\nprint("{}".format(cnt))', 'n,d = map(int,input().split())\na=[]\nb=[]\ncnt = 0\nfor i in range(n):\n a[i],b[i] = map(int,input().split())\n if(sqrt(a[i]**2+b[i]**2)<=d)\n cnt += 1\nprint("{}".format(cnt))', 'n,d = map(int,input().split())\na=[]\nb=[]\ncnt = 0\nfor i in range(n):\n a[i],b[i] = map(int,input().split())\n if a[i]**2+b[i]**2<=d**2:\n cnt += 1\nprint("{}".format(cnt))', 'n,d = map(int,input().split())\na=[]\nb=[]\ncnt = 0\nfor i in range(n):\n c, e = map(int,input().split())\n if c**2+e**2<=d**2:\n cnt += 1\nprint("{}".format(cnt))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s281227393', 's674291332', 's746418195', 's100678909'] | [27160.0, 9028.0, 9188.0, 9184.0] | [115.0, 25.0, 28.0, 486.0] | [201, 182, 179, 168] |
p02595 | u068944955 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\nc = 0\nfor n in range(N):\n a, b = map(int, input().split())\n if a ** 2 + b ** 2 <= D:\n c += 1\n\nprint(c)\n', 'import math\nN, D = map(int, input().split())\nc = 0\nfor n in range(N):\n a, b = map(int, input().split())\n if math.sqrt(a ** 2 + b ** 2) <= D:\n c += 1\n\nprint(c)\n'] | ['Wrong Answer', 'Accepted'] | ['s521847191', 's581879511'] | [9068.0, 9180.0] | [449.0, 472.0] | [149, 172] |
p02595 | u069707486 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n=int(input())\nb=int(input())\ncount=1\ni=1\nwhile i<=n:\n p = int(input())\n q = int(input()) \n r = abs(complex(p,q))\n a=int(r)\n i+=1\nif a==b:\n count+=1\nprint(count)', 'N=int(input())\nD=int(input())\nans = 0\ni=1\nwhile i<=N:\n i+=1\n X=int(input())\n Y=int(input())\n if X * X + Y * Y <= D * D:\n ans += 1\nprint(ans)\n', 'read N, D as int\nans = 0\nfor i = 1, ..., N:\n\tread X, Y as int\n\tif X * X + Y * Y <= D * D:\n\t\tans += 1\n write ans\n', 'N=int(input())\nD=int(input())\nans = 0\nfor i in range(1,N):\n X=int(input())\n Y=int(input())\n if X * X + Y * Y <= D * D:\n ans += 1\nprint(ans)', 'N, D = map(int,input().split())\nans = 0\ni = 1\nwhile i <= N:\n i += 1\n X, Y = map(int,input().split())\n \n if X * X + Y * Y <= D * D:\n ans += 1\nprint(ans)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s039100132', 's334586953', 's881359238', 's985159763', 's071583238'] | [9140.0, 9104.0, 8896.0, 9136.0, 9152.0] | [22.0, 28.0, 26.0, 29.0, 397.0] | [168, 148, 112, 145, 159] |
p02595 | u074294554 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N,D=map(int,input().split())\nX=[]\nY=[]\nfor i in range(N)\n x,y=map(int,input().split())\n X.append(x)\n Y.append(y)\nans=0 \nfor i in range(N)\n if X[i]**2+Y[i]**2 <= D**2\n ans += 1\n\nprint(ans)\n', 'N,D=map(int,input().split())\nX=[]\nY=[]\nfor i in range(N):\n x,y=map(int,input().split())\n X.append(x)\n Y.append(y)\nans=0 \nfor i in range(N):\n if X[i]**2+Y[i]**2 <= D**2:\n ans += 1\n\nprint(ans)\n', ',D=map(int,input().split())\nX=[]\nY=[]\nfor i in range(N):\n x,y=map(int,input().split())\n X.append(x)\n Y.append(y)\nans=0 \nfor i in range(N):\n if X[i]**2+Y[i]**2 <= D**2:\n ans += 1\n\nprint(ans)\n', 'N,D=map(int,input().split())\nX=[]\nY=[]\nfor i in range(N):\n x,y=map(int,input().split())\n X.append(x)\n Y.append(y)\nans=0 \nfor i in range(N):\n if X[i]**2+Y[i]**2 <= D**2\n ans += 1\n\nprint(ans)', 'N,D=map(int,input().split())\nX=[]\nY=[]\nfor i in range(N):\n x,y=map(int,input().split())\n X.append(x)\n Y.append(y)\nans=0 \nfor i in range(N):\n if X[i]**2+Y[i]**2 <= D**2:\n ans += 1\n\nprint(ans)\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s290631425', 's576676284', 's864648137', 's951422027', 's811121926'] | [8908.0, 8920.0, 8888.0, 8920.0, 24800.0] | [25.0, 26.0, 25.0, 24.0, 537.0] | [206, 209, 212, 207, 213] |
p02595 | u079748877 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['x,y = map(int,input().split())\ny =y**2\ncount=0\nfor i in range(x):\n a,b = map(int,input().split())\t\n if a**2+b**2 <y:\n count+=1;\nprint(count)', 'x,y = map(int,input().split())\ny =y**2\ncount=0\nfor i in range(x):\n a,b = map(int,input().split())\t\n if a**2+b**2 <=y:\n count+=1;\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s592711334', 's269310037'] | [9076.0, 9048.0] | [461.0, 446.0] | [153, 154] |
p02595 | u085035133 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['# -*- coding: utf-8 -*-\n\nn, d = map(int, input().split())\n\ncnt = 0\n\nfor _ in range(n):\n x, y = map(int, input().split())\n dist = abs(x**2+y**2)\n if dist <= d:\n cnt += 1\n\nprint(cnt)\n', '# -*- coding: utf-8 -*-\nimport math\nn, d = map(int, input().split())\n\ncnt = 0\n\nfor _ in range(n):\n x, y = map(int, input().split())\n dist = math.sqrt(x**2+y**2)\n if dist <= d:\n cnt += 1\n\nprint(cnt)\n'] | ['Wrong Answer', 'Accepted'] | ['s557211463', 's436650508'] | [9176.0, 9180.0] | [471.0, 493.0] | [197, 214] |
p02595 | u094213642 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['c = list(map(int, input().split()))[0]\nn, d = c[0], c[0]\n\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\n\ncount = 0\n\nfor i in range(n-1):\n a = x[i]*x[i] + y[i]*y[i]\n if a <= d*d:\n count += 1\nprint(count)\n', 'n = list(map(int, input().split()))[0]\nd = list(map(int, input().split()))[1]\n\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\n\ncount = 0\n\nfor i in range(n):\n if x[i]*x[i] + y[i]*y[i] <= d*d:\n count += 1\nprint(count)', 'c = list(map(int, input().split()))\nn, d = c[0], c[0]\n\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\n\ncount = 0\n\nfor i in range(n-1):\n a = x[i]*x[i] + y[i]*y[i]\n if a <= d*d:\n count += 1\nprint(count)\n', 'c = list(map(int, input().split()))\nn, d = c[0], c[1]\n\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\n\nprint(x, y)\n\ncount = 0\n\nfor l in range(n):\n a = x[l]*x[l] + y[l]*y[l]\n if a <= d*d:\n count += 1\nprint(count)\n', 'c = list(map(int, input().split()))\nn, d = c[0], c[1]\n\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\n\nprint(x, y)\n\ncount = 0\n\nfor l in range(n-1):\n a = x[l]*x[l] + y[l]*y[l]\n if a <= d*d:\n count += 1\nprint(count)\n', 'c = list(map(int, input().split()))\nn, d = c[0], c[1]\n\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\n\ncount = 0\n\nfor l in range(n):\n a = x[l]*x[l] + y[l]*y[l]\n if a <= d*d:\n count += 1\nprint(count)\n'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s148503639', 's476139433', 's818778488', 's822964633', 's998578905', 's281914564'] | [9176.0, 96208.0, 116572.0, 116752.0, 116644.0, 116708.0] | [23.0, 656.0, 889.0, 933.0, 918.0, 900.0] | [256, 264, 253, 264, 266, 251] |
p02595 | u094565093 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\ncnt =0\nfor _ in range(N):\n a, b = map(int, input().split())\n if np.sqrt(a**2+b**2)<=D:\n cnt+=1\nprint(cnt)', 'import numpy as np\nN, D = map(int, input().split())\ncnt =0\nfor _ in range(N):\n a, b = map(int, input().split())\n if np.sqrt(a**2+b**2)<=D:\n cnt+=1\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s775664307', 's520412374'] | [9176.0, 27152.0] | [25.0, 867.0] | [151, 170] |
p02595 | u101237429 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\nn = []\nn = int(input().split())\n\ndef caldis(x, y):\n l = math.sqrt(x ** 2 + y ** 2)\n return l\n\nans = 0\n\n\nfor i in n[0]:\n input_num = []\n input_num = int(input().split())\n\n if caldis(input_num[0], input_num[1]) <= n[1]:\n ans += 1\n\nprint(ans)', 'import math\na = list(map(int,input().split()))\nxy = [map(int, input().split()) for _ in range(a[0])]\nx, y = [list(i) for i in zip(*xy)]\n\n\ndef caldis(x, y):\n l = math.sqrt(x ** 2 + y ** 2)\n return l\n\nans = 0\n\ni = 0\nfor i in range(a[0]):\n\n if caldis(x[i], y[i]) <= a[1]:\n ans += 1\n i += 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s445464551', 's538153502'] | [9072.0, 116708.0] | [31.0, 1117.0] | [273, 317] |
p02595 | u102351498 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\nli = input()\nn = int(li.split()[0])\nd = int(li.split()[1])\nmax_distance = math.sqrt(d**2)\nans = 0\nfor _ in range(n):\n li = input()\n x = int(li.split[0])\n y = int(li.split[1])\n distance = math.sqrt(x**2 + y**2)\n if distance <= max_distance:\n ans += 1\nprint(ans)', 'import math\nli = input()\nn = int(li.split()[0])\nd = int(li.split()[1])\nmax_distance = math.sqrt(d**2)\nans = 0\nfor _ in range(n):\n a = input()\n x = int(a.split()[0])\n y = int(a.split()[1])\n distance = math.sqrt(x**2 + y**2)\n if distance <= max_distance:\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s194141611', 's886404615'] | [9116.0, 9188.0] | [27.0, 491.0] | [294, 295] |
p02595 | u106181248 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int,input().split())\nans = 0\n\nfor i in range(x):\n x, y = map(int,input().split())\n z = (x**2 + y**2)**0.5\n if z <= d:\n ans += 1\n\nprint(ans)', 'n, d = map(int,input().split())\nans = 0\n \nfor i in range(n):\n x, y = map(int,input().split())\n z = (x**2 + y**2)**0.5\n if z <= d:\n ans += 1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s969982576', 's287135954'] | [9156.0, 9608.0] | [26.0, 482.0] | [156, 157] |
p02595 | u107267797 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import numpy as np\nN, D = list(map(int, input().split()))\nXY = [list(map(int, input().split())) for _ in range(N)]\n\nres = 0\nfor i in XY:\n if np.sqrt(XY[i][0] ** 2 + XY[i][1] ** 2) <= D:\n res += 1\n\nprint(res)\n', 'import math\nN, D = list(map(int, input().split()))\nXY = [list(map(int, input().split())) for _ in range(N)]\n\nres = 0\nfor i in XY:\n if math.sqrt(i[0] ** 2 + i[1] ** 2) <= D:\n res += 1\n\nprint(res)\n'] | ['Runtime Error', 'Accepted'] | ['s606817641', 's003468035'] | [63440.0, 45468.0] | [540.0, 534.0] | [218, 205] |
p02595 | u109272021 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d = map(int,input().split())\n\nans = 0\n\nfor i in input() :\n x,y = map(int,i.split())\n if pow(x,2) + pow(y,2) <= pow(d,2) :\n ans += 1\nprint(ans)', 'n,d = map(int,input().split())\np = [list(map(int,input().split())) for i in range(n)]\nans = 0\n\nfor i in p :\n if i[0]**2 + i[1]**2 <= d**2 :\n ans += 1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s666321983', 's799689809'] | [9068.0, 45468.0] | [26.0, 557.0] | [149, 164] |
p02595 | u119015607 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\n\nN,D= list(map(int,input().split()))\nx = [0] * N\ny = [0] * N\nb=0\n\nfor i in range(N):\n x[i], y[i] = map(int, input().split())\n a=x[i]**2+y[i]**2\n if math.sqrt(a) <=D:\n b+=1\nprint(b)\n', 'import math\n\nN,D= list(map(int,input().split()))\nx = [0] * N\ny = [0] * N\nb=0\n\nfor i in range(N):\n x[i], y[i] = map(int, input().split())\n #print(x[i])\n a=x[i]**2+y[i]**2\n #print(math.sqrt(a))\n if math.sqrt(a) <=D:\n b+=1\nprint(b)\n'] | ['Runtime Error', 'Accepted'] | ['s970598529', 's710308306'] | [9028.0, 24660.0] | [28.0, 516.0] | [216, 258] |
p02595 | u136943834 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = list(map(int, input().strip()))\ncnt = 0\nd2 = d**2\nx, y = [], []\nfor i in range(n):\n\ttx, ty = list(map(int, input().strip()))\n\tx.append(tx)\n\ty.append(ty)\n\nfor i in range(n):\n\tif(x[i]**2 + y[i]**2 <= d2):\n\t\tcnt += 1\nprint(cnt)', 'n, d = list(map(int, input().strip()))\ncnt = 0\nd2 = d**2\nfor i in range(n):\n\tx, y = list(map(int, input().strip()))\n\tif(x**2 + y**2 <= d2):\n\t\tcnt += 1\nprint(cnt)\n', 'n, d = list(map(int, input().split()))\ncnt = 0\nd2 = d**2\nx, y = [], []\nfor i in range(n):\n\ttx, ty = list(map(int, input().split()))\n\tx.append(tx)\n\ty.append(ty)\n\nfor i in range(n):\n\tif(x[i]**2 + y[i]**2 <= d2):\n\t\tcnt += 1\nprint(cnt)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s830569041', 's942867953', 's368153092'] | [9200.0, 9184.0, 24848.0] | [23.0, 25.0, 571.0] | [231, 162, 231] |
p02595 | u146057001 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if d^2 >= x^2 + y^2:\n count += 1\n\nprint(count)\n', 'n, d = map(int, input().split())\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input(), split())\n if d^2 >= x^2 + y^2:\n count += 1\n\nprint(count)\n', 'n, d = map(int, input().split())\ncount = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n if d * d >= x * x + y * y:\n count = count + 1\n\nprint(count)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s083307434', 's089936076', 's029982367'] | [9172.0, 9172.0, 9092.0] | [395.0, 24.0, 397.0] | [158, 159, 171] |
p02595 | u149604146 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\n\nn, dis = map(int, input().split())\n\ncount = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if math.sqrt(x^2 + y^2) <= dis:\n count += 1\n \nprint("{}".format(count))', 'import numpy as np\n\nn, dis = map(int, input().split())\n\ncount = 0\nfor i in range(n):\n x, y = map(int, input().split())\n res = np.sqrt(x**2 + y**2)\n if res <= dis:\n count += 1\n \nprint("{}".format(count))'] | ['Runtime Error', 'Accepted'] | ['s571090145', 's547005464'] | [9168.0, 27108.0] | [387.0, 1054.0] | [190, 209] |
p02595 | u156387428 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\nprint math\nN, D = map(int, input().split())\nl = [list(map(int, input().split())) for l in range(N)]\n\nans=0\nx=3\nfor i,a in enumerate(l):\n if math.sqrt(a[0]**2 + a[1]**2)>D :\n ans+=1', 'import math\nN, D = map(int, input().split())\nl = [list(map(int, input().split())) for l in range(N)]\n \nans=0\nfor i,a in enumerate(l):\n if math.sqrt(a[0]**2 + a[1]**2)<=D:\n ans+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s020204819', 's057437774'] | [8944.0, 45476.0] | [26.0, 581.0] | [202, 199] |
p02595 | u156397618 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import sys\n\nN, D = int(input().split())\n\nresult = 0\nfor i in range(N):\n x, y = int(input().split())\n if x*x + y*y <= D*D:\n result += 1\n \nprint(result)', 'import sys\n\nN, D = (int(x) for x in input().split())\n\nfor _ in range(N):\n x, y = (int(x) for x in input().split())\n if x*x + y*y <= D*D:\n result += 1\n \nprint(result)', 'import sys\n\nN, D = (int(x) for x in input().split())\n\nresult = 0\nfor _ in range(N):\n X, Y = (int(x) for x in input().split())\n if X * X + Y * Y <= D * D:\n result += 1\nprint(result)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s098135294', 's272635670', 's511927472'] | [9096.0, 9208.0, 9088.0] | [31.0, 27.0, 417.0] | [158, 173, 194] |
p02595 | u165114979 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = input().split()\nn = int(n)\nd = int(d)\nxy = [map(int, input().split()) for _ in range(5)]\nx, y = [list(i) for i in zip(*xy)]\nc = 0\n\nfor i in range(n):\n if x[i]*x[i]+y[i]*y[i] <= d*d:\n c +=1\n\nprint(c)', 'n, d = input().split()\nn = int(n)\nd = int(d)\nxy = [map(int, input().split()) for _ in range(n)]\nx, y = [list(i) for i in zip(*xy)]\nc = 0\n\nfor i in range(n):\n if x[i]*x[i]+y[i]*y[i] <= d*d:\n c +=1\n\nprint(c)'] | ['Runtime Error', 'Accepted'] | ['s258585004', 's974830016'] | [9188.0, 116736.0] | [23.0, 817.0] | [209, 209] |
p02595 | u165952242 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n = int(input())\nd = int(input())\ncount=0\nfor i in range(0,n):\n p = int(input())\n q = int(input())\n res = sqrt((p**2)+(q**2))\n if res<=d:\n count += 1\nprint(count)', 'from math import sqrt\nn,d = input().split()\nn = int(n)\nd = int(d)\ncount=0\nfor i in range(0,n):\n p,q = input().split()\n p = int(p)\n q = int(q)\n res = sqrt((p**2)+(q**2))\n if res<=d:\n count += 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s612781285', 's045707876'] | [9188.0, 9216.0] | [25.0, 452.0] | [169, 213] |
p02595 | u166012301 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\ncount = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if (x ** 2 + y ** 2) ** 0.5 < d:\n count += 1\nprint(count)\n \n', 'n, d = map(int, input().split())\ncount = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if (x ** 2 + y ** 2) ** 0.5 <= d:\n count += 1\nprint(count)\n \n\n'] | ['Wrong Answer', 'Accepted'] | ['s256530268', 's356310524'] | [9512.0, 9344.0] | [481.0, 493.0] | [177, 179] |
p02595 | u175590965 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d = map(int,input().split())\ncnt = 0\nfor i in raneg(n):\n p,q = map(int,input().split())\n cnt += p*p+q*q <= d*d\nprint(cnt)', 'n,d = map(int,input().split())\ncnt = 0\nfor i in range(n):\n p,q = map(int,input().split())\n cnt += p*p+q*q <= d*d\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s129455443', 's561513626'] | [9172.0, 9120.0] | [27.0, 403.0] | [129, 129] |
p02595 | u189326411 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n):\n x,y = list(map(int, input.split()))\n if (x**2 + y**2)**0.5 <= d:\n count += 1\n\nprint(count)\n', 'n,d = list(map(int, input.split()))\n\ncount = 0\nfor i in range(n):\n x,y = list(map(int, input.split()))\n if (x**2 + y**2)**0.5 <=d:\n count += 1\n\nprint(count)\n\n\n', 'n,d = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n):\n x,y = list(map(int, input().split()))\n if (x**2 + y**2)**0.5 <= d:\n count += 1\n\nprint(count)\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s235424141', 's362531748', 's567655466'] | [9192.0, 9100.0, 9592.0] | [27.0, 27.0, 503.0] | [173, 172, 175] |
p02595 | u190703272 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int,input().split())\n\nfor i in range(N):\n X, Y = map(int, input().split())\n A = ((X**2 + Y**2)**0.5)\n if A <= D:\n Z = Z + 1\nprint(Z)\n\n', 'N, D = map(int,input().split())\nZ = 0\nfor i in range(N):\n X, Y = map(int, input().split())\n A = ((X**2 + Y**2)**0.5)\n if A <= D:\n Z = Z + 1\nprint(Z)'] | ['Runtime Error', 'Accepted'] | ['s519901687', 's284930992'] | [9428.0, 9620.0] | [26.0, 499.0] | [161, 164] |
p02595 | u191239329 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\nA = 0\nfor point in range(N):\n p, q = map(int, input().split())\n dis = q**2 + q**2\n if(dis <= D**2): \n A += 1\n\nprint (A)', 'N, D = map(int, input().split())\nA = 0\nfor point in range(N):\n p, q = map(int, input().split())\n dis = p**2 + q**2\n if(dis <= D**2): \n A += 1\n\nprint (A)'] | ['Wrong Answer', 'Accepted'] | ['s969131324', 's170488876'] | [9088.0, 9080.0] | [485.0, 498.0] | [170, 170] |
p02595 | u191444581 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\nD = D ** 2\nans = 0\nfor i in range(N) :\n x, y = map(int, input().split())\n if x ** 2 + y ** 2 <= D ** 2 :\n ans += 1\nprint(ans)', 'N, D = map(int, input().split())\nD = D ** 2\nans = 0\nfor i in range(N) :\n x, y = map(int, input().split())\n if x ** 2 + y ** 2 <= D :\n ans += 1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s506360197', 's333210096'] | [9184.0, 9184.0] | [505.0, 449.0] | [171, 166] |
p02595 | u193597115 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\n\ndef distance(N, D, point):\n count = 0\n for i in range(N):\n if math.sqrt(points[i][0]**2 + points[i][1]**2) <= D:\n count += 1\n return count\n\n\nif __name__ == "__main__":\n N, D = map(int, input().split())\n points = []\n for _ in range(N):\n x, y = map(int, input.split())\n points.append([x,y])\n print(distance(N,D,points))', 'def distance(N, D, point):\n count = 0\n for i in range(N):\n if sqrt(points[i][0]**2 + points[i][1]**2) <= D:\n count += 1\n return count\n\n\nif __name__ == "__main__":\n N, D = map(int, input().split())\n points = []\n for _ in range(N):\n x, y = map(int, input.split())\n points.append([x,y])\n print(distance(N,D,points))', 'import math\n\ndef distance(N, D, point):\n count = 0\n for i in range(N):\n if math.sqrt(points[i][0]**2 + points[i][1]**2) <= D:\n count += 1\n return count\n\n\nif __name__ == "__main__":\n N, D = map(int, input().split())\n points = []\n for _ in range(N):\n x, y = map(int, input().split())\n points.append([x,y])\n print(distance(N,D,points))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s445227264', 's941482116', 's855793387'] | [9140.0, 9172.0, 39232.0] | [26.0, 24.0, 572.0] | [383, 365, 385] |
p02595 | u193880030 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\nn, d = map(int, input().split())\nans = 0\nfor _ in range(n):\n x, y = map(int, input().split())\n a = x**2 + y **2\n d = d**2\n if a <= d:\n ans+=1\nprint(ans)', 'import math\nn, d = map(int, input().split())\nans = 0\nfor _ in range(n):\n x, y = map(int, input().split())\n if x**2+y**2 <= d*d:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s276388006', 's986787774'] | [287360.0, 9100.0] | [2212.0, 448.0] | [171, 151] |
p02595 | u194028846 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\nx, y = map(int, input().split())\ntotal = x**2 + y**2\nkyori = math.sqrt(total)\nprint(kyori)', 'import math\nN,D = map(int, input().split())\nCount = 0\nfor i in range(N):\n x, y = map(int, input().split())\n total = x**2 + y**2\n kyori = math.sqrt(total)\n if kyori <= D:\n Count = Count + 1\n\nprint(Count)'] | ['Wrong Answer', 'Accepted'] | ['s277732152', 's971298250'] | [9164.0, 9184.0] | [32.0, 488.0] | [102, 221] |
p02595 | u195272001 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = [int(i) for i in input().split()]\nX = int(0)\nY = int(0)\nB = int(0)\nZ = int(0)\nfor i in range(N):\n A = []\n A = [int(N) for N in input().split()]\n X = A[0]\n Y = A[1]\n print(Z = ((X**2+Y**2)**0.5))\n if Z<= D:\n B+=1\nprint(B)\n', 'N, D = [int(i) for i in input().split()]\nX = int(0)\nY = int(0)\nB = int(0)\nZ = int(0)\nfor i in range(N):\n A = []\n A = [int(N) for N in input().split()]\n X = A[0]\n Y = A[1]\n Z = ((X**2+Y**2)**0.5)\n if Z<= D:\n B+=1\nprint(B)\n'] | ['Runtime Error', 'Accepted'] | ['s320052376', 's380597002'] | [9332.0, 9656.0] | [26.0, 515.0] | [238, 231] |
p02595 | u196455939 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['import math\nN,D = map(int, input().split())\nkyori = 0\ntotal = 0\nfor i in range(N): \n X,Y = map(int, input().split())\n kyori = math.sqrt(X**2 + Y**2)\n if D > kyori:\n total += 1\n\nprint(total)', 'import math\nN,D = map(int, input().split())\nkyori = 0\ntotal = 0\nfor i in range(N): \n X,Y = map(int, input().split())\n kyori = math.sqrt(X**2 + Y**2)\n if D >= kyori:\n total += 1\n\nprint(total)'] | ['Wrong Answer', 'Accepted'] | ['s259092129', 's453395567'] | [9176.0, 9124.0] | [508.0, 528.0] | [213, 214] |
p02595 | u216752093 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n,d=map(int,input().split())\nans=0\nfor i in range(n):\n x,y=map(int,input().split())\n ok=0\n if x<=d or y<=d:\n ok+=1\n elif x**2+y**2 <= d**2:\n ok+=1\n if ok>0:\n ans+=1\nprint(ans)', 'n,d=map(int,input().split())\nans=0\nfor i in range(n):\n x,y=map(int,input().split())\n ok=0\n if x**2+y**2 <= d**2:\n ok+=1\n if ok>0:\n ans+=1\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s429268651', 's238637564'] | [9200.0, 9196.0] | [402.0, 504.0] | [211, 174] |
p02595 | u218757284 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\n\ncnt = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if d * d > x * x + y * y:\n cnt += 1\n\nprint(cnt)', 'n, d = map(int, input().split())\n\ncnt = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if d * d >= x * x + y * y:\n cnt += 1\n\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s096142285', 's851659722'] | [9176.0, 9176.0] | [395.0, 397.0] | [148, 149] |
p02595 | u219937318 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['A,B = map(int,input().split())\nt=0\nfor i in range(A):\n X,Y = map(int,input().split())\n if (X^2+Y^2)<=B^2:\n t=t+1\n else:\n t=t\nprint(t)', 'A,B = map(int,input().split())\nt=0\nfor i in range(A):\n X,Y = map(int,input().split())\n if (X^2+Y^2)>=B^2:\n t=t+1\n else:\n t=t\nprint(t)', 'N,D = map(int,input().split())\nt=0\nfor i in range(N):\n X,Y = map(int,input().split())\n if (X**2+Y**2)<D**2:\n t=t+1\n else:\n t=t\nprint(t)', 'A,B = map(int,input().split())\nt=0\nfor i in range(A):\n X,Y = map(int,input().split())\n if (X^2+Y^2)>B^2:\n t=t+1\n else:\n t=t\nprint(t)', 'A,B = map(int,input().split())\nt=0\nfor i in range(A):\n X,Y = map(int,input().split())\n if (X^2+Y^2)>=B^2:\n t=t+1\n else:\n t-t\nprint(t)', 'N,D = map(int,input().split())\nt=0\nfor i in range(N):\n X,Y = map(int,input().split())\n if (X**2+Y**2)<=D**2:\n t=t+1\n else:\n t=t\nprint(t)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s414449143', 's734389518', 's798796768', 's877262903', 's909498600', 's371179524'] | [9172.0, 9180.0, 9092.0, 9140.0, 9156.0, 9096.0] | [419.0, 404.0, 501.0, 389.0, 404.0, 490.0] | [156, 156, 158, 155, 156, 159] |
p02595 | u226779434 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['from math import sqrt\nn, d = map(int,input().split())\na = [map(int,input().split()) for _ in range(n)]\ncnt = 0\nfor i in range(n):\n if pow(d,2) >= pow(a[i][0],2) + pow(a[i][1],2):\n cnt += 1\nprint(cnt)', 'n,d = map(int,input().split())\ncnt = 0\nfor i in range(n):\n a,b =map(int,input().split())\n if pow(d,2) >= pow(a,2) + pow(b,2):\n \tcnt += 1\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s357756820', 's744773889'] | [96316.0, 9176.0] | [686.0, 497.0] | [203, 150] |
p02595 | u227075267 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['n, d = map(int, input().split())\nx = []\ny = []\ncnt = 0\n\nfor i in range(n):\n x.append(int(input()))\n y.append(int(input()))\n\nfor j in range(n):\n l = (x[j] ** 2 + y[j] ** 2) ** (1 / 2)\n if l <= d:\n cnt += 1\n else:\n continue\n\nprint(cnt)', 'n, d = map(int, input().split())\nlists = []\ncnt = 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n lists.append([x, y])\n \n\nfor j in range(n):\n l = (lists[j][0] ** 2 + lists[j][1] ** 2) ** (1 / 2)\n if l <= d:\n cnt += 1\n # else:\n # continue\n\nprint(cnt)'] | ['Runtime Error', 'Accepted'] | ['s429469052', 's937877056'] | [9076.0, 39512.0] | [25.0, 567.0] | [244, 270] |
p02595 | u236885379 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['from math importsqrt\nn, p = map(int, input().split())\nr = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if sqrt(x*x+y*y) <= p:\n r += 1\nprint(r)', 'from math import sqrt\nn, p = map(int, input().split())\nr = 0\nfor i in range(n):\n x, y = map(int, input().split())\n if sqrt(x*x+y*y) <= p:\n r += 1\nprint(r)'] | ['Runtime Error', 'Accepted'] | ['s735154067', 's107088733'] | [8908.0, 9176.0] | [29.0, 420.0] | [158, 159] |
p02595 | u240234332 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N, D = map(int, input().split())\ni = 0\ncount = 0\nwhile (i < N):\n p, q = map(int, input().split())\n d = math.sqrt(p*p + q*q)\n if (d <= D):\n count+= 1\n i+= 1\nprint(i)', 'import math\nN, D = map(int, input().split())\ni = 0\ncount = 0\nwhile (i < N):\n p, q = map(int, input().split())\n d = math.sqrt(p*p + q*q)\n if (d <= D):\n count+= 1\n i+= 1\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s511805426', 's634300978'] | [9072.0, 9000.0] | [25.0, 442.0] | [183, 199] |
p02595 | u243312682 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ["from math import sqrt\n\ndef main():\n n, d = map(int, input().split())\n xy = [list(map(int, input().split())) for _ in range(n)]\n print(n, d)\n print(xy)\n cnt = 0\n for x, y in xy:\n xy_d = sqrt(x**2 + y**2)\n if xy_d <= d:\n cnt +=1\n print(cnt)\n \nif __name__ == '__main__':\n main()", "from math import sqrt\n\ndef main():\n n, d = map(int, input().split())\n xy = [list(map(int, input().split())) for _ in range(n)]\n cnt = 0\n for x, y in xy:\n xy_d = sqrt(x**2 + y**2)\n if xy_d <= d:\n cnt +=1\n print(cnt)\n\nif __name__ == '__main__':\n main()"] | ['Wrong Answer', 'Accepted'] | ['s883025496', 's394937160'] | [52604.0, 45472.0] | [617.0, 535.0] | [327, 293] |
p02595 | u244434589 | 2,000 | 1,048,576 | We have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i). Among them, we are looking for the points such that the distance from the origin is at most D. How many such points are there? We remind you that the distance between the origin and the point (p, q) can be represented as \sqrt{p^2+q^2}. | ['N,D=map(int,input().split())\nans =0\n\nfor i in range(N):\nX,Y =map(int,input().split())\nif D::2>=X**2+y**2:\n ans +=1\n\nprint(ans)', 'N,D=map(int,input().split())\nans =0\n\nfor i in range(N):\n X,Y =map(int,input().split())\n if D**2>=X**2+Y**2:\n ans +=1\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s306522128', 's655615647'] | [8916.0, 8992.0] | [28.0, 473.0] | [129, 141] |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.