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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02691 | u690554532 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ["import sys\ninput = sys.stdin.readline\n\ndef main():\n n = int(input())\n a_list = list(map(int, input().split()))\n c = [0] * n\n s = 0\n for i, a in enumerate(a_list):\n if i+a < n:\n d[i+a] += 1\n if i-a >= 0:\n s += d[i-a]\n print(s)\n\nif __name__ == '__main__':\n main()", "import sys\ninput = sys.stdin.readline\n\ndef main():\n n = int(input())\n a_list = list(map(int, input().split()))\n c = [0] * n\n s = 0\n for i, a in enumerate(a_list):\n if i+a < n:\n c[i+a] += 1\n if i-a >= 0:\n s += c[i-a]\n print(s)\n\nif __name__ == '__main__':\n main()"] | ['Runtime Error', 'Accepted'] | ['s283014889', 's737671591'] | [31088.0, 31252.0] | [68.0, 106.0] | [318, 318] |
p02691 | u701017915 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['N = int(input())\nA = list(map(int, input().split()))\nfor i in range(N):\n plus = i+1 + A[i]\n AP.append(plus)\n minus = i+1 - A[i]\n AM.append(minus)\n \nprint(AP)\nprint(AM)\nans = 0 \n\nfor j in range(N):\n ans += AP.count(j) * AM.count(j)\n\nprint(ans)', 'N = int(input())\nA = list(map(int, input().split()))\nAM = []\nAP = []\nAMlist = [0] * N\nAPlist = [0] * N\n\nfor i in range(N):\n plus = i+1 + A[i]\n AP.append(plus) \n if AP[i] <= N:\n APlist[AP[i]-1] += 1\n minus = i+1 - A[i]\n AM.append(minus)\n if AM[i] > 0 and AM[i] <= N:\n AMlist[AM[i]-1] += 1\n \nans = 0\n\nfor j in range(N):\n ans += APlist[j] * AMlist[j]\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s083473249', 's553406082'] | [32404.0, 38016.0] | [65.0, 273.0] | [248, 376] |
p02691 | u706414019 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['import sys,math,collections,\ninput = sys.stdin.readline\nN=int(input())\nA=list(map(int,input().split()))\nB = []\nC = []\nfor i,a in enumerate(A):\n B.append(i+a)\n C.append(i-a)\ncnt = 0\nBc = collections.Counter(B)\nCc = collections.Counter(C)\n\nfor key,val in Bc.items():\n cnt += val*Cc[key]\nprint(cnt)\n', 'import sys,collections\ninput = sys.stdin.readline\nN=int(input())\nA=list(map(int,input().split()))\nB = []\nC = []\nfor i,a in enumerate(A):\n B.append(i+a)\n C.append(i-a)\ncnt = 0\nBc = collections.Counter(B)\nCc = collections.Counter(C)\n\nfor key,val in Bc.items():\n cnt += val*Cc[key]\nprint(cnt)\n'] | ['Runtime Error', 'Accepted'] | ['s161053232', 's918423434'] | [9004.0, 63716.0] | [24.0, 255.0] | [305, 299] |
p02691 | u726823037 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['import sys\ndef Ii():return int(sys.stdin.buffer.readline())\ndef Mi():return map(int,sys.stdin.buffer.readline().split())\ndef Li():return list(map(int,sys.stdin.buffer.readline().split()))\n\nn = Ii()\na = Li()\nx = [0]*n\nans = 0\nfor i in range(n): \n print(x)\n if a[i]+i < n:\n x[a[i]+i] += 1\n if i-a[i] >= 0:\n ans += x[i-a[i]]\n \nprint(ans)', 'import sys\ndef Ii():return int(sys.stdin.buffer.readline())\ndef Mi():return map(int,sys.stdin.buffer.readline().split())\ndef Li():return list(map(int,sys.stdin.buffer.readline().split()))\n\nn = Ii()\na = Li()\nx = [0]*n\nans = 0\nfor i in range(n): \n if a[i]+i < n:\n x[a[i]+i] += 1\n if i-a[i] >= 0:\n ans += x[i-a[i]]\n \nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s988800343', 's952634969'] | [150148.0, 30584.0] | [2420.0, 163.0] | [348, 337] |
p02691 | u729133443 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['x,r=int(input()),range(-99,99);[i**5-x-j**5or exit(print(i,j))for i in r for j in r]', 's=i=0\nd={}\nfor a in[*open(0)][1].split():a=int(a);s+=d.get(i-a,0);d[i+a]=d.get(i+a,0)+1;i+=1\nprint(s)'] | ['Wrong Answer', 'Accepted'] | ['s508929737', 's903709270'] | [10900.0, 46284.0] | [49.0, 181.0] | [84, 101] |
p02691 | u743420240 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['import sys\n\nsys.setrecursionlimit(1000000)\n\n\n\n\ndef main():\n n = int(input())\n a_dic = {}\n i = 0\n for a in list(map(int, input().split())):\n a_dic[i] = a\n i += 1\n\n count = 0\n for i in range(n):\n ai = a_dic[i]\n for j in range(i+1, n):\n # combi = (i,j)\n if j - i == ai + a_dic[j]:\n count += 1\n\n\n\nmain()\n', 'def is_ok(mid: int, target: int, ls: []):\n return target <= ls[mid]\n\n\ndef bi_search(target: int, ls: []):\n ng = -1\n ok = len(ls)\n\n cnt = 0\n while ok - ng > 1:\n mid = ng + int((ok - ng) / 2)\n cnt += 1\n if is_ok(mid, target, ls):\n ok = mid\n else:\n ng = mid\n return ok\n\n\ndef main():\n n = int(input())\n l_dic = {}\n r_dic = {}\n i = 0\n for a in map(int, input().split()):\n ld = l_dic.setdefault(i + a, [])\n ld.append(i)\n rd = r_dic.setdefault(i - a, [])\n rd.append(i)\n i += 1\n\n count = 0\n for rk, rv_list in r_dic.items():\n if rk not in l_dic:\n continue\n lv_list = l_dic[rk]\n for rv in rv_list:\n ind = bi_search(rv, lv_list)\n if ind == len(lv_list):\n count += ind\n else:\n count += ind + 1\n # for lv in lv_list:\n # if lv < rv:\n # count += 1\n # else:\n # break\n\n print(count)\n\n\nmain()\n'] | ['Wrong Answer', 'Accepted'] | ['s437700485', 's657965757'] | [40664.0, 98960.0] | [2206.0, 673.0] | [383, 1077] |
p02691 | u745687363 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n = int(input())\nA = list(map(int, input().split()))\nL = [i+x for i, x in enumerate(A)]\nR = [i-x for i, x in enumerate(A) if i-x > 0]\n\nP = collections.Counter(L)\nQ = collections.Counter(R)\n \nans = 0\nfor k, v in P.item():\n if k in Q:\n ans += v*Q[k]\nprint(ans) \n', 'n = int(input())\nA = list(map(int, input().split()))\nL = [i+x for i, x in enumerate(A)]\nR = [i-x for i, x in enumerate(A) if i-x > 0]\n\nfrom collections import Counter\nP = Counter(L)\nQ = Counter(R)\n \nans = 0\nfor k, v in P.items():\n if k in Q:\n ans += v*Q[k]\nprint(ans) \n \n'] | ['Runtime Error', 'Accepted'] | ['s069857371', 's420227770'] | [32292.0, 45316.0] | [100.0, 181.0] | [273, 279] |
p02691 | u764215612 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['def main():\n n,a=map(int,open(0).read().split());d,s=[0]*n,0\n for i,x in enumerate(a):\n if i+x<n:d[i+x]+=1\n if i-x>=0:s+=d[i-x]\n print(s)\nmain()', 'def main():\n n,a,d = int(input()),list(map(int, input().split())),[0]*n\n for i,x in enumerate(a):\n if i+x < n: d[i+x] += 1\n print(sum([d[i-x] for i,x in enumerate(a) if i-x>=0]))\nmain()', 'def main():\n n,*a=map(int,open(0).read().split());d,s=[0]*n,0\n for i,x in enumerate(a):\n if i+x<n:d[i+x]+=1\n s+=d[i-x]\n print(s)\nmain()', 'from collections import defaultdict\ndef main():\n n, *a = map(int,open(0).read().split())\n d, s = defaultdict(int), 0\n for i, x in enumerate(a):\n d[i+x]+=1\n s+=d[i-x]\n print(s)\nmain()'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s392661891', 's839934857', 's931028556', 's173599398'] | [25500.0, 32224.0, 33028.0, 62368.0] | [38.0, 63.0, 103.0, 203.0] | [146, 186, 137, 192] |
p02691 | u779728630 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['N = int(input())\n\nA = tuple( map(int, input().split()) )\n\ndict_ = {}\n\nans = 0\nfor i in range(N):\n k = (i+1) - A[i]\n if k in dict_:\n ans += dict[k]\n ad = (i+1) + A[i]\n if ad in dict_:\n dict_[ad] = dict_[ad] + 1\n dict_[ad] = 1\n\nprint(ans)', 'N = int(input())\n\nA = tuple( map(int, input().split()) )\n\ndict_ = {}\n\nans = 0\nfor i in range(N):\n k = (i+1) - A[i]\n if k in dict_:\n ans += dict_[k]\n ad = (i+1) + A[i]\n if ad in dict_:\n dict_[ad] = dict_[ad] + 1\n else:\n dict_[ad] = 1\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s351949653', 's888699014'] | [38616.0, 40396.0] | [156.0, 198.0] | [247, 259] |
p02691 | u781262926 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['from collections import Counter\nn = int(inputs[0])\n*A, = (map(int, inputs[1].split()))\nB = Counter([a+i for i, a in enumerate(A, 1)])\nC = Counter([i-a for i, a in enumerate(A, 1)])\nans = 0\nfor k, v in B.items():\n if k in C:\n ans += C[k]*v\nprint(ans)', 'n, *A = map(int, open(0).read().split())\nans = 0\nfor i, a in enumerate(A, 1):\n x, y = i+a, i-a\n d[x] = d.get(x, 0)+1\n ans += d.get(y, 0)\nprint(ans)', 'from collections import defaultdict\nn, *A = map(int, open(0).read().split())\nans, d = 0, defaultdict(int)\nfor i, a in enumerate(A, 1):\n x, y = i+a, i-a\n d[x] += 1\n ans += d[y]\nprint(ans)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s126305378', 's522102143', 's690194693'] | [9404.0, 33020.0, 62252.0] | [27.0, 66.0, 235.0] | [259, 156, 195] |
p02691 | u785578220 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n = int(input())\nfrom collections import defaultdict\na = list(map(int,input().split()))\nans = 0\ndp = defaultdict(int)\nfor e,i in enumerate(a,1):\n if i - e >= 0 :ans += dp[i-e]\n dp[i+e]+=1\nprint(ans)\n', 'n = int(input())\nfrom collections import defaultdict\na = list(map(int,input().split()))\nans = 0\ndp = defaultdict(int)\nfor e,i in enumerate(a,1):\n ans += dp[i-e]\n dp[i+e]+=1\nprint(ans)\n', 'n = int(input())\nfrom collections import defaultdict\na = list(map(int,input().split()))\nans = 0\ndp = defaultdict(int)\nfor e,i in enumerate(a):\n dp[i+e]+=1\n if i - e >= 0 :ans += dp[i-e]\nprint(ans)\n', 'n = int(input())\nfrom collections import defaultdict\na = list(map(int,input().split()))\nans = 0\ndp = defaultdict(int)\nfor e,i in enumerate(a):\n if i - e >= 0 :ans += dp[i-e]\n dp[i+e]+=1\nprint(ans)\n', 'n = int(input())\nfrom collections import defaultdict\na = list(map(int,input().split()))\nans = 0\ndp = defaultdict(int)\nfor e,i in enumerate(a,1):\n if e - i>= 0 :ans += dp[e-i]\n dp[i+e]+=1\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s265889778', 's463495606', 's729395402', 's760187886', 's591195496'] | [40704.0, 61744.0, 40708.0, 40580.0, 40912.0] | [190.0, 234.0, 200.0, 208.0, 192.0] | [205, 190, 203, 203, 205] |
p02691 | u788452182 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n=int(input())\nheights=list(map(int,input().split(" ")))\nfor i in range(n):\n heights[i]-=i\nres=len(heights)-len(set(heights))\nif res==0:\n print(0)\nelse:\n print(res+1)', 'n=int(input())\nheights=list(map(int,input().split(" ")))\nres=0\nfor i in range(n):\n heights[i]-=i\n\nprint(len(set(heights)))', 'n=int(input())\nheights=list(map(int,input().split(" ")))\nfor i in range(n):\n heights[i]-=i\nres=len(heights)-len(set(heights))\nif res==0:\n print(0)\nelse:\n print(res)', 'n=int(input())\nheights=list(map(int,input().split(" ")))\ndic={}\nres=0\nfor i in range(n):\n if heights[i]-i not in dic:\n dic[heights[i]-i]=1\n else:\n dic[heights[i]-i]+=1\nfor j in range(n):\n if -heights[j]-j in dic:\n res+=dic[-heights[j]-j]\nprint(res)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s476614893', 's774406675', 's788964737', 's063011535'] | [32372.0, 32324.0, 32380.0, 40420.0] | [102.0, 104.0, 113.0, 196.0] | [175, 125, 173, 278] |
p02691 | u801049006 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n = int(input())\na = list(map(int, input().split()))\n\nans = 0\ncnt = defaultdict(int)\nfor i in range(n):\n\tans += cnt[i - a[i]]\n\tcnt[i + a[i]] += 1\n\nprint(ans)\n', 'from collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\n\nans = 0\ncnt = defaultdict(int)\nfor i in range(n):\n\tans += cnt[i - a[i]]\n\tcnt[i + a[i]] += 1\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s299925973', 's825999905'] | [32232.0, 61532.0] | [69.0, 231.0] | [158, 195] |
p02691 | u821441703 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['import sys\n\nN = int(sys.stdin.readline().rstrip())\nAs = list(map(int, sys.stdin.readline().rstrip().split()))\n\nll = [0] * N\nlr = [0] * N\nfor i in range(N):\n ll[i] = i + 1 + As[i]\n lr[i] = i + 1 - As[i]\n\nprint(ll, lr)\n\nans = 0\nfor l in ll:\n ans += lr.count(l)\n\nprint(ans)\n', 'import sys\nfrom collections import Counter\n\nN = int(sys.stdin.readline().rstrip())\nAs = list(map(int, sys.stdin.readline().rstrip().split()))\n\nll = [0] * N\nlr = [0] * N\nfor i, a in enumerate(As):\n ll[i] = i + a\n lr[i] = i - a\n\ncl = Counter(ll)\ncr = Counter(lr)\n\nans = 0\nfor l in cl.keys():\n ans += cl[l] * cr[l]\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s148610229', 's720223268'] | [37516.0, 63492.0] | [2213.0, 271.0] | [280, 332] |
p02691 | u824295380 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['\nn=int(input())\na = list(map(int, input().split()))\nan=0\nfor i in range(n-1):\n s=a[i]\n for j in range(s+i+1,n):\n if a[j]==s:\n an+=1\nprint(an)', 'n=int(input())\na = list(map(int, input().split()))\n\nt=[[0]*n for k in range(n)]\ntt=[[0]*n for k in range(n)]\n\ndef search(i,j):\n if i==j or j==n or i==n-1:\n return\n if tt[i][j]==1:\n return\n if j-i==a[i]+a[j]:\n t[i][j]=1\n print(i,j)\n tt[i][j]=1\n\n search(i+1,j)\n search(i,j+1)\nsearch(0,1)\nresult=0\nfor row in t:\n result += sum(row)\n\nprint(result)', 'import collections\nn=int(input())\na = list(map(int, input().split()))\nan=0\nii=[]\njj=[]\nfor i in range(n):\n ii.append(i+a[i])\n jj.append(i-a[i])\njjj=collections.Counter(jj)\nfor i in range(n):\n an+=jjj[ii[i]]\nprint(an)'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s620421387', 's915348795', 's192583770'] | [32208.0, 2668132.0, 50600.0] | [2206.0, 2270.0, 224.0] | [165, 378, 225] |
p02691 | u834471595 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n=int(input())\nl=list(map(int,input().split()))\ncount=0\nd={}\ndef diff(a,b):\n if a>b:\n return(a-b)\n else:\n return(b-a)\nfor i in range(0,len(l)):\n if l[i]>2*10**5:\n pass\n else:\n d[i+1]=l[i]\nl=list(d.keys()):\nfor i in range(0,len(l)):\n for j in range(i+1,len(l)):\n if diff(i,j)==d[j]+d[i]:\n count+=1\nprint(count)\n', 'n=int(input())\nl=list(map(int,input().split()))\ncount=0\nnew=[]\ns=set()\nd={}\nfor i in range(0,len(l)):\n new.append(i+1-l[i])\n s.add(i+1+l[i])\n if i+1+l[i] in d.keys():\n d[i+1+l[i]]+=1\n else:\n d[i+1+l[i]]=1\nfor i in range(0,len(new)):\n if new[i] in s:\n count+=d[new[i]]\nprint(count)'] | ['Runtime Error', 'Accepted'] | ['s050502493', 's375834374'] | [8872.0, 59572.0] | [23.0, 300.0] | [371, 316] |
p02691 | u852210959 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['# -*- coding: utf-8 -*-\n\n\ndef input_int():\n return int(input())\n\n\n\ndef int1(x):\n return int(x) - 1\n\n\n\ndef input_to_int_map():\n return map(int, input().split())\n\n\n\ndef input_to_int_tuple():\n return tuple(map(int, input().split()))\n\n\n\ndef input_to_int_tuple_minus1():\n return tuple(map(int1, input().split()))\n\n\ndef main():\n n = int(input())\n a = input_to_int_tuple()\n\n from collections import defaultdict\n l = defaultdict(0)\n r = defaultdict(0)\n for i, h in enumerate(a):\n no = i + 1\n l[no + h] += 1\n r[no - h] += 1\n\n ret = 0\n for i in range(1, n + 1):\n ret += (l.get(i, 0) * r.get(i, 0))\n\n return ret\n\n\nif __name__ == "__main__":\n print(main())\n', '# -*- coding: utf-8 -*-\n\n\ndef input_int():\n return int(input())\n\n\n\ndef int1(x):\n return int(x) - 1\n\n\n\ndef input_to_int_map():\n return map(int, input().split())\n\n\n\ndef input_to_int_tuple():\n return tuple(map(int, input().split()))\n\n\n\ndef input_to_int_tuple_minus1():\n return tuple(map(int1, input().split()))\n\n\ndef main():\n n = int(input())\n a = input_to_int_tuple()\n\n from collections import defaultdict\n l = defaultdict(int)\n r = defaultdict(int)\n for i, h in enumerate(a):\n no = i + 1\n l[no + h] += 1\n r[no - h] += 1\n\n ret = 0\n for i in range(1, n + 1):\n ret += (l.get(i, 0) * r.get(i, 0))\n\n return ret\n\n\nif __name__ == "__main__":\n print(main())\n'] | ['Runtime Error', 'Accepted'] | ['s226324271', 's923607846'] | [32432.0, 56828.0] | [71.0, 261.0] | [1030, 1034] |
p02691 | u864273141 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n=int(input())\nans=0\na=list(map(int,input().split()))\nnow=max(a)\nnoww=now\nmatc=list(0 for i in range(n+2*now))\nmat2=list(0 for i in range(n+2*now))\nfor i in range(n):\n matc[now-a[i]]+=1\n mat2[now+a[i]]+=1\n now+=1\n#print(matc)\nfor j in range(noww,noww+n+10):\n ans+=matc[j]*mat2[j]\nprint(ans)\n \n \n\n\n', 'import numpy as np\nn=int(input())\nans=0\na=list(map(int,input().split()))\nnow=max(a)\nnoww=now\nk=n+2*now\nmatc=[0]*(n+2)\nmat2=[0]*(n+2)\nfor i in range(n):\n neg=i-a[i]\n pos=i+a[i]\n if neg>=0:\n matc[neg]+=1\n if pos<=n:\n mat2[pos]+=1\n now+=1\n#print(matc)\nfor j in range(n+2):\n ans+=matc[j]*mat2[j]\nprint(ans)\n \n \n\n\n'] | ['Runtime Error', 'Accepted'] | ['s230213409', 's047498376'] | [445776.0, 51032.0] | [2220.0, 289.0] | [313, 333] |
p02691 | u865383026 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['N = int(input())\nA = list(map(int, input().split()))\nprint(len([0 for i in range(N) for j in range(i + A[i], N) if j - 1 == A[i] + A[j]]))', 'N = int(input())\nA = list(map(int, input().split()))\nL = {}\nR = {}\nans = 0\nfor i in range(N):\n t = i + 1 + A[i]\n if t in L:\n L[t] += 1\n else:\n L[t] = 1\n t = i + 1 - A[i]\n if t > 0:\n if t in R:\n R[t] += 1\n else:\n R[t] = 1\nfor i in R:\n if i in L:\n ans += R[i] * L[i]\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s761752494', 's285050335'] | [32368.0, 41876.0] | [2206.0, 210.0] | [138, 306] |
p02691 | u873616440 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['import numpy as np\nN = int(input())\nindex = np.array(list(range(1, N+1)))\nA = np.array(list(map(int, input().split())))\na = index + A\nd = list((index - A))\nans= 0\nc = 1\nfor i in a:\n ans += d[:c].count(i)\n c += 1\nprint(ans)\n', 'import collections\nn=int(input())\ns=list(map(int, input().split()))\nL=[i+a for i,a in enumerate(s)]\nR=[i-a for i,a in enumerate(s)] \nt=collections.Counter(L)\nu=collections.Counter(R)\nans = 0\nfor i in t.keys():\n ans+=t[i]*u[i]\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s360779543', 's722264224'] | [52368.0, 63528.0] | [2207.0, 238.0] | [225, 238] |
p02691 | u878654696 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['from random import randint\n\nn = int(input())\na = list(map(int, input().split()))\n\nlast = {}\nans = 0;\n\nfor _ in range(10**7):\n x = randint(0, n-1)\n y = randint(0, n-1)\n if abs(x-y) == a[x]+a[y] and last.get((x, y), "Hola") == "Hola":\n ans += 1;\n last[(x, y)] = 1;\n last[(y, x)] = 1;\n\nprint(ans)\n', 'from random import randint\n\nn = int(input())\na = list(map(int, input().split()))\n\nlast = {}\nans = 0;\n\nfor _ in range(10**8):\n x = randint(0, n-1)\n y = randint(0, n-1)\n if abs(x-y) == a[x]+a[y] and last.get((x, y), "Hola") == "Hola":\n ans += 1;\n last[(x, y)] = 1;\n last[(y, x)] = 1;\n\nprint(ans)\n', 'from random import randint\n\nn = int(input())\na = list(map(int, input().split()))\n\nlast = {}\nans = 0;\n\nfor _ in range(10**9):\n x = randint(0, n-1)\n y = randint(0, n-1)\n if abs(x-y) == a[x]+a[y] and last.get((x, y), "Hola") == "Hola":\n ans += 1;\n last[(x, y)] = 1;\n last[(y, x)] = 1;\n\nprint(ans)\n', 'n = int(input())\na = list(map(int, input().split()))\n\nx = []\ny = {}\n\nfor i, elem in enumerate(a):\n x.append(i+a[i])\n y[i-a[i]] = y.get(i-a[i], 0) + 1\n\nans = 0\n\nfor i in x:\n ans += y.get(i, 0)\n\nprint(ans)\n'] | ['Time Limit Exceeded', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Accepted'] | ['s165761622', 's535557693', 's865917457', 's135584301'] | [147836.0, 147832.0, 147840.0, 46164.0] | [2210.0, 2211.0, 2210.0, 239.0] | [324, 324, 324, 213] |
p02691 | u897940702 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['x = int(input())\n\nfor a in range(-117, 120):\n for b in range(-117, 200):\n if x == a**5 - b**5:\n print(a, b)\n break\n', 'x = int(input())\n\nfor a in range(-117, 120):\n for b in range(-117, 120):\n if x == a**5 - b**5:\n print(a, b)\n break\n else:\n continue\n break', 'N = int(input())\ndic = {}\nans = 0\n\nfor i, j in enumerate(input().split()):\n ind = int(i) + 1\n tall = int(j)\n\n delta = ind - tall\n\n ans += dic.get(delta, 0) \n\n addKey = ind + tall\n\n dic[addKey] = dic.get(addKey, 0) + 1\n\nprint(ans)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s716666578', 's900647526', 's437070776'] | [9180.0, 9104.0, 46408.0] | [59.0, 49.0, 216.0] | [147, 183, 266] |
p02691 | u906501980 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['from bisect import bisect_left, bisect, insort\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n h_plus_i = [ai+i for i, ai in enumerate(a, 1)]\n h_minus_i = [ai-i for i, ai in enumerate(a, 1)]\n s_h_plus_i = list(sorted(h_plus_i))\n s_h_minus_i = list(sorted(h_minus_i))\n ans = 0\n for hpi, hmi in zip(h_plus_i, h_minus_i):\n i1 = bisect_left(s_h_minus_i, -hpi)\n i2 = bisect_left(s_h_plus_i, -hmi)\n if (i1 < n and s_h_minus_i[i1] == -hpi) or (i2 < n and s_h_plus_i[i2] == -hmi):\n ans += 1\n print(ans)\n\nif __name__ == "__main__":\n main()', 'from bisect import bisect_left, bisect, insort\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n h_plus_i = [ai+i for i, ai in enumerate(a, 1)]\n h_minus_i = [ai-i for i, ai in enumerate(a, 1)]\n s_h_plus_i = list(sorted(h_plus_i))\n s_h_minus_i = list(sorted(h_minus_i))\n ans = 0\n for hpi, hmi in zip(h_plus_i, h_minus_i):\n i1 = bisect_left(s_h_minus_i, -hpi)\n i2 = bisect_left(s_h_plus_i, -hmi)\n if (i1 < n and s_h_minus_i[i1] == -hpi):\n ans += bisect_left(s_h_minus_i, -hpi+1)-i1\n elif (i2 < n and s_h_plus_i[i2] == -hmi):\n ans += bisect_left(s_h_plus_i, -hmi+1)-i2\n \n print(ans//2)\n\nif __name__ == "__main__":\n main()\n', 'from bisect import bisect_left, bisect, insort\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n h_plus_i = [ai+i for i, ai in enumerate(a, 1)]\n h_minus_i = [ai-i for i, ai in enumerate(a, 1)]\n s_h_plus_i = list(sorted(h_plus_i))\n s_h_minus_i = list(sorted(h_minus_i))\n ans = 0\n for hpi, hmi in zip(h_plus_i, h_minus_i):\n i1 = bisect_left(s_h_minus_i, -hpi)\n i2 = bisect_left(s_h_plus_i, -hmi)\n if (i1 < n and s_h_minus_i[i1] == -hpi):\n ans += bisect_left(s_h_minus_i, -hpi+1)-i1\n if (i2 < n and s_h_plus_i[i2] == -hmi):\n ans += bisect_left(s_h_plus_i, -hmi+1)-i2\n \n print(ans//2)\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s324987394', 's400800950', 's816602023'] | [37348.0, 37320.0, 37256.0] | [443.0, 456.0, 443.0] | [613, 729, 727] |
p02691 | u909514237 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['N = int(input())\nhList = list(map(int, input().split()))\ncount = 0\nnList = [ i + hList[i] for i in range(len(hList))]\n\nfor i in range(N):\n tmpVal = i - hList[i]\n if tmpVal < 2:\n continue\n count += nList[i-tmpVal:i+1].count(tmpVal)\n\nprint(count)', 'import collections\n\nN = int(input())\nhList = list(map(int, input().split()))\ncount = 0\nn_p = collections.Counter([ i + hList[i] for i in range(len(hList))])\n\nfor i in range(N):\n if i - hList[i] > 0:\n count += n_p.get(i - hList[i], 0)\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s033383637', 's186078208'] | [32292.0, 42812.0] | [2206.0, 163.0] | [250, 251] |
p02691 | u946404093 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['N = int(input())\nA = input().split()\n\npear = 0\n\nfor i in range(N, 1, -1):\n for j in range(i):\n if int(A[i]) >= (i - j):\n break\n if (i - j) == (int(A[i]) + int(A[j])):\n pear += 1\n \nprint(pear)\n ', 'N = int(input())\nA = input().split()\n\npear = 0\n\ni_result = {}\nj_result = {}\n\nfor i in range(N):\n result = str(i + int(A[i]))\n if result in i_result:\n i_result[result] += 1\n else:\n i_result[result] = 1\n\nfor j in range(N):\n result = str(j - int(A[j]))\n if result in j_result:\n j_result[result] += 1\n else:\n j_result[result] = 1\n\nfor k in i_result.keys():\n if k in j_result:\n pear += (i_result[k] * j_result[k])\n \n \nprint(pear)'] | ['Runtime Error', 'Accepted'] | ['s294105343', 's286733443'] | [24804.0, 77028.0] | [39.0, 356.0] | [216, 456] |
p02691 | u966542724 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ["n = int(input())\na = input().split()\npl = []\nsb = []\nfor i in range(len(a)):\n\tpl.append(i+int(a[i])+1)\n\tif i - int(a[i]) > 1:\n\t\tsb.append(i-int(a[i])+1)\n\n\nif len(sb) == 0:\n\tprint('0')\nelse:\n\n\n\tisb = [int(i) for i in sb]\n\tipl = [int(i) for i in pl]\n\tssb = sorted(isb)\n\tt = min(ssb)\n\t# tl = [0] * max(ipl)\n\ttl = [0] * 9999999999999\n\tfor i in ssb:\n\t\tif int(i)-1 < len(tl):\n\t\t\ttl[int(i)-1] += 1\n\t# print(pl)\n\t# print(sb)\n\t# print(tl)\n\tcnt = 0\n\tfor i in pl:\n\t\tif int(i)-1 < len(tl):\n\t\t\tcnt += tl[int(i)-1]\n\n\tprint(cnt)\n\t\n\n", "n = int(input())\na = input().split()\npl = []\nsb = []\nfor i in range(len(a)):\n\tpl.append(i+int(a[i])+1)\n\tif i - int(a[i]) > 1:\n\t\tsb.append(i-int(a[i])+1)\n\n\nif len(sb) == 0:\n\tprint('0')\nelse:\n\n\n\tisb = [int(i) for i in sb]\n\tipl = [int(i) for i in pl]\n\tssb = sorted(isb)\n\tt = min(ssb)\n\t# tl = [0] * max(ipl)\n\ttl = [0] * 2000000\n\tfor i in ssb:\n\t\tif int(i)-1 < len(tl):\n\t\t\ttl[int(i)-1] += 1\n\tprint(pl)\n\tprint(sb)\n\tprint(tl)\n\tcnt = 0\n\tfor i in pl:\n\t\tif int(i)-1 < len(tl):\n\t\t\tcnt += tl[int(i)-1]\n\n\tprint(cnt)\n\t\n\n", "n = int(input())\na = input().split()\npl = []\nsb = []\nfor i in range(len(a)):\n\tpl.append(i+int(a[i])+1)\n\tif i - int(a[i]) > 0:\n\t\tsb.append(i-int(a[i])+1)\n\n\nif len(sb) == 0:\n\tprint('0')\nelse:\n\n\n\tisb = [int(i) for i in sb]\n\tipl = [int(i) for i in pl]\n\tssb = sorted(isb)\n\tt = min(ssb)\n\t# tl = [0] * max(ipl)\n\ttl = [0] * 2000000\t\n\tfor i in ssb:\n\t\tif int(i)-1 < len(tl):\n\t\t\ttl[int(i)-1] += 1\n\t# print(pl)\n\t# print(sb)\n\t# print(tl)\n\tcnt = 0\n\tfor i in pl:\n\t\tif int(i)-1 < len(tl):\n\t\t\tcnt += tl[int(i)-1]\n\n\tprint(cnt)\n\t\n\n"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s550852221', 's615545345', 's630076760'] | [43140.0, 74688.0, 59624.0] | [286.0, 632.0, 451.0] | [535, 523, 530] |
p02691 | u970133396 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n = int(input().strip())\nL = list(map(int, input().strip().split()))\nseen=set()\nans=0\nfor j in range(n):\n if j-L[j] in seen:\n ans+=1\n seen.add(A[j]+j)\nprint(ans)\n', 'from collections import Counter\nn = int(input().strip())\nL = list(map(int, input().strip().split()))\nseen=Counter()\nans=0\nfor j in range(n):\n # if j-L[j] in seen:\n ans+=seen[j-L[j]]\n seen[L[j]+j]+=1\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s028366582', 's667216361'] | [32284.0, 40636.0] | [64.0, 234.0] | [175, 218] |
p02691 | u970308980 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['\nsi = lambda: input().strip()\nii = lambda: int(input())\nmii = lambda: map(int, input().split())\nmsi = lambda: map(str, input().split())\nlmii = lambda: list(map(int, input().split()))\nlmsi = lambda: list(map(str, input().split()))\nsmii = lambda: sorted(map(int, input().split()))\n\n\n# ----------\n\nN = ii()\nA = lmii()\n\nbd = defaultdict(int)\nac = defaultdict(int)\nfor i in range(N):\n a = b = i + 1\n c = d = A[i]\n bd[b-d] += 1\n ac[a+c] += 1\n\nans = 0\nfor k, v in bd.items():\n ans += v * ac[k]\n\nprint(ans)\n', '\nimport heapq\nfrom collections import defaultdict, deque\nfrom math import ceil, factorial, gcd\nfrom itertools import accumulate, permutations\nimport sys\nimport bisect\n\n\nsys.setrecursionlimit(10 ** 7)\nINF = float("inf")\nMOD = 10 ** 9 + 7\n\nsi = lambda: input().strip()\nii = lambda: int(input())\nmii = lambda: map(int, input().split())\nmsi = lambda: map(str, input().split())\nlmii = lambda: list(map(int, input().split()))\nlmsi = lambda: list(map(str, input().split()))\nsmii = lambda: sorted(map(int, input().split()))\n\n\n# ----------\n\nN = ii()\nA = lmii()\n\nbd = defaultdict(int)\nac = defaultdict(int)\nfor i in range(N):\n a = b = i + 1\n c = d = A[i]\n bd[b-d] += 1\n ac[a+c] += 1\n\nans = 0\nfor k, v in bd.items():\n ans += v * ac[k]\n\nprint(ans)\n'] | ['Runtime Error', 'Accepted'] | ['s672354921', 's394489452'] | [32376.0, 70600.0] | [63.0, 329.0] | [514, 751] |
p02691 | u970737570 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['n = int(input())\na = list(map(int,input().split()))\nb = [0]*n\nfor i in range(n):\n b[i]= i-a[0]-a[i]\nd = defaultdict(int)\nfor i in range(1,n):\n d[b[i]] += 1\nans = 0\nx = 0\nfor i in range(n-1):\n ans+=d[x]\n d[b[i+1]]-=1\n x -= -1+(a[i]-a[i+1])\nprint(ans)', 'from collections import defaultdict\nn = int(input())\na = list(map(int,input().split()))\nb = [0]*n\nfor i in range(n):\n b[i]= i-a[0]-a[i]\nd = defaultdict(int)\nfor i in range(1,n):\n d[b[i]] += 1\nans = 0\nx = 0\nfor i in range(n-1):\n ans+=d[x]\n d[b[i+1]]-=1\n x -= -1+(a[i]-a[i+1])\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s590037032', 's862279402'] | [32376.0, 63160.0] | [106.0, 347.0] | [264, 300] |
p02691 | u971124021 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['\nni = np.array([i for i in range(n)])\n\nap = a + ni\nan = (a - ni) * -1\nan.sort()\nans = 0\nfor j in an[::-1]:\n if j <= 0:break\n for i in ap:\n if j == i:\n ans += 1\n\nprint(ans)', 'import numpy as np\nfrom collections import Counter\nn = int(input())\na = np.array(list(map(int, input().split())))\nni = np.array([i for i in range(n)])\n\nap = a + ni\nan = (a - ni) * -1\n\ncp = Counter(ap)\ncn = Counter(an)\n\nans = 0\nfor i in cp.keys():\n ans += cp[i] * cn[i] \n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s746282002', 's295438103'] | [9104.0, 75988.0] | [25.0, 370.0] | [181, 282] |
p02691 | u973108807 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['import collections\n\ninput()\np = list(map(int, input().split()))\nmap1 = collections.defualtdict(lambda:0)\nmap2 = collections.defaultdict(lambda:0)\n\nfor i, v in enumerate(p):\n map1[i+v] += 1\n map2[i-v] += 1\n\nans = 0\nfor i in map1:\n if i in map2:\n ans += map2[i]\nprint(i)', 'import collections\n \ninput()\np = list(map(int, input().split()))\nmap1 = collections.defaultdict(lambda:0)\nmap2 = collections.defaultdict(lambda:0)\n \nfor i, v in enumerate(p):\n map1[i+v] += 1\n map2[i-v] += 1\n\nans = 0\nfor i in map1:\n if i in map2:\n ans += map1[i] * map2[i]\n\nprint(ans)'] | ['Runtime Error', 'Accepted'] | ['s819816655', 's110882015'] | [33640.0, 57656.0] | [71.0, 252.0] | [274, 289] |
p02691 | u984276646 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['N = int(input())\n\nA = list(map(int, input().split()))\nS = [-A[i] for i in range(N)]\n\nD = {}\nfor i in range(N):\n if A[i] in D:\n D[A[i]][0] += 1\n else:\n D[A[i]] = [1, 0]\n if S[i] in D:\n D[S[i]][1] += 1\n else:\n D[S[i]] = [0, 1]\ncnt = 0\nfor i in D:\n cnt += D[i][0] * D[i][1]\nprint(cnt)', 'N = int(input())\n\nA = list(map(int, input().split()))\nS = [-A[i] for i in range(N)]\n\nfor i in range(N):\n A[i] += i\n S[i] += i\nD = {}\nfor i in range(N):\n if A[i] in D:\n D[A[i]][0] += 1\n else:\n D[A[i]] = [1, 0]\n if S[i] in D:\n D[S[i]][1] += 1\n else:\n D[S[i]] = [0, 1]\ncnt = 0\nfor i in D:\n cnt += D[i][0] * D[i][1]\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s342328891', 's905114947'] | [85704.0, 85612.0] | [493.0, 535.0] | [324, 371] |
p02691 | u991619971 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['from collections import Counter\n#K = int(input())\n#N,K = map(int,input().split())\nN = int(input())\nA = list(map(int,input().split()))\nc=0\nl=[]\nr=[]\nfor i in range(N):\n l.append(A[i]+i+1)\n r.append(i+1-A[i])\n\nC=Counter(r)\nprint(l,r,C)\nfor x in l:\n c+=C.get(x,0)\nprint(c)\n', 'from collections import Counter\n#K = int(input())\n#N,K = map(int,input().split())\nN = int(input())\nA = list(map(int,input().split()))\nc=0\nl=[]\nr=[]\nfor i in range(N):\n l.append(A[i]+i+1)\n r.append(i+1-A[i])\n\nC=Counter(r)\n\nfor x in l:\n c+=C.get(x,0)\nprint(c)\n'] | ['Wrong Answer', 'Accepted'] | ['s726483188', 's915613944'] | [71620.0, 50608.0] | [374.0, 202.0] | [279, 267] |
p02691 | u994521204 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['from collections import defaultdict\n\nn = int(input())\nA = list(map(int, input().split()))\nB = [0] * (n)\nC = [0] * (n)\nkouho = defaultdict(int)\nans = 0\nfor i in range(n):\n kouho[A[i] - i] += 1\n ans += kouho[A[i] + i]\nprint(ans)\n', 'from collections import defaultdict\n\nn = int(input())\nA = list(map(int, input().split()))\n\nkouho = defaultdict(int)\nans = 0\nfor i in range(n):\n kouho[A[i] + (i + 1)] += 1\n ans += kouho[(i + 1) - A[i]]\n\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s838379127', 's980981080'] | [64368.0, 61592.0] | [255.0, 245.0] | [233, 219] |
p02691 | u994935583 | 2,000 | 1,048,576 | You are the top spy of AtCoder Kingdom. To prevent the stolen secret from being handed to AlDebaran Kingdom, you have sneaked into the party where the transaction happens. There are N attendees in the party, and they are given attendee numbers from 1 through N. The height of Attendee i is A_i. According to an examination beforehand, you know that a pair of attendees satisfying the condition below will make the transaction. * The absolute difference of their attendee numbers is equal to the sum of their heights. There are \frac{N(N-1)}{2} ways to choose two from the N attendees and make a pair. Among them, how many satisfy the condition above? P.S.: We cannot let you know the secret. | ['\n\n\nfrom collections import defaultdict\niim = lambda: map(int, input().rstrip().split())\n \ndef resolve():\n N = int(input())\n A = list(iim())\n\n ans = 0\n dp = [0]*N\n for i, ai in enumerate(A):\n x = i + ai\n if x < N:\n dp[x] += 1\n print(i)\n print("h1")\n print(dp)\n x = i - ai\n if x >= 0:\n ans += dp[x]\n print("h2")\n\n print(ans)\nresolve()', 'from collections import defaultdict\niim = lambda: map(int, input().rstrip().split())\n \ndef resolve():\n N = int(input())\n A = list(iim())\n ans = 0\n dp = [0]*N\n for i, ai in enumerate(A):\n x = i + ai\n if x < N:\n dp[x] += 1\n x = i - ai\n if x >= 0:\n ans += dp[x]\n print(ans)\nresolve()'] | ['Wrong Answer', 'Accepted'] | ['s966148339', 's346289351'] | [143996.0, 33904.0] | [2426.0, 111.0] | [507, 348] |
p02693 | u000579017 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA,B = map(int,input().split(" "))\nn=0\ns=\'NG\'\nwhile(n>B):\n n+=k\n if A<=n and n<=B:\n s=\'OK\'\nprint(s)', 'K = int(input())\nA,B = map(int,input().split(" "))\nn=0\ns=\'NG\'\nfor k in range(K):\n n+=k\n if A<=n and n<=B:\n s=\'OK\'\nprint(s)', 'K = int(input())\nA,B = map(int,input().split(" "))\nn=0\ns=\'NG\'\nwhile():\n n+=k\n if A<=n and n<=B:\n s=\'OK\'\nprint(s)', 'K = int(input())\nA,B = map(int,input().split(" "))\nn=0\ns=\'NG\'\nwhile(n<=B):\n n+=K\n if A<=n and n<=B:\n s=\'OK\'\nprint(s)'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s408143908', 's422620930', 's536868759', 's764353467'] | [9160.0, 9164.0, 9160.0, 9164.0] | [23.0, 19.0, 22.0, 22.0] | [128, 135, 125, 129] |
p02693 | u000698877 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K=int(input())\nA,B=map(int,input().split())\nans="NG"\n\nfor i in range(1,B//K+1):\n if A<=i*K and i*K<=B:\n ans="YES"\n break\n\nprint(ans)', 'K=int(input())\nA,B=map(int,input().split())\nans="NG"\n\nfor i in range(1001):\n if A<=i*K and i*K<=B:\n ans="YES"\n break\n\nprint(ans)', 'K=int(input())\nA,B=map(int,input().split())\nans="NG"\n\nfor i in range(1001):\n if A<=i*K and i*K<=B:\n ans="OK"\n break\n\nprint(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s272039287', 's826192496', 's815551264'] | [9176.0, 9156.0, 9160.0] | [22.0, 23.0, 20.0] | [139, 135, 134] |
p02693 | u003855259 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K=()\nA=()\nB=()\n\nK=int(input(""))\nA, B = map(int, input().split())\nV=False\nC=K \n\nfor i in range(0,B):\n K=C*i\n print(K)\n if K>=A and K<=B:\n V=True\n break\n else:\n V=False\n\nif V==True:\n print("OK")\nelse:\n print("NG")', 'K=()\nA=()\nB=()\n\nK=int(input(""))\nA, B = map(int, input().split())\nV=False\nC=K\nD=B+2\n\nfor i in range(0,D):\n K=C*i\n print(K)\n if K>=A and K<=B:\n V=True\n break\n else:\n V=False\n\nif V==True:\n print("OK")\nelse:\n print("NG")', 'K=()\nA=()\nB=()\n\nK=int(input(""))\nA, B = map(int, input().split())\nV=False\nC=K\nD=B+1\n\nfor i in range(0,D):\n K=C*i\n if K>=A and K<=B:\n V=True\n break\n else:\n V=False\n\nif V==True:\n print("OK")\nelse:\n print("NG")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s376901883', 's906963877', 's819638060'] | [9196.0, 9196.0, 9128.0] | [24.0, 20.0, 24.0] | [275, 280, 265] |
p02693 | u004823354 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\na,b = map(int,input().split())\nfor n in range(a,b):\n if n%K == 0:\n print("OK")\n else:\n print("NG")', 'k = int(input())\na,b = map(int,input().split())\nif a % k != 0 and b % k != 0 and a//k == b//k:\n print("No")\nelse:\n print("Yes")', 'k = int(input())\na,b = map(int,input().split())\nif a % k != 0 and b % k != 0 and a//k == b//k:\n print("NG")\nelse:\n print("OK")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s879367966', 's937703885', 's624167301'] | [9056.0, 9072.0, 9036.0] | [27.0, 28.0, 25.0] | [123, 129, 128] |
p02693 | u005317312 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['A,B,N = map(int,input().split())\ntmp=0\nfor i in range(N//2,N+1):\n floor = (A*i)//B-A*(i//B)\n if floor>tmp:\n tmp = floor\nprint(tmp)', 'K=int(input())\nA,B=map(int,input().split())\nfor i in range(A,B+1):\n if i%K==0:\n print("OK")\n break\n elif i%K!=0 and i==B:\n print("NG")'] | ['Runtime Error', 'Accepted'] | ['s683034608', 's380501622'] | [9176.0, 9164.0] | [20.0, 22.0] | [143, 161] |
p02693 | u005318559 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split()) \n\nfor x in range(A, B):\n if x % K == 0 or K % x == 0:\n print('OK')\n break\n else:\n print('NG')", "K = int(input())\nA, B = map(int, input().split())\n\nif B//K * K >= A:\n print('OK')\nelse:\n print('NG')"] | ['Wrong Answer', 'Accepted'] | ['s958616448', 's753825927'] | [9172.0, 9160.0] | [23.0, 23.0] | [154, 106] |
p02693 | u007637377 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split())\n\nif ((A // K != B // K) || A % K == 0 || B % K == 0):\n\tprint('OK')\nelse:\n\tprint('NG')\n", "K = int(input())\nA, B = map(int, input().split())\n\nif ((A // K != B // K) or A % K == 0 or B % K == 0):\n\tprint('OK')\nelse:\n\tprint('NG')\n"] | ['Runtime Error', 'Accepted'] | ['s247173311', 's396268183'] | [8908.0, 9112.0] | [24.0, 21.0] | [136, 136] |
p02693 | u008382444 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA, B = map(int, input().split())\n\na = 0\n\nfor i in range(A, B+1):\n if i%K == 0:\n a+=1\n else:\n pass\nif a != 0:\n print("Yes")\nelse:\n print("No")\n\n', 'K = int(input())\nA, B = map(int, input().split())\n\na = int(A/K)\nb = int(B/K)\n\nif K == 1:\n print("Yes")\nelse:\n if a == b:\n print("NG")\n else:\n print("Yes")\n', 'K = int(input())\nA, B = map(int, input().split())\n\na = A/K\nb = B/K\n\nif A%K == 0 or B%K == 0:\n print("Yes")\nelse:\n if a == b:\n print("NG")\n else:\n print("Yes")\n', 'K = int(input())\nA, B = map(int, input().split())\n\na = 0\n\nfor i in range(A, B+1):\n if i%K == 0:\n a+=1\n else:\n pass\nif a != 0:\n print("Yes")\nelse:\n print("NG")\n\n', 'K = int(input())\nA, B = map(int, input().split())\n\na = int(A/K)\nb = int(B/K)\n\nif a == b:\n print("NG")\nelse:\n print("Yes")', 'K = int(input())\nA, B = map(int, input().split())\n\na = 0\n\nfor i in range(A, B+1):\n if i%K == 0:\n a+=1\n else:\n pass\nif a != 0:\n print("OK")\nelse:\n print("NG")\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067799872', 's303313863', 's703889289', 's841564371', 's990204643', 's033918705'] | [9100.0, 9164.0, 9172.0, 9172.0, 9152.0, 9156.0] | [19.0, 24.0, 21.0, 22.0, 20.0, 25.0] | [170, 164, 168, 170, 123, 169] |
p02693 | u011202375 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['X=int(input())\nc=0\ni=100\nfor a in range(100000000000000000):\n c+=1\n i=int(100*i*1.01/100)\n if i >=X:\n print(c)\n break\n ', 'K=int(input())\nA,B=map(int,input().split())\nC=int(B/K)\ni=0\nfor a in range(C+1):\n i=i+K\n if i>=A and i<=B:\n print("OK")\n break\n if i>B:\n print("NG")\n \n'] | ['Wrong Answer', 'Accepted'] | ['s128402326', 's850741932'] | [9128.0, 9084.0] | [26.0, 28.0] | [149, 187] |
p02693 | u011277545 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['import sys\nK=int(input())\nA,B=map(int, input().split())\n\nif A==B:\n if A%K==0:\n print("OK")\n sys.exit()\nelse:\n for i in range(A,B+1):\n print(i)\n if i%K==0:\n print("OK")\n sys.exit()\nprint("NG")\n', 'import sys\nK=int(input())\nA,B=map(int, input().split())\n\nif A==B:\n if A%K==0:\n print("OK")\n sys.exit()\n else:\n for i in range(A,B):\n if i%K==0:\n print("OK")\n sys.exit()\nprint("NG")\n', '#1\nimport sys\nK=int(input())\nA,B=map(int, input().split())\n\nif A==B:\n if A%K==0:\n print("OK")\n sys.exit()\nelse:\n for i in range(A,B+1):\n if i%K==0:\n print("OK")\n sys.exit()\nprint("NG")\n '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s082558413', 's138370024', 's405950298'] | [8904.0, 9156.0, 9160.0] | [23.0, 22.0, 25.0] | [248, 249, 242] |
p02693 | u014139588 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['X = int(input())\nn = 1\n\nwhile int(100*(1.01**n)) < X:\n n += 1\nelse: print(n)\n ', 'X = int(input())\nn = 0\nN = 100\nwhile int(N) < X:\n N =int(N*1.01)\n n += 1\nelse: print(n)', 'X = int(input())\nn = 1\nN = 100\nwhile int(N) < X:\n N =int(N*1.01)\n n += 1\nelse: print(n)', "K = int(input())\nA,B = map(int,input().split())\nfor n in range(A,B+1):\n if n % K == 0:\n print('OK')\n break\n if n == B:\n if n % K != 0:\n print('NG')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s497782896', 's901093034', 's977028144', 's190173304'] | [9404.0, 9168.0, 9148.0, 9172.0] | [22.0, 22.0, 23.0, 23.0] | [84, 93, 93, 185] |
p02693 | u015845133 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = input()\na, b = map(int,input().split())\n\nif k*4 >= a:\n if k*4 <= b:\n print("OK")\n else:\n print("NG")\n\nelse:\n print("NG")\n ', 'k = int(input())\na, b = map(int,input().split())\n\nflug = 0\n\nA = list(range(a, b+1))\n\nfor number in A:\n if number % k == 0:\n flug = 1\n \n else:\n continue\n\nif flug == 1:\n print("OK")\nelse:\n print("NG")\n'] | ['Runtime Error', 'Accepted'] | ['s267166271', 's225864249'] | [9068.0, 9108.0] | [21.0, 24.0] | [152, 232] |
p02693 | u017624958 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["from math import floor\n\nK = int(input())\nA, B = list(map(int, input().split()))\n\n\n\n# answer = 'NG'\n# for number in range(A, B + 1):\n# if number % K ==0:\n# answer = 'OK'\n# break\n\n\ngreatest_divisor = floor(B / K) * K\nanswer = 'OK' if greatest_divisor * K <= A else 'NG'\n\nprint(answer)\n", "from math import floor\n\nK = int(input())\nA, B = list(map(int, input().split()))\n\n\n\n# answer = 'NG'\n# for number in range(A, B + 1):\n# if number % K ==0:\n# answer = 'OK'\n# break\n\n\ngreatest_multiple = floor(B / K) * K\nanswer = 'OK' if A <= greatest_multiple else 'NG'\n\nprint(answer)\n"] | ['Wrong Answer', 'Accepted'] | ['s071729912', 's556826537'] | [9064.0, 9148.0] | [24.0, 23.0] | [337, 335] |
p02693 | u018597853 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA,B = map(int,input().split())\nfor i in range(A,B+1):\n if i % K == 0:\n print("Yes")\n break\nelse:\n print("No") ', 'K = int(input())\nA,B = map(int,input().split())\nfor i in range(A,B+1):\n if i % K == 0:\n print("OK")\n break\nelse:\n print("NG") \n\n'] | ['Wrong Answer', 'Accepted'] | ['s385124565', 's783099033'] | [9168.0, 9164.0] | [23.0, 19.0] | [148, 149] |
p02693 | u018984506 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na,b = map(int, input().split())\nn=k\n\nwhile k >= a:\n k += n\n\nif a <=k and k <=b:\n print("OK")\nelse:\n print("NG")', 'k = int(input())\na,b = map(int, input().split())\nn=k\n\nwhile k < a:\n k += n\nprint(k)\n\nif k <=b:\n print("OK")\nelse:\n print("NG")', 'k = int(input())\na,b = map(int, input().split())\nn=k\n\nwhile k < a:\n k += n\n\nif k <=b:\n print("OK")\nelse:\n print("NG")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s429402039', 's536654875', 's298335253'] | [9100.0, 9168.0, 9160.0] | [2206.0, 23.0, 23.0] | [137, 135, 127] |
p02693 | u019075898 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = input()\nA, B = [int(a) for a in input().split()]\np = A // K + K\nif A < p and B < p:\n print("OK")\nelse:\n print("NG")', 'K = int(input())\nA, B = [int(a) for a in input().split()]\np = (A // K) * K\nif (A <= p and p <= B) or (A <= p + K and p + K <= B):\n print("OK")\nelse:\n print("NG")'] | ['Runtime Error', 'Accepted'] | ['s238346456', 's600230269'] | [9164.0, 9116.0] | [22.0, 22.0] | [125, 167] |
p02693 | u021217230 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k=int(input())\na,b=map(int,input().split())\nfor i in range(a,b+1):\n if i%k==0:\n print("OK")\n \tbreak\nelse:\n print("NG")', 'k=int(input())\na,b=map(int,input().split())\nfor i in range(a,b+1):\n if i%k==0:\n print("OK")\n break\nelse:\n print("NG")\n'] | ['Runtime Error', 'Accepted'] | ['s540167389', 's466571278'] | [9024.0, 9160.0] | [19.0, 23.0] | [125, 126] |
p02693 | u021387650 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA,B = map(int,input().split())\n\nfor i in (A,B):\n if (i % K) == 0:\n print('OK')\n exit()\n\nprint('NG')", "K = int(input())\nA,B = map(int,input().split())\n \nfor i in range(A,B+1):\n if (i % K) == 0:\n print('OK')\n exit()\n \nprint('NG')"] | ['Wrong Answer', 'Accepted'] | ['s676289496', 's959229123'] | [9104.0, 9140.0] | [21.0, 25.0] | [123, 132] |
p02693 | u023100857 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['a, b, n = map(int, input().split())\nf = max(n, b-1)\n\nprint((a*f)//b -a*(f//b))', "k = int(input())\na, b = map(int, input().split())\nflag = 0\nfor i in range(a, b+1):\n if i%k == 0:\n flag = 1\n break\nif flag == 0:\n print('NG')\nelse:\n print('OK')"] | ['Runtime Error', 'Accepted'] | ['s508262427', 's466227306'] | [9104.0, 9172.0] | [21.0, 21.0] | [78, 182] |
p02693 | u023762741 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['N = int(input())\n\ninput_line = input()\nLine = input_line.split()\nLine = [int(s) for s in Line]\n\n\n\nif Line[1]-Line[0] < N:\n print("No")\nelse:\n print("Yes")', 'import sys\nN = int(input())\n \ninput_line = input()\nLine = input_line.split()\nLine = [int(s) for s in Line]\n\nfor i in range(Line[0],Line[1]+1):\n # print(i)\n if i % N == 0:\n print("OK")\n sys.exit()\nprint("NG")'] | ['Wrong Answer', 'Accepted'] | ['s172268560', 's954793123'] | [9168.0, 9184.0] | [21.0, 21.0] | [160, 227] |
p02693 | u026155812 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["import sys\nK = int(input())\na, b = map(int, input().split())\nfor i in range(a, b+1):\n if i%K == 0:\n print('Yes')\n sys.exit()\nprint('No')\n", "import sys\nK = int(input())\na, b = map(int, input().split())\nfor i in range(a, b+1):\n if i%K 0:\n print('Yes')\n sys.exit()\nprint('No')", "import sys\nK = int(input())\na, b = map(int, input().split())\nfor i in range(a, b+1):\n if i%K == 0:\n print('OK')\n sys.exit()\nprint('NG')\n"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s014690431', 's748417449', 's941473108'] | [9140.0, 8972.0, 9096.0] | [24.0, 23.0, 27.0] | [144, 141, 143] |
p02693 | u030278108 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input)\nA, B = map(int, input().split())\n\nfor i range (A, B+1):\n if i % K == 0:\n print("OK")\n break\n\nprint("NG")', 'K = int(input())\nA, B = map(int, input().split())\nC = 0\n\nfor i in range(A,B+1):\n if i%K == 0:\n C += 1\n break\n\n\nif C == 1:\n print("OK")\nelse:\n print("NG")'] | ['Runtime Error', 'Accepted'] | ['s510413194', 's003286487'] | [9016.0, 9172.0] | [20.0, 23.0] | [126, 176] |
p02693 | u031115006 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K=int(input())\nA, B = map(int, input().split())\na=A//K\nb=A%K\nc=B%K\n\nif(b==0 or c==0):\n print("OK")\nelse:\n if(1<a):\n if(a*K<=B):\n print("OK")\n else:\n print("NG")\n else:\n print("NG")\n~ ', 'K=int(input())\nA, B = map(int, input().split())\na=A//K\nb=A%K\nc=B%K\n\nif(b==0 or c==0):\n print("OK")\nelse:\n if(1<a):\n if(a*K<=B):\n print("OK")\n else:\n print("NG")\n else:\n print("NG")'] | ['Runtime Error', 'Accepted'] | ['s927156238', 's269451703'] | [9048.0, 9180.0] | [20.0, 21.0] | [222, 202] |
p02693 | u032955959 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["k=int(input())\na,b=int(input().split())\n\nif b-a>=k-1:\n print('OK')\nelse:\n print('NG')", "k=int(input())\na,b=map(int,input().split())\n\ni=0\n\nwhile True:\n if (a+i)%k==0:\n print('OK')\n break\n \n if a+i==b:\n print('NG')\n break\n \n i+=1"] | ['Runtime Error', 'Accepted'] | ['s365098528', 's325224577'] | [9160.0, 9164.0] | [26.0, 22.0] | [87, 157] |
p02693 | u033360495 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA,B = map(int, input().split())\nN = int(1000 / K) + 1\n\nOK = False\n\nfor n in range(1,N):\n print('{} {}'.format(int(A/n)+1, int(B/n)+1))\n if int(A/n) <= K and K <= int(B/n):\n OK = True\n \nif OK == True:\n print('OK')\nelse:\n print('NG')", "K = int(input())\nA,B = map(int, input().split())\n\nOK = False\n\nfor i in range(A, B+1):\n if i % K == 0:\n OK = True\n\nif OK == True:\n print('OK')\nelse:\n print('NG')"] | ['Wrong Answer', 'Accepted'] | ['s950195624', 's950989784'] | [9200.0, 9172.0] | [19.0, 21.0] | [274, 176] |
p02693 | u033575126 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA,B = map(int,input().split())\n\nmax = B//K+1\nprint(max)\njudge = 0\n\nfor i in range(max):\n if(i==0):\n continue\n\n if A<=K*i and K*i<=B:\n judge = 1\n break\n\nif judge==1:\n print("OK")\nelse:\n print("NG")', 'K = int(input())\nA,B = map(int,input().split())\n\ni=A\nlength = B-A+1\njudge = 0\n\nfor _ in range(length):\n if(i%K==0):\n judge = 1\n break\n\n i += 1\n \nif judge==1:\n print("OK")\nelse:\n print("NG")'] | ['Wrong Answer', 'Accepted'] | ['s260245170', 's321110459'] | [9076.0, 9100.0] | [20.0, 22.0] | [246, 218] |
p02693 | u034400188 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['import math\n\nK = input()\ndistance = list(map(int,input().split()))\n\nfor i in range(distance[1]-distance[0]+1):\n if (distance[0]+i) % K == 0:\n print("OK")\n\nprint("NG")\n', 'import math\n\nK = input()\ndistance = list(map(int,input().split()))\n\nfor i in range(len(distance)):\n if distance[i] % K == 0:\n print("OK")\n\nprint("NG")', 'import math\nimport sys\n\nK = int(input())\ndistance = list(map(int,input().split()))\n\n\nfor i in range(distance[1]-distance[0]+1):\n if (distance[0]+i) % K == 0:\n print("OK")\n sys.exit()\n\nprint("NG")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s158888708', 's988414315', 's486419036'] | [9168.0, 9148.0, 8960.0] | [24.0, 21.0, 23.0] | [177, 160, 213] |
p02693 | u035453792 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k=int(input())\na,b=map(int,input().split())\n\nif a/k>=2:\n print("ok")\nelif b/k>=2:\n print("ok")\nelse:\n print("NG")', 'k=int(input())\na,b=map(int,input().split())\n\nif a/k>=2:\n print("OK")\nelif b/k>=2:\n print("OK")\nelif a%k==0:\n print("OK")\nelif b%k==0:\n print("OK")\nelse:\n print("NG")'] | ['Wrong Answer', 'Accepted'] | ['s359560958', 's407034487'] | [9172.0, 9160.0] | [24.0, 22.0] | [122, 180] |
p02693 | u036693958 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = input("")\nA, B = map(int, input().split())\nnumber = False\nfor i in range(A, B+1):\n if number % K == 0:\n number = True\n \nprint("OK" if number else "NG")', 'K = int(input(""))\nA, B = map(int, input().split())\nnumber = False\nfor i in range(A, B+1):\n if i % K == 0:\n number = True\n\nprint("OK" if number else "NG")'] | ['Runtime Error', 'Accepted'] | ['s684953255', 's039967532'] | [9172.0, 9172.0] | [22.0, 22.0] | [172, 164] |
p02693 | u039065404 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split())\n\nfor num in range(1,1000):\n if A <= K*num <= B:\n print('OK')\n break\n\nprint('NG') ", "K = int(input())\nA, B = map(int, input().split())\n\nfor num in range(1,1000):\n if A <= K*num <= B:\n print('OK')\n break\nelse:\n print('NG')\n"] | ['Wrong Answer', 'Accepted'] | ['s117081132', 's344779210'] | [9160.0, 9160.0] | [24.0, 25.0] | [138, 145] |
p02693 | u039934639 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["A,B = map(int, input().split())\n\nif A//K < B//K or K==1:\n print('OK')\nelse:\n print('NG')", "k =int(input())\na, b =map(int, input().split())\n\nif a <= b//k*k:\n print('OK')\nelse:\n print('NG')"] | ['Runtime Error', 'Accepted'] | ['s348064835', 's485855329'] | [9184.0, 9068.0] | [23.0, 23.0] | [90, 98] |
p02693 | u043445065 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na, b = map(int, input().split())\n\nfor i in range(b-a):\n c = a+i\n if c%k==0 :\n print("ok")\n break\n \n if c == b-1 :\n print("NG")\n', 'k = int(input())\na, b = map(int, input().split())\n\nfor i in range(b-a):\n c = a+i\n if c%k==0 :\n print("ok")\n break\n \n if c == b-1 :\n print("NG")\nif b%k == 0:\n print("ok")\n ', 'k = int(input())\na, b = map(int, input().split())\nn = b-a\nc = 0\n\nfor i in range(n+1):\n if (a+i)%k==0 :\n c = 1\n print("OK")\n break\n \nif c == 0:\n print("NG")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s146949859', 's848587047', 's125501396'] | [9148.0, 9168.0, 9164.0] | [22.0, 21.0, 24.0] | [177, 214, 185] |
p02693 | u047197186 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["if a % k == 0 or b % k == 0:\n print('OK')\nelse:\n if k == 1:\n print('OK')\n elif a // k < b // k:\n print('OK')\n else:\n print('NG')", "k = int(input())\na, b = [int(elem) for elem in input().split()]\n\n\nif a % k == 0 or b % k == 0:\n print('OK')\nelse:\n if k == 1:\n print('OK')\n elif a // k < b // k:\n print('OK')\n else:\n print('NG')\n\n"] | ['Runtime Error', 'Accepted'] | ['s902585833', 's408644645'] | [9092.0, 9168.0] | [22.0, 23.0] | [161, 229] |
p02693 | u047271634 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['import sys\n# input\nk = int(input())\na, b = map(int, input().split())\n#print(f"k >>{k}, a >>{a}, b >>{b}")\n\n\nfor i in range(a, b+1):\n print(i)\n if (i % k == 0):\n print("OK")\n sys.exit(0)\n\nprint("NG")', 'import sys\n# input\nk = int(input())\na, b = map(int, input().split())\n#print(f"k >>{k}, a >>{a}, b >>{b}")\n\n\nfor i in range(a, b+1):\n if (i % k == 0):\n print("OK")\n sys.exit(0)\n\nprint("NG")\n'] | ['Wrong Answer', 'Accepted'] | ['s083166254', 's656292086'] | [9216.0, 9192.0] | [23.0, 22.0] | [218, 206] |
p02693 | u047618457 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["import numpy as np\na = int(input())\nb,c=map(int,input().split())\nwhile(True):\n for i in range(a, b+1):\n if i//a == 0:\n print('True')\n break\n print('NG')\nprint('OK')\n\n\n", "import numpy as np\na = int(input())\nb,c=map(int,input().split())\nd = np.arange(a,1001,a)\nf = np.arange(b,c+1)\nd_set=set(d)\nf_set=set(f)\n\ng_set=d_set&f_set \n\ng=list(g_set)\nif len(g) == 0:\n print('NG')\nelse:\n print('OK')"] | ['Time Limit Exceeded', 'Accepted'] | ['s856345152', 's639980232'] | [28936.0, 27140.0] | [2237.0, 107.0] | [202, 283] |
p02693 | u048800107 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['from sys import stdin\ninput = stdin.readline\n\na,b,n = map(int,input().split())\n\nmaxpoint = 0\nif b > n:\n for i in range(n+1):\n tmp = int((a * i) / b) - a * int(i/b) \n maxpoint = max(tmp,maxpoint)\nelse:\n for i in reversed(range(n+1)):\n tmp = int((a * i) / b) - a * int(i/b) \n if b > 1:\n if i % (b-1) == 0 :\n maxpoint = max(tmp,maxpoint)\n print(maxpoint) \n exit()\n elif b == 1:\n print(0)\n exit()\n maxpoint = max(tmp,maxpoint)\n # print(maxpoint)\n\nprint(maxpoint)', "\nk = int(input())\na,b = map(int,input().split())\n\nfor i in range(a,b+1):\n if i % k == 0:\n print('OK')\n exit()\nprint('NG')"] | ['Runtime Error', 'Accepted'] | ['s890157658', 's875941978'] | [9208.0, 9052.0] | [23.0, 24.0] | [593, 138] |
p02693 | u048867491 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["def main():\n K=int(input())\n (A,B)=[int(x) for x in input().split()]\n if A % K == 0:\n print('OK')\n elif math.ceil(A/K)*K <= B:\n print('OK')\n else:\n print('NG')\n \nif __name__ == '__main__':\n main()", "import math\n\ndef main():\n K=int(input())\n (A,B)=[int(x) for x in input().strip().split()]\n if A % K == 0:\n print('OK')\n elif math.ceil(A/K)*K <= B:\n print('OK')\n else:\n print('NG')\n \nif __name__ == '__main__':\n main()\n "] | ['Runtime Error', 'Accepted'] | ['s620397531', 's076703440'] | [9176.0, 9172.0] | [21.0, 24.0] | [235, 261] |
p02693 | u049355439 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na, b = map(int, input().split())\n\nif k < a:\n if k >= 2 and (b - a) >= k - 2:\n print("OK")\nelif k == a or k == b:\n print("OK")\nelif a < k and k < b:\n print("OK")\nprint k == 1:\n print("OK")\nelse:\n print("NO")\n', 'k = int(input())\na, b = map(int, input().split())\n\nif k >= 2 and b - a >= k - 1:\n print("OK")\nelif k == a or k == b:\n print("OK")\nelif a < k and k < b:\n print("OK")\nprint k == 1:\n print("OK")\nelse:\n print("NO")\n', 'k = int(input())\na, b = map(int, input().split())\n\nif k < a:\n if k >= 2:\n if b - a >= k - 1:\n print("OK")\nelif k == a or k == b:\n print("OK")\nelif a < k and k < b:\n print("OK")\nprint k == 1:\n print("OK")\nelse:\n print("NO")\n', 'k = int(input())\na, b = map(int, input().split())\n\nif k < a:\n if k >= 2:\n if b - a >= k - 2:\n print("OK")\nelif k == a or k == b:\n print("OK")\nelif a < k and k < b:\n print("OK")\nprint k == 1:\n print("OK")\nelse:\n print("NO")\n', 'k = int(input())\na, b = map(int, input().split())\n\nif k < a:\n if k >= 2:\n if b - a >= k - 1:\n print("OK")\nelif k == a or k == b:\n print("OK")\nelif a < k and k < b:\n print("OK")\nprint k == 1:\n print("OK")\nelse:\n print("NO")\n', 'k = int(input())\na, b = map(int, input().split())\n\nif k < a:\n if k >= 2 and b - a >= k - 2:\n print("OK")\nelif k == a or k == b:\n print("OK")\nelif a < k < b:\n print("OK")\nprint k == 1:\n print("OK")\nelse:\n print("NO")\n', 'k = int(input())\na, b = map(int, input().split())\n\nif b - a >= k - 1:\n print("OK")\nelif k == 1:\n print("OK")\nelif b == k or a == k:\n print("OK")\nelif b % k == 0 or a % k == 0:\n print("OK")\nelif a < k and k < b:\n print("OK")\nelif a != b and k == 2:\n print("OK")\nelif b < k:\n print("NG")\nelif a % k > b % k:\n print("OK")\nelse:\n print("NG")\n\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s209376793', 's220789254', 's533859201', 's602658284', 's719044853', 's972827346', 's448155409'] | [8948.0, 9040.0, 8932.0, 8988.0, 8852.0, 9040.0, 9060.0] | [23.0, 19.0, 19.0, 23.0, 20.0, 21.0, 23.0] | [233, 217, 235, 235, 237, 224, 349] |
p02693 | u052244548 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K=int(input())\nA,B=map(int,input().split())\n\n\nfor i in range(1,1000):\n if K * i > 1000\n break\n if K * i >= A and K * i <=B:\n print('OK')\n exit()\n\nprint('NG')", "K=int(input())\nA,B=map(int,input().split())\n\n\nfor i in range(1,1000):\n if K * i > 1000:\n break\n if K * i >= A and K * i <=B:\n print('OK')\n exit()\n\nprint('NG')"] | ['Runtime Error', 'Accepted'] | ['s718877953', 's504197341'] | [8772.0, 9032.0] | [21.0, 29.0] | [184, 185] |
p02693 | u052838115 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K=int(input())\nA,B=map(int,input().split())\nans='NG'\nfor i in range(A,B):\n if i%K==0:\n ans='YES'\n break\nprint(ans)", "K=int(input())\nA,B=map(int,input().split())\nans='NG'\nfor i in range(A,B+1):\n if i%K==0:\n ans='YES'\n break\nprint(ans)", "K=int(input())\nA,B=map(int,input().split())\nans='NG'\nfor i in range(A,B+1):\n if i%K==0:\n ans='OK'\n break\nprint(ans)"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s267874692', 's794314751', 's487370557'] | [9164.0, 9100.0, 9116.0] | [23.0, 22.0, 22.0] | [131, 133, 132] |
p02693 | u053744958 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split())\n\nfor i in range(int(A/K), int(B/K)):\n if(i%K==0):\n print('OK')\n break\nprint('NG')", "K = int(input())\nA, B = map(int, input().split())\ncan=False\ncount = 1\na = K\n\nwhile(a <= B):\n a = count * K\n count += 1\n \n if(a>=A and a<=B): can=True\n\nif(can):print('OK')\nelse: print('NG')"] | ['Wrong Answer', 'Accepted'] | ['s355308748', 's252052887'] | [9112.0, 9192.0] | [22.0, 23.0] | [148, 200] |
p02693 | u054825571 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K=int(input().split())\nA,B=map(int,input().split())\nn=A//K\nprint("OK" if A<=K*n<=B or K*(n+1)<=B else "NG")', 'K=int(input())\nA,B=map(int,input().split())\nn=A//K\nprint("OK" if A<=K*n<=B or K*(n+1)<=B else "NG")'] | ['Runtime Error', 'Accepted'] | ['s340717915', 's799123513'] | [9032.0, 9084.0] | [27.0, 25.0] | [107, 99] |
p02693 | u054931633 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na,b = map(int,input().split())\nc = b - a\nprint(c)\nlis = []\nif k == 1:\n print("OK")\nelse:\n for i in range(c):\n lis.append(a + i % k)\n if lis.count(0) == 0:\n print("OK")\n else:\n print("NG")', 'k = int(input())\na,b = map(int,input().split())\nc = b - a\nlis = []\nif k == 1:\n print("OK")\nelif b - a >= k:\n print("OK")\nelse:\n for i in range(c+1):\n d = (a + i)% k\n lis.append(d)\n if lis.count(0) == 0:\n print("NG")\n else:\n print("OK")'] | ['Wrong Answer', 'Accepted'] | ['s086573240', 's693170781'] | [9180.0, 9192.0] | [21.0, 24.0] | [237, 278] |
p02693 | u056830573 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na, b = [int(x) for x in input().split()]\n\nans = ""\nfor x in range(a, b+1):\n if x % k == 0:\n print(x)\n ans = "OK"\n break\n\nif ans == "OK":\n print("OK")\nelse:\n print("NG")', 'k = int(input())\na, b = [int(x) for x in input().split()]\n\nans = ""\nfor x in range(a, b+1):\n if x % k == 0:\n ans = "OK"\n break\n\nif ans == "OK":\n print("OK")\nelse:\n print("NG")'] | ['Wrong Answer', 'Accepted'] | ['s186241500', 's824758247'] | [9180.0, 9180.0] | [23.0, 18.0] | [215, 198] |
p02693 | u057942294 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["import sys\n\nK = input()\nA, B = map(int, input().split())\n\nfor i in range(A, B + 1):\n if i % K == 0:\n print('OK')\n sys.exit()\n\t\nprint('NG')\n", "K = input()\nA, B = map(int, input().split())\n\nfor i in range(A, B + 1):\n if i % K == 0:\n print('OK')\n exit()\n\t\nprint('NG')", "import sys\n\nK = int(input())\nA, B = map(int, input().split())\n\nfor i in range(A, B + 1):\n if i % K == 0:\n print('OK')\n sys.exit()\n\t\nprint('NG')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s248066208', 's851287575', 's863603985'] | [9108.0, 9168.0, 9092.0] | [21.0, 22.0, 24.0] | [146, 129, 151] |
p02693 | u059210959 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['# encoding:utf-8\nimport copy\nimport random\nimport bisect \nimport fractions \nimport math\nimport sys\nimport collections\n\nmod = 10**9+7\nsys.setrecursionlimit(mod) \n\nd = collections.deque()\ndef LI(): return list(map(int, sys.stdin.readline().split()))\n\nK = int(input())\nA, B = LI()\n\nans = "NG"\nfor i in range(A, B+1):\n print(i)\n if i % K == 0:\n ans = "OK"\nprint(ans)', '# encoding:utf-8\nimport copy\nimport random\nimport bisect \nimport fractions \nimport math\nimport sys\nimport collections\n\nmod = 10**9+7\nsys.setrecursionlimit(mod) \n\nd = collections.deque()\ndef LI(): return list(map(int, sys.stdin.readline().split()))\n\nK = int(input())\nA, B = LI()\n\nans = "NG"\nfor i in range(A, B+1):\n # print(i)\n if i % K == 0:\n ans = "OK"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s011663593', 's509122835'] | [10936.0, 10932.0] | [32.0, 33.0] | [509, 511] |
p02693 | u059903069 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA, B = map(int, input().split())\nnum =A\nwhile A <= num <= B: \n if num % K == 0:\n x="OK"\n break\n else:\n x="NG"\n A +=1\nprint(x)', 'K = int(input())\nA, B = map(int, input().split())\nnum =A\nwhile A <= num <= B: \n if num % K == 0:\n x="OK"\n break\n else:\n x="NG"\n num +=1\nprint(x)'] | ['Wrong Answer', 'Accepted'] | ['s883574452', 's102024789'] | [9164.0, 9168.0] | [22.0, 23.0] | [178, 180] |
p02693 | u060793972 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["k=int(input())\na,b=map(int,input().split())\nprint('Yes' if a//k-b//k or a%k==0 else 'No')", "k=int(input())\na,b=map(int,input().split())\nprint('OK' if a//k-b//k or a%k==0 else 'NG')\n"] | ['Wrong Answer', 'Accepted'] | ['s433590771', 's338196120'] | [9160.0, 9156.0] | [22.0, 21.0] | [89, 89] |
p02693 | u061172855 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['import math\n\nN = int(input())\n\n# a,b=map(int,input().split())\nsum = 100\ni = 0\n\n# while\tsum < N:\n\n# \ti += 1\n\nwhile sum < N:\n\tsum += sum * 0.01\n\ti += 1\n\tsum = int(sum)\n\nprint(i)\n', "K = input()\n# A = input()\n# B = input()\n\n# a = int(A)\n\nk = int(K)\n\na,b=map(int,input().split())\n\nfor i in range(a,b+1):\n\tif i % k == 0:\n\t\tprint('OK')\n\t\tbreak\n\telse:\n\t\tif i == b:\n\t\t\tprint('NG')\n"] | ['Wrong Answer', 'Accepted'] | ['s899543115', 's902703166'] | [9184.0, 9168.0] | [21.0, 23.0] | [191, 205] |
p02693 | u062754605 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['X = int(input())\nS = 100\nfor i in range(1000000000000000):\n S += int((0.01) * S)\n if S >= X:\n print(i+1)\n break\n', 'K = int(input())\nA, B = map(int, input().split())\nx = 0\nfor i in range(A, B + 1):\n if i % K == 0:\n x += 1\n\nif x == 0:\n print("NG")\nelse:\n print("OK")\n'] | ['Wrong Answer', 'Accepted'] | ['s074640792', 's284601040'] | [9096.0, 9168.0] | [18.0, 21.0] | [132, 166] |
p02693 | u063346608 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na , b = map(int(input().split()))\n\nflag = 0\nfor i in range(a ,b + 1, 1)\n\tif i % k == 0:\n\t\tflag = flag + 1\n\t\tbreak\n\t\tprint("OK")\nelif flag == 0:\n\tprint("NO")', 'K = int(input())\nA,B = map(int,input().split())\n\nflag = 0\nfor i in range(A,B + 1,1):\n\tif i % K == 0:\n\t\tflag = 1\n\nif flag ==1:\n\tprint("OK")\nelse:\n\tprint("NG")'] | ['Runtime Error', 'Accepted'] | ['s136705591', 's545152837'] | [9000.0, 9140.0] | [22.0, 29.0] | [173, 157] |
p02693 | u068142202 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['import math\n\nx = int(input())\nsaving = 100\ncount = 0\nwhile x > saving:\n saving = math.floor(saving + saving * 0.01)\n count += 1\nprint(count)', 'k = int(input())\na, b = map(int, input().split())\nfor i in range(a, b + 1):\n if i % k == 0:\n print("OK")\n exit()\nprint("NG")'] | ['Wrong Answer', 'Accepted'] | ['s602199379', 's286439438'] | [9168.0, 9164.0] | [21.0, 22.0] | [142, 131] |
p02693 | u068666298 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K= int(input())\nA, B = map(int, input().split())\nsum=0\nfor(int i = A; i <= B; i++)\n if i%K==0:\n sum+=1\nif sum>=1:\n print('OK')\nelse:\n print('NG')", "K= int(input())\nA, B = map(int, input().split())\n\nsum=0\nfor i in range(A,B+1,1):\n print(i)\n if i%K==0:\n sum+=1\nif sum>=1:\n print('OK')\nelse:\n print('NG')", "K= int(input())\nA, B = map(int, input().split())\n\nsum=0\nfor i in range(A,B+1,1):\n \n if i%K==0:\n sum+=1\nif sum>=1:\n print('OK')\nelse:\n print('NG')"] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s091609453', 's559372268', 's859606493'] | [9016.0, 9176.0, 9172.0] | [21.0, 23.0, 23.0] | [161, 172, 164] |
p02693 | u068844030 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k = int(input())\na, b = map(int,input().split())\n\nfor i in range(a, b+1):\n if i % k == 0:\n print("OK")\n break\n else:\n print("NG")\n', 'k = int(input())\na, b = map(int,input().split())\n\nfor i in range(a, b+1):\n if i % k == 0:\n print("OK")\n break\nelse:\n print("NG")\n'] | ['Wrong Answer', 'Accepted'] | ['s139212512', 's049327597'] | [9180.0, 9060.0] | [23.0, 22.0] | [157, 149] |
p02693 | u068862829 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split())\n\nl = K\nans = 'NG'\nfor l in range(K, 1001, K):\n print(l)\n if l >= A and l <= B:\n ans = 'OK'\n break\n elif l > B:\n break\n\nprint(ans)", "K = int(input())\nA, B = map(int, input().split())\n\nl = K\nans = 'NG'\nfor l in range(K, 1001, K):\n# print(l)\n if l >= A and l <= B:\n ans = 'OK'\n break\n elif l > B:\n break\n\nprint(ans)"] | ['Wrong Answer', 'Accepted'] | ['s688649521', 's097017722'] | [9172.0, 9072.0] | [26.0, 29.0] | [209, 211] |
p02693 | u070379349 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split())\n\nIf A%K == 0 or B%K == 0\n\tprint 'OK'\n\nelif A <= K*(A//K + 1) and K*(A//K + 1) <= B :\n\tprint 'OK'\n\nelse :\n\tprint 'NG'\n", "K = int(input())\nA, B = map(int, input().split())\n\nif A%K == 0 or B%K == 0\n\tprint 'OK'\n\nelif A <= K*(A//K + 1) and K*(A//K + 1) <= B :\n\tprint 'OK'\n\nelse :\n\tprint 'NG'\n", "K = int((input() .split())[0])\nA, B = map(int, input().split())\n\nif A%K == 0 or K*(A//K + 1) <= B :\n\tprint('OK')\n\nelse :\n\tprint('NG')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s659893362', 's883197163', 's625588481'] | [9016.0, 9024.0, 9176.0] | [25.0, 22.0, 21.0] | [167, 167, 135] |
p02693 | u074687136 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["K = int(input())\nA, B = map(int, input().split())\nlist_ = [(i+A) for i in range(B-A+1)]\nprint(list_)\ncount = 0\nfor i in range(len(list_)):\n if list_[i] % K == 0:\n count += 1\n break\n\nif count > 0:\n print('OK')\nelse:\n print('NG')", "K = int(input())\nA, B = map(int, input().split())\nlist_ = [(i+A) for i in range(B-A+1)]\ncount = 0\nfor i in range(len(list_)):\n if list_[i] % K == 0:\n count += 1\n break\n\nif count > 0:\n print('OK')\nelse:\n print('NG')"] | ['Wrong Answer', 'Accepted'] | ['s557936392', 's155827930'] | [9188.0, 9136.0] | [24.0, 22.0] | [236, 223] |
p02693 | u079022693 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['from sys import stdin\nimport itertools\nimport numpy as np\nfrom numba import njit\n\ndef main():\n\n readline=stdin.readline\n N,M,Q=map(int,readline().split())\n a=np.zeros(Q,dtype=np.int64)\n b=np.zeros(Q,dtype=np.int64)\n c=np.zeros(Q,dtype=np.int64)\n d=np.zeros(Q,dtype=np.int64)\n for i in range(Q):\n a[i],b[i],c[i],d[i]=map(int,readline().split())\n\n arrays=np.array(list(itertools.combinations_with_replacement(range(1,M+1),N)),dtype=np.int64)\n l=len(arrays)\n\n print(f(l,Q,a,b,c,d,arrays))\n \n@njit("i8(i8,i8,i8[:],i8[:],i8[:],i8[:],i8[:,:])",cache=True)\ndef f(l,Q,a,b,c,d,arrays):\n max_res=0\n for i in range(l):\n res=0\n for j in range(Q):\n if arrays[i][b[j]-1]-arrays[i][a[j]-1]==c[j]:\n res+=d[j]\n max_res=max(max_res,res)\n return max_res\n\nif __name__=="__main__":\n\tmain()', 'from sys import stdin\ndef main():\n \n readline=stdin.readline\n K=int(readline())\n A,B=map(int,readline().split())\n if A%K==0:\n print("Yes")\n elif A//K<B//K:\n print("Yes")\n else:\n print("No")\nif __name__=="__main__":\n main()', 'k=int(input())\na,b=map(int,input().split())\nprint("OK" if a<=b//k*k else "NG")'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s049860714', 's260094726', 's554009841'] | [106316.0, 9204.0, 9068.0] | [531.0, 23.0, 24.0] | [871, 274, 78] |
p02693 | u080364835 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["k = int(input())\na, b = map(int, input().split())\n\nif k == 1:\n print('Yes')\nelse:\n print('Yes' if (b-a)//k >= 1 else 'No')", "k = int(input())\na, b = map(int, input().split())\n\nprint('OK' if b//k*k >= a else 'NG')"] | ['Wrong Answer', 'Accepted'] | ['s309243832', 's763909628'] | [9128.0, 9044.0] | [22.0, 22.0] | [128, 87] |
p02693 | u086624329 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['A,B,N=map(int,input().split())\n\ndef g(t):\n return int(A*t/B)-A*int(t/B)\n\nx=[i for i in range(0,N,1)]\n\ny=[g(i) for i in x]\n\nprint(max(y))', 'A,B,N=map(int,input().split())\n\ndef f(t):\n return int(t)\n\nMax_x=0\n\nfor i in range(N):\n if f(A*i/B)-A*f(i/B)<f(A*(i+1)/B)-A*f((i+1)/B):\n Max_x=i+1\n \nprint(f(A*Max_x/B)-A*f(Max_x/B))', 'N,M=map(int,input().split())\n\nx=list(range(1,N+1,1))\n\n\nif N%2==1:\n for i in range(M):\n print(x.pop(0),x.pop(-1))\n \nelse:\n x_f=x[1:int(N/2+1)]\n x_l=x[int(N/2+1):]\n \n \n count=0\n \n for i in range(M):\n if len(x_f)>1:\n print(x_f.pop(0),x_f.pop(-1))\n count+=1\n \n if count==M:\n break\n \n if len(x_l)>1:\n print(x_l.pop(0),x_l.pop(-1))\n count+=1\n \n if count==M:\n break', "K=int(input())\nA,B=map(int,input().split())\n\nAns='NG'\n\nfor i in range(A,B+1):\n if i%K==0:\n Ans='OK'\n break\n \nprint(Ans)"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s112085676', 's442244707', 's863466136', 's161735086'] | [9020.0, 9132.0, 9228.0, 9168.0] | [23.0, 21.0, 21.0, 22.0] | [139, 200, 519, 143] |
p02693 | u087512063 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['k, a, b = map(int, input().split())\nf = 1\nwhile a <= b:\n\tif (a % k == 0):\n\t\tf = 0\n\t\tprint ("OK")\n\t\tbreak\n\ta += 1\nif f:\n\tprint ("NG")', 'n = int(input())\na, b = map(int, input().split())\nsucess = False\nfor i in range(a, b + 1):\n if i % n == 0:\n sucess = True\nprint(("NG", "OK")[sucess])'] | ['Runtime Error', 'Accepted'] | ['s738790606', 's830980158'] | [9172.0, 9180.0] | [24.0, 24.0] | [132, 159] |
p02693 | u088989565 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA,B = list(map(int, input().split()))\nflag = 0\nwhile(flag==0):\n if(A<=K and K<=B):\n flag = 1\n break\n K += K\nif(flag==0):\n print("NG")\nelse:\n print("OK")', 'K = int(input())\nA,B = list(map(int, input().split()))\nnum = K\nflag = 0\nwhile(flag==0):\n if(A<=num and num<=B):\n flag = 1\n break\n num += K\n if(num>B):\n break\nif(flag==0):\n print("NG")\nelse:\n print("OK")'] | ['Time Limit Exceeded', 'Accepted'] | ['s172345536', 's068602944'] | [9236.0, 9184.0] | [2205.0, 22.0] | [179, 216] |
p02693 | u090046582 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA = int(input())\nB = int(input())\n""" K=4\nA=5\nB=7 """\nq=0\n\n\nfor i in range(1,1000):\n if A <= i*K & i*K <= B:\n print("OK")\n q=1\n break\n\nif q == 0:\n print("NG")\n\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=4\nA=5\nB=7 """\n\n\nif A==B:\n if A%K==0:\n print("OK")\n else:\n print("NG")\n\nnum=A\nwhile num <= B:\n\n if num%K == 0:\n print("OK") \n exit()\n if num==B:\n print("NG")\n exit()\n num += 1\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=1\nA=11\nB=11 """\n\n\nif A==B:\n if A%K==0:\n print("OK")\n else:\n print("NG")\n\nnum=A\nwhile num <= B:\n num += 1\n if num%K == 0:\n print("OK") \n break\n if num==B:\n print("NG")\n break\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=4\nA=5\nB=7 """\n\n\nif A==B:\n if A%K==0:\n print("OK")\n else:\n print("NG")\n\nnum=A\nwhile num <= B:\n num += 1\n if num%K == 0:\n print("OK") \n exit()\n if num==B:\n print("NG")\n exit()\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=4\nA=5\nB=7 """\nq=0\n\n\nfor i in range(1,1000):\n if A <= i*K & i*K <= B:\n print("OK")\n q=1\n break\n\nif q == 0:\n print("NG")\n\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=4\nA=5\nB=7 """\nq=0\n\n\nfor i in range(1,1000):\n if A <= i*K & i*K <= B:\n print("OK")\n q=1\n break\n\nif q == 1:\n print("NG")\n\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=7\nA=500\nB=600 """\n\n\nif A==B:\n if A%K==0:\n print("OK")\n else:\n print("NG")\n\nnum=A\nwhile num <= B:\n num += 1\n if num%K == 0:\n print("OK") \n break\n if num==B:\n print("NG")\n break\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=7\nA=500\nB=600 """\n\n\n\nnum=A\nwhile num <= B:\n num += 1\n if num%K == 0:\n print("OK") \n break\n if num==B:\n print("NG")\n break\n\n', 'K = int(input())\nA = int(input())\nB = int(input())\n""" K=4\nA=5\nB=7 """\nq=0\n\n\nfor i in range(1,1000):\n if A <= i*K & i*K <= B:\n print("OK")\n q=1\n break\n\nif q == 0:\n print("NG")\n\n\n', "k=int(input())\na,b= map(int, input().split())\nq=0\n \nfor i in range(1,1000):\n if a<=k*i and k*i<=b:\n print('OK')\n q=1\n break\n \nif q==0:\n print('NG')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s057161487', 's273735398', 's427882392', 's505848377', 's679413548', 's808202954', 's916927583', 's960663394', 's965736187', 's177437594'] | [9140.0, 9084.0, 9076.0, 9188.0, 9008.0, 9072.0, 9096.0, 9176.0, 9076.0, 9176.0] | [25.0, 25.0, 26.0, 25.0, 21.0, 24.0, 22.0, 24.0, 21.0, 27.0] | [205, 289, 290, 289, 205, 205, 291, 217, 205, 158] |
p02693 | u091307273 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ["k = int(input())\na, b = (int(i) for i in input().split())\n\nfor i in range(a, b+1):\n if i % k == 0:\n print('OK')\n return\n\nprint('NG')", "def main():\n k = int(input())\n a, b = (int(i) for i in input().split())\n\n for i in range(a, b+1):\n if i % k == 0:\n print('OK')\n return\n\n print('NG')\n\n\nmain()\n"] | ['Runtime Error', 'Accepted'] | ['s611098288', 's321996780'] | [9124.0, 8988.0] | [27.0, 30.0] | [139, 195] |
p02693 | u092415958 | 2,000 | 1,048,576 | Takahashi the Jumbo will practice golf. His objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive). If he can achieve the objective, print `OK`; if he cannot, print `NG`. | ['K = int(input())\nA, B = map(int, input().split())\na = 0\nK_sum = K\nwhile K <= B:\n if A<=K and K<=B:\n a = 1\n break\n K_sum += K\n\nif a==1:\n print("OK")\nelse:\n print("NG")', 'K = int(input())\nA, B = map(int, input().split())\nmod = A % K\ndif = B - A\nif mod + dif >= K or mod==0:\n print("OK")\nelse:\n print("NG")\n'] | ['Time Limit Exceeded', 'Accepted'] | ['s723520574', 's702597805'] | [9096.0, 9160.0] | [2205.0, 22.0] | [192, 141] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.