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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02983 | u151503168 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\nx, y = L % 2019, R % 2019\nprint(x,y)\nif (R-L) > 2017 or x>=y:\n print(0)\nelse:\n m = 2019\n for i in range(x, y + 1):\n for j in range(i + 1, y + 1):\n x = (i * j) % 2019\n m = min(m, x)\n if m == 0:\n break\n if m... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s396236781', 's601211769', 's764364342', 's651628153'] | [3064.0, 2940.0, 3064.0, 3060.0] | [55.0, 17.0, 780.0, 58.0] | [342, 167, 262, 331] |
p02983 | u151779250 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['mod=[]\nanswer = 2018\ncount = 0\nsub=0\nmod = [int(i) for i in input().split()]\nif(mod[0]+1==mod[1]):\n answer = (mod[0]*mod[1])%2019\n\nfor i in range(mod[0],mod[1]+1):\n for j in range(i+1,mod[1]+1):\n sub = (i*j)%2019\n if sub<answer:\n answer = sub\n print(answer)\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s607601110', 's682085572', 's426097649'] | [3064.0, 3064.0, 3064.0] | [2104.0, 17.0, 511.0] | [371, 366, 348] |
p02983 | u152283104 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, (input().split()))\nLmod, Rmod = L%2019, R%2019\nprint(L,R,Lmod,Rmod)\n\nif Lmod < Rmod and (R - L >= 2019):\n print(0)\nelif Lmod < Rmod and (R - L < 2019):\n ch_list =[]\n for i in range(L,R,1):\n for j in range(i+1, R+1, 1):\n ch_list.append((i*j)%2019)\n print(ch_list... | ['Wrong Answer', 'Accepted'] | ['s539439964', 's241496180'] | [107860.0, 3064.0] | [783.0, 428.0] | [363, 347] |
p02983 | u163907160 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import collections\nimport numpy as np\nimport sys\nsys.setrecursionlimit(10000000)\nimport copy\n#N=int(input())\nL,R=map(int,input().split())\nl=[]\nfor i in range(2021):\n l.append(L%2019)\n if L==R:\n break\n L+=1\nans=2019999\nfor i in range(len(l)):\n for j in range(len(l)-i):\n ans=mi... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s772005941', 's932076016', 's075918759'] | [12388.0, 12388.0, 20892.0] | [1065.0, 1946.0, 318.0] | [334, 334, 379] |
p02983 | u166621202 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\ninput = sys.stdin.readline\n\nL,R = map(int,input().split())\nlst = []\n\nif L <= 2019 and R >= 2019:\n print(0)\nelse:\n for i in range(L,R+1):\n if i % 2019 == 0:\n print(0)\n break\n for j in range(i+1,R+1):\n if j % 2019 == 0:\n print... | ['Wrong Answer', 'Accepted'] | ['s729177512', 's726222742'] | [75312.0, 75312.0] | [746.0, 770.0] | [441, 447] |
p02983 | u167307651 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy as np\nl,r = map(int, input().split())\nif (((l-1)//2019)<(r/2019))|((((l-1)/673)<(r//673))&(((l-1)//3)<(r//3))):\n print(0)\nelse:\n arr1 = np.array(range(l,r+1))\n arr2 = np.array(range(l,r+1)).reshape(r-l+1,1)\n arr = arr1*arr2%2019 + (np.identity(r-l+1)*2019)\n print(int(np.min(arr)))', 'import ... | ['Wrong Answer', 'Accepted'] | ['s729186394', 's495216770'] | [12396.0, 107788.0] | [149.0, 244.0] | [299, 251] |
p02983 | u167647458 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["def main():\n l, r = map(int, input().split())\n \n a = l % 2019\n b = r % 2019\n if a >= b or r - l > 2019 or l % 2019 == 0 or r % 2019 == 0:\n print(0)\n else:\n print(0)\n \n \nif __name__ == '__main__':\n main()", "def main():\n ans = 10**19\n l, r = map(int, inp... | ['Wrong Answer', 'Accepted'] | ['s078745716', 's240665574'] | [2940.0, 3060.0] | [17.0, 50.0] | [248, 330] |
p02983 | u169696482 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L. R = map(int, input().split())\na = []\nb = []\nflag = False\nif R - L >= 2019:\n print(0)\nelse:\n for i in range(L,R):\n for j in range(i+1, R+1):\n mod = (i*j)%2019\n if mod != 1:\n a.append(mod)\n else:\n flag = True\n b... | ['Runtime Error', 'Accepted'] | ['s542593621', 's497844955'] | [3064.0, 75412.0] | [17.0, 522.0] | [448, 272] |
p02983 | u175590965 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\nif r-l >= 2019:\n print(0)\nelse:\n ans = 2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n ans = min(ans,i+j%2019)\n print(ans)', 'l,r = map(int,input().split())\nif r-l >= 2018:\n print(0)\nelse:\n ans = 2019\n for i in range(l,r):\n ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s396946688', 's934065549', 's995707594', 's549596672'] | [3060.0, 3060.0, 9016.0, 9172.0] | [747.0, 688.0, 26.0, 674.0] | [189, 189, 188, 188] |
p02983 | u177411511 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\nfrom math import *\nstdin = sys.stdin\n\nni = lambda: int(ns())\nna = lambda: list(map(int, stdin.readline().split()))\nns = lambda: stdin.readline().rstrip() # ignore trailing spaces\n\nnum = 2019\nl, r = na()\nli = []\nif r - l > 2019:\n print(0)\nelse:\n for i in range(l, r+1):\n li.appen... | ['Wrong Answer', 'Accepted'] | ['s858705326', 's804905067'] | [3060.0, 3064.0] | [18.0, 613.0] | [362, 524] |
p02983 | u182004566 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\n\nif R - L >= 2050:\n print(0)\nelif R == L:\n print(0)\nelse:\n ans = 2000\n for i in range(L, R+1):\n for j in range(i, R+1):\n x = (i * j) % 2019\n if ans > x:\n ans = x\n print(ans)\n', 'L, R = map(int, input().split())\n... | ['Wrong Answer', 'Accepted'] | ['s188540189', 's671754453'] | [3060.0, 2940.0] | [489.0, 546.0] | [266, 240] |
p02983 | u183256664 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\n\nL, R = [int(i) for i in input().split(" ")]\nmin_rem = 2018\n\nfor i in range(L, R + 1):\n if i % 2019 == 0:\n print(0)\n sys.exit()\n else:\n pass\n\nfor i in range(L, R):\n for j in range(i, R + 1):\n rem_i = i % 2019\n rem_j = j % 2019\n min_rem = mi... | ['Wrong Answer', 'Accepted'] | ['s390705736', 's110198749'] | [3064.0, 3060.0] | [1045.0, 995.0] | [349, 356] |
p02983 | u183657342 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy as np\n\nL, R = map(int, input().split())\n\nif R-L>=2019:\n print(0)\nelse:\n range_L_R = np.array(list(range(L, R+1)))\n range_mod_2019 = range_L_R % 2019\n range_mod_3 = range_L_R % 3\n range_mod_673 = range_L_R % 673\n\n if (0 in range_mod_2019) or (0 in range_mod_3 and 0 in range_m... | ['Wrong Answer', 'Accepted'] | ['s209904657', 's618734995'] | [12428.0, 3188.0] | [149.0, 763.0] | [364, 204] |
p02983 | u185325486 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["from itertools import combinations\n\nL, R = map(int, input().split())\nmod = 2019\nmin_score = float('inf')\nL = L%mod\nR = R%mod \nif L<R:\n pair = [i for i in range(L,R+1)]\nelse:\n pair = [i for i in range(L,mod)]\n for i in range(R+1):\n pair.append(i)\nfor a,b in combinations(pair,2):\n mi... | ['Wrong Answer', 'Accepted'] | ['s847090682', 's019865129'] | [3064.0, 3060.0] | [737.0, 64.0] | [342, 238] |
p02983 | u185948224 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import math\n\nL, R = map(int, input().split())\n\nans = 2019\n\nfor i, j in zip(range(2019), range(L, R)):\n for k in range(j+1, L + 2019):\n lr_mod = (j * k) % 2019\n if lr_mod < ans:\n ans = lr_mod\n\nprint(ans)', 'import math\n\nL, R = map(int, input().split())\n\nans = 2019\n\nfor i, ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s675980542', 's690901489', 's054412309'] | [3060.0, 3060.0, 3060.0] | [517.0, 18.0, 46.0] | [230, 276, 288] |
p02983 | u187366461 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R=map(int,input().split())\nif R-L>=673:\n print(0)\nelse:\n x=[]\n\n for i in range(L,R):\n for j in range(i+1,R+1):\n x.append((i*j)%2019)\n\n print(min(x))\n', 'L,R=map(int,input().split())\nif R-L>=673:\n print(0)\nelse:\n x=[]\n\n for i in range(L,R):\n for... | ['Wrong Answer', 'Accepted'] | ['s871788125', 's304931700'] | [4332.0, 6804.0] | [2104.0, 47.0] | [189, 181] |
p02983 | u188827677 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['print(1%2019)\nprint(2020%1)', 'print(1%2019)\nprint(2020%1)', 'l,r = map(int, input().split())\n\nif r-l >= 2019: print(0)\nelse:\n ans = float("inf")\n for i in range(l, r):\n for j in range(i+1, r+1):\n t = i*j%2019\n if t < ans: ans = t\n print(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s034212844', 's746966657', 's361202804'] | [2940.0, 2940.0, 9060.0] | [17.0, 17.0, 480.0] | [27, 27, 196] |
p02983 | u191829404 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import math\nimport copy\nfrom operator import mul\nfrom functools import reduce\nfrom collections import defaultdict\nfrom collections import Counter\nfrom collections import deque\n\nfrom itertools import product\n\nfrom itertools import permutations\n\nfrom itertools import combinations\n\nfrom itertools import ac... | ['Wrong Answer', 'Accepted'] | ['s371464648', 's894817232'] | [16564.0, 3668.0] | [2104.0, 782.0] | [1213, 1202] |
p02983 | u192522487 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy\n\nL, R = map(int, input().split())\nl, r = L % 2019, R % 2019\n\nif l > r or (R - L) >= 2019:\n print(0)\nelse:\n print(numpy.min([(i * j) % 2019 for i in range(l, r)\u3000for j in range(i + 1, r + 1)]))', 'import numpy\n\nL, R = map(int, input().split())\nl, r = L % 2019, R % 2019\n\nif l > r or ... | ['Runtime Error', 'Accepted'] | ['s954745022', 's242602654'] | [2940.0, 100468.0] | [17.0, 567.0] | [212, 210] |
p02983 | u196675341 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = list(map(int,input().split(" ")))\nl = L % 2019\nr = R % 2019\n\nans = 2019\n\nif R - L >= 2018 or L > R or (l <= 3 and 673 <= r):\n print("0")\nelse:\n array = list(range(l,r+1))\n for i in array:\n for j in array:\n temp = i * j % 2019\n if ans > temp:\n a... | ['Wrong Answer', 'Accepted'] | ['s808078384', 's824966658'] | [3060.0, 3060.0] | [55.0, 991.0] | [334, 356] |
p02983 | u196909697 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["l, r = [int(s) for s in input().split()]\n\nmod_l = l % 2019\nmod_r = r % 2019\n\nif (r - l > 2018) or (mod_l < mod_r):\n print('0')\nelse:\n min = 2018\n for i in range(mod_l, mod_r):\n for j in range(i+1, mod_r+1):\n mod = (i * j) % 2019\n if mod < min:\n min = mod\n\nprint(min)\n", "l, r = [... | ['Wrong Answer', 'Accepted'] | ['s571010426', 's732119357'] | [3060.0, 3060.0] | [17.0, 385.0] | [290, 296] |
p02983 | u202634017 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\nmL = L % 2019\nmR = R % 2019\nif (mL > mR):\n print(0)\nelse:\n if (mL == 0):\n print(0)\n else:\n print(2*mL+1)\n', 'L,R = map(int,input().split())\nmL = L % 2019\nmR = R % 2019\nif (mL > mR):print(0)\nelse:\n m = 2019\n for i in range(mL,mR):\n for... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s017462241', 's210577193', 's529554705'] | [2940.0, 3060.0, 3060.0] | [17.0, 385.0, 45.0] | [159, 242, 273] |
p02983 | u202826462 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\n\nmin = 2 * 10 ** 9\n\nif ((l * r) % 2019 == 0):\n print("0")\nelif((l*r) < 2019):\n print(l * r)\nelse:\n for i in range(l, r-1):\n\n for j in range(i + 1, r):\n sub = (i * j) % 2019\n print(j)\n if (min > sub):\n min =... | ['Wrong Answer', 'Accepted'] | ['s515191307', 's197677047'] | [3260.0, 2940.0] | [25.0, 62.0] | [516, 205] |
p02983 | u204842730 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int, input().split())\nif r-l > 2019:\n r = l + 2019\nans = 10 ** 9\nfor i in range(l,r+1):\n for j in range(i,r+1):\n if i==j:\n continue\n print(i,j)\n n = (i*j) % 2019\n if n < ans:\n ans = n\n if ans == 0:\n break\n if ans == 0... | ['Wrong Answer', 'Accepted'] | ['s430202993', 's823799148'] | [5364.0, 3060.0] | [158.0, 772.0] | [330, 195] |
p02983 | u207464563 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\nright = min(L+2019, R+1)\nminumum = 2019\n\nfor i in range(L,right):\n for j in range(i+1,right):\n minimum = min(minimum,(i*j) % 2019)\n\nprint(minimum)', 'L,R = map(int,input().split())\n\nif R-L >= 2019:\n print("0")\nelse:\n sL = L % 2019\n sR = R % 2019\n mi... | ['Runtime Error', 'Accepted'] | ['s094080480', 's105553618'] | [2940.0, 2940.0] | [17.0, 840.0] | [188, 265] |
p02983 | u208219327 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R=map(int,input().split())\nX=2019\nfor i in range (R-L):\n for j in range(R-L-i):\n if (L+i)*(L+i+j+1)%2019==0:\n X=0\n break\n elif X >(L+i)*(L+i+j+1)%2019:\n X=(L+i)*(L+i+j+1)%2019\n if X=0:\n break \nprint(X)\n', 'L,R=map(int,input().split())\nX... | ['Runtime Error', 'Accepted'] | ['s953311434', 's965770052'] | [2940.0, 2940.0] | [17.0, 96.0] | [271, 272] |
p02983 | u209275335 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['r,l = map(int,input().split())\nif l-r+1 >= 2019:\n print("0")\n exit()\nli = []\nfor i in range(l-r+1):\n li.append((r+i)%2019)\nli.sort()\nlia = []\nfor i in range(len(li)):\n for j in range(len(li)):\n lia.append((li[i]*li[j])%2019)\nprint(min(lia))', 'r,l = map(int,input().split())\nif l-r+1 >=... | ['Wrong Answer', 'Accepted'] | ['s809457255', 's643054793'] | [153484.0, 153792.0] | [967.0, 1087.0] | [259, 282] |
p02983 | u211160392 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["L,R = map(int,input().split())\nans = float('inf')\nfor i in range(min(2019,R-L+1)):\n for j in range(min(2019,R-L+1)):\n ans = min(ans,((L+i)*(L+j))%2019)\nprint(ans)", "L,R = map(int,input().split())\nans = float('inf')\nfor i in range(L,min(L+2019,R)):\n for j in range(L,min(L+2019,R)):\n if an... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s412720766', 's724328683', 's693079805'] | [3060.0, 3060.0, 3060.0] | [1980.0, 908.0, 781.0] | [172, 188, 168] |
p02983 | u212831449 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\n\nif r < 2019:\n print(l*(l+1)%2019)\n exit()\n\nfor i in range(l,r+1):\n if i%2019 == 0:\n print(0)\n exit()\n\n\n# ans = (l*(l+1))%2019\n# print(ans)\n', 'l,r = map(int,input().split())\n\nif r < 2019:\n print(l*(l+1))\n exit()\n\nfor i in range(l,r+1):\n... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s205186438', 's886473070', 's964792495'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 60.0] | [255, 186, 254] |
p02983 | u217556271 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["import math\nimport string\nimport itertools\nimport fractions\nimport heapq\nimport collections\nimport re\nimport array\nimport bisect\nimport sys\nimport random\nimport time\ninf = 10**9\n\n\ndef main():\n ans = 2018\n l, r = list(map(int, input().split()))\n for i in range(l, min(l+2019, r)+1):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s120065749', 's188798941', 's671256264'] | [6436.0, 5420.0, 5668.0] | [1240.0, 629.0, 626.0] | [430, 428, 430] |
p02983 | u219466830 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\n\nif l > r:\n l, r = r, l\n\nmod = 2020\n\nfor i in range(l, r+1):\n for j in range(i, r):\n tmp = i * j // 2019\n if tmp < mod:\n mod = tmp\n\nprint(tmp)', 'l, r = map(int, input().split())\n\nif l > r:\n l, r = r, l\n\nmod = 2020\n\nfor i in range(... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s272318043', 's637126615', 's711058015', 's298766020'] | [3060.0, 3060.0, 3060.0, 3060.0] | [2104.0, 2104.0, 2104.0, 521.0] | [206, 205, 233, 240] |
p02983 | u221580805 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\n\nans_list = []\nfor i in range(2019):\n if l + i > r:\n break\n ans = (l * (l + i)) % 2019\n ans_list.append(ans)\n if ans == 0:\n break\nprint(min(ans_list))', 'l, r = map(int, input().split())\n\nans_list = []\nfor i in range(2 * 10**9):\n if l + 1 > r:\n break\n an... | ['Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s197762716', 's847256165', 's603867585'] | [3060.0, 214680.0, 59316.0] | [18.0, 2117.0, 610.0] | [193, 198, 229] |
p02983 | u222138979 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = (int(_) for _ in input().split())\n\nif abs(l - r) == 1:\n print(l * r % 2019)\nelse:\n lower = l // 2019\n upper = r // 2019\n start = l % 2019\n stop = r % 2019\n if 2019 * (lower + 1) < r:\n print(0)\n else:\n if start == 0:\n print(0)\n elif stop == 0:\n... | ['Runtime Error', 'Accepted'] | ['s474280522', 's678982908'] | [3064.0, 3064.0] | [17.0, 353.0] | [607, 641] |
p02983 | u222643751 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\nans_l = []\nif R-L<2019:\n for i in range(L,R):\n for j in range(i+1,R+1):\n ans = (i*j)%2019\n ans_l.append(ans)\n print(min(ans_l)):\nelse:\n print(0)', 'L, R = map(int, input().split())\nans_l = []\nfor i in range(L,R):\n for j in range(i+1... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s375829187', 's537311149', 's259068112'] | [2940.0, 287380.0, 75332.0] | [17.0, 2121.0, 634.0] | [215, 245, 214] |
p02983 | u222668979 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\nans = 2019\ncnt = min(l + 2019, r)\nlr = [i%2019 for i in range(l,cnt+1)]\nfor i in range(len(lr)-1):\n for j in range(i + 1,len(lr)):\n ans=min(ans,i*j)\nprint(ans)\n', 'l, r = map(int, input().split())\nans = 2019\ncnt = min(l + 2019, r)\nfor i in range(l, cnt):\n for ... | ['Wrong Answer', 'Accepted'] | ['s854925545', 's609911937'] | [3060.0, 2940.0] | [622.0, 796.0] | [203, 173] |
p02983 | u225577738 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\n\nans = 2019\nR = min(R, L+4038)\nfor i in range(L, R):\n f = False\n for j in range(i, R):\n m = (i*j)%2019\n if m == 0:\n print(0)\n f = True\n break \n ans = min(ans, m)\n if f:\n break\nprint(ans)', 'L, R... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s011210489', 's445307558', 's551345343', 's655377400', 's904690497', 's490341689'] | [3064.0, 3060.0, 3700.0, 3316.0, 7668.0, 3060.0] | [65.0, 18.0, 2104.0, 740.0, 292.0, 62.0] | [295, 270, 248, 274, 347, 301] |
p02983 | u225627575 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['s = input().split()\nL = int(s[0])\nR = int(s[1])\n\nL = L%2019\nR = R%2019\nMIN = 2020\n\n\nfor i in range(L,R+1):\n for j in range(i,R+1):\n if i != j:\n mod = i*j\n print(mod)\n MIN = min(MIN,mod%2019)\nif R == 0 or L == 0:\n print(0)\nelif R - L == 1:\n print((R*L)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s138800161', 's151436081', 's539473797', 's675432488', 's918810680', 's187090812'] | [17744.0, 3060.0, 3064.0, 3064.0, 3060.0, 3064.0] | [2091.0, 2104.0, 64.0, 875.0, 2104.0, 65.0] | [362, 302, 364, 407, 292, 366] |
p02983 | u235376569 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\nL,R=[int(x) for x in input().strip().split()]\n\ntmp=10**9+1\nans=10**0+1\n\nfor i in range(L,R+1):\n for j in range(L,R+1):\n if i<=j:\n tmp=(i*j)%2019\n if ans==0:\n print(0)\n sys.exit()\n elif tmp<ans:\n ans=tmp\nprint(ans)\n', "l,r=map(int,input().split()... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s103618022', 's310233396', 's636236998', 's669770996', 's482073238'] | [3060.0, 9088.0, 9148.0, 2940.0, 9176.0] | [58.0, 23.0, 21.0, 989.0, 66.0] | [271, 201, 205, 176, 201] |
p02983 | u237513745 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\nl, r = map(int, input().split())\nm = 2019\n\nif r - l + 1 >= 2019 or l == 0:\n print(0)\nelse:\n min = (l%m * (l+1)%m)%m\n for i in range(l, r):\n if i%m == 0:\n print(0)\n sys.exit()\n for j in range(i+1, r+1):\n else:\n if min > (i%... | ['Runtime Error', 'Accepted'] | ['s522558369', 's536618205'] | [2940.0, 2940.0] | [17.0, 354.0] | [367, 261] |
p02983 | u238704641 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = list(map(int,input().split()))\nY = []\nfor i in range(L, R):\n if i == 0:\n j = 1\n Y.append((i * j) % 2019)\n elif i * j == 2019:\n Y.append([0])\n else:\n for j in range(i+1, R+1):\n Y.append((i * j) % 2019)\nprint(min(Y))\n', '\nL,R = list(map(int,input().spli... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s250606993', 's395804490', 's422416764', 's441151063'] | [358552.0, 358040.0, 2940.0, 3064.0] | [2126.0, 2126.0, 17.0, 297.0] | [269, 268, 340, 377] |
p02983 | u242031676 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['s, e = map(int,input().split())\nmn = min(map(lambda x:x%2019,range(s,e+1)))\nfor i in range(s, e+1):\n ans = min(ans, mn*i)\nprint(ans)', 'l, r = map(int, input().split())\n\nans = 2018\nfor i in range(l, min(r+1, l+2020)):\n for j in range(i+1, min(r+1, i+2020)):\n ans = min(ans, (i*j)%2019)\... | ['Runtime Error', 'Accepted'] | ['s250533223', 's584432464'] | [2940.0, 2940.0] | [2104.0, 1563.0] | [133, 182] |
p02983 | u243755204 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy as np\nL,R = map(int,input().split())\n\nnp1 = np.array(range(L,R+1))\nprint(np1)\n#np2 = np.multiply.outer(np1,np1)\n#print(np2)\n\n#np3 = np2%2019\n#np3[0,0] = 2019\n#np3[R-L,R-L]=2019\nnp2 = (np1*np1)%2019\nnp2[0] =2019\nnp2[R-L]=2019\nprint(np2)\nprint(np.amin(np2))', 'L,R = map(int,input().split())\... | ['Wrong Answer', 'Accepted'] | ['s272265733', 's213247027'] | [35640.0, 3316.0] | [2109.0, 890.0] | [292, 233] |
p02983 | u245960901 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy as np\n\ns = input().split()\nL=int(s[0])\nR=int(s[1])\nm=2019\ncount=0\nif R-L>2019:\n m=0\nelse:\n for j in range(L,R+1):\n for i in range(L,R+1):\n d=(i*j) % 2019\n m=min(d,m)\nprint(m)', 'import numpy as np\n\ns = input().split()\nmin=2019\nif int(s[0])-int(s[1])<=1... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s053838481', 's174328288', 's300088388', 's519719429', 's855313188', 's911790874'] | [12392.0, 14296.0, 21528.0, 12392.0, 12396.0, 12392.0] | [1970.0, 2108.0, 689.0, 150.0, 1140.0, 988.0] | [222, 281, 284, 307, 288, 220] |
p02983 | u246975555 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\nx = []\n\nif l =< 2019 =< r:\n print(0)\nelif r - l > 2018:\n print(0)\nelse:\n x = []\n for i in range(l, r):\n for j in range(i+1, r+1):\n m = i * j % 2019\n x.append(m) \n print(min(x))', 'l, r = map(int, input().split())\nx = []\ny = []\n \nfor i in range(l, r):... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s122174198', 's337305439', 's614616796', 's969918399'] | [2940.0, 416628.0, 394524.0, 75428.0] | [18.0, 2131.0, 2129.0, 658.0] | [227, 179, 185, 227] |
p02983 | u247769252 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\n\nL, R = map(int, sys.stdin.readline().split())\nmod = 2019\n\nmod_L = L%2019\nmod_R = R%2019\n\nif R - L > 2019:\n temp_i = mod_L\n temp_j = 2018\nelse:\n temp_i = mod_L\n temp_j = mod_R\n\nmin_mod = 9999\nfor i in range(mod_L, mod_R):\n print(i + 2019)\n for j in range(i + 1, mod_R + 1... | ['Wrong Answer', 'Accepted'] | ['s594264738', 's989790775'] | [3316.0, 3064.0] | [357.0, 347.0] | [383, 452] |
p02983 | u248670337 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['N = R - L\nA = []\nA.append(10000)\nif(L >= R):\n print(0)\nelif(L == 0):\n print(0)\nelse:\n if(N = 1):\n print((L * R) % 2019)\n else:\n for i in range(L, R + 1):\n for j in range(i + 1, R + 1):\n A.append((i * j) % 2019)\n print(min(A))', 'L, R = (int(x) f... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s448690642', 's637630469', 's314047075'] | [2940.0, 3064.0, 3060.0] | [17.0, 17.0, 933.0] | [284, 338, 193] |
p02983 | u249447366 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\n\nif r - l == 1:\n print(r * l % 2019)\n exit()\n \nans = 10 ** 5\nfor i in range(l, r - 1):\n for j in range(i + 1, r):\n print(i, j)\n n = (i * j) % 2019\n ans = min(ans, n)\n if n == 0:\n print(0)\n exit()\nprint(ans)\n... | ['Wrong Answer', 'Accepted'] | ['s940213217', 's477167849'] | [5428.0, 2940.0] | [184.0, 63.0] | [302, 225] |
p02983 | u249685005 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R=(int(x) for x in input().split())\nL_mod=L%2019\nR_mod=R%2019\nif L_mod>=R_mod:\n print(0)\nelse:\n print(L_mod*(L_mod+1s))\n', 'L,R=(int(x) for x in input().split())\nprint(0)', 'L,R=(int(x) for x in input().split())\nans=[]\nfor n in range(2019):\n if L+n>=R:\n break\n for l in range(n+1,2019... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s412442021', 's491541634', 's024600885'] | [2940.0, 2940.0, 75432.0] | [17.0, 17.0, 1398.0] | [128, 46, 261] |
p02983 | u252828980 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\nli = []\nif r-l>=2019:\n print(0)\nelif r-l<2019:\n for i in range(l,r):\n for j in range(i+1,r+1):\n li.append(i*j%2019)\n if i*j$2019 == 0:\n break\n if i*j$2019 == 0:\n break\n \nprint(min(li))', 'l,r... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s219312252', 's908562587', 's868493474'] | [2940.0, 3060.0, 3060.0] | [17.0, 891.0, 867.0] | [298, 240, 255] |
p02983 | u255673886 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int, input().split())\nn = r - l + 1\nif 2019<=n:\n print(0)\nelif 3<=n and n<2019:\n for k in range(l,r+1):\n if k%673==0:\n print(0)\n else:\n mod = 2019\n for i in range(l,r):\n for j in range(l+1,r+1):\n mod_new = (i*... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s153533520', 's849185386', 's864181057', 's173119380'] | [3064.0, 2940.0, 2940.0, 3060.0] | [21.0, 17.0, 17.0, 1584.0] | [567, 302, 228, 257] |
p02983 | u255821449 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['# -*- coding: utf-8 -*-\n\nL, R = map(int, input().split())\n\nmin = 2019\n\nif R - L > 2019:\n R = L + 2019\n\nfor i in range(L, R+1):\n for j in range(i, R+1):\n mod = (i*j) % 2019\n if mod < min:\n min = mod\n\nprint(min)', '# -*- coding: utf-8 -*-\n\nL, R = map(int, input().split())... | ['Wrong Answer', 'Accepted'] | ['s222837574', 's665490352'] | [3060.0, 3060.0] | [540.0, 508.0] | [240, 242] |
p02983 | u255943004 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = [int(i) for i in input().split()]\nif R-L >= 4038:\n print(0)\nelse:\n ans = []\n for i in range(L,R+1):\n ans.append(i % mod)\n ans = sorted(ans)\n print(ans[0]*ans[1])', 'L,R = [int(i) for i in input().split()]\nif R-L >= 4038:\n print(0)\nelse:\n ans = []\n for i in range(L,R+1... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s616806498', 's622180666', 's722005938'] | [2940.0, 3060.0, 8132.0] | [17.0, 18.0, 79.0] | [189, 211, 233] |
p02983 | u256031597 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\nC = []\nflag = False\nfor i in range(L, R+1):\n if i%2019==0:\n flag = True\n break\n else:\n C.append(i)\n \nif flag:\n print(0)\nelse:\n ans = 4080400\n for x, y in list(itertools.combinations(C, 2)):\n if (x*y)%2019<ans:\n ... | ['Runtime Error', 'Accepted'] | ['s485836545', 's304043615'] | [3060.0, 148284.0] | [18.0, 633.0] | [336, 357] |
p02983 | u262869085 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['\nn = 2019\nL,R =map(int,input().split())\nl = L%n\nN =min(2019,R-L+1)\nans = 2019\nfor i in range(N):\n i += l\n for j in range(i):\n j += l\n if ans > (i*j)%n:\n ans = (i*j)%n\nprint(ans)', '\nn = 2019\nL,R =map(int,input().split())\nl = L%n\nN =min(2019,R-L+1)\nans = 2019\nfor i in r... | ['Wrong Answer', 'Accepted'] | ['s742824370', 's190120154'] | [3064.0, 3060.0] | [1698.0, 633.0] | [208, 202] |
p02983 | u263352518 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import math\n\nx = input()\nx = x.split()\n\nl = int(x[0])\nr = int(x[1])\n\nif l % 2019 > r % 2019 or r-l >= 2018:\n print("0")\n exit()\n\n\nelse:\n min = 2019\n for i in range(r,l):\n for j in range(i+1,l):\n \tif (i*j)%2019 < min:\n min = (i*j)%2019\n print(min)', 'import math\n\nx = input()\n... | ['Wrong Answer', 'Accepted'] | ['s143036757', 's020568458'] | [3060.0, 3060.0] | [17.0, 428.0] | [266, 270] |
p02983 | u264508862 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['list(combinations([i for i in range(_[0],_[1]+1)],2)if _[1]-_[0]<2019else combinations([i for i in range(_[0],_[0]+2020)],2))', 'from itertools import combinations\n_=list(map(int,input().split()))\nprint(min([i[0]*i[1]%2019 for i in list(combinations([i for i in range(_[0],_[1]+1)],2)if _[1]-_[0]<2019else combinatio... | ['Runtime Error', 'Accepted'] | ['s326153162', 's660820231'] | [2940.0, 221116.0] | [17.0, 644.0] | [125, 231] |
p02983 | u265506056 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R=map(int,input().split())\nl=L//2019\nr=R//2019\nif l==r:\n for i in range(L,R+1):\n for j in range(i+1,R+1):\n a=i*j\n b=a%2019\n if c>b:\n c=b\n if c==0:\n break\n print(c)\nelse:\n print(0)', 'L,R=map(int,input().split())\nc=2019\... | ['Runtime Error', 'Accepted'] | ['s980105208', 's643925157'] | [3060.0, 3060.0] | [17.0, 52.0] | [263, 241] |
p02983 | u268318377 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import math\n\nl, r = map(int, input().split())\ne = 2019\ne1 = 3\ne2 = e // e1\n\nif r-l == 1:\n print(l*r % e)\nelse:\n if divmod(l,e2)[0] < divmod(r,e2)[0]:\n print(0)\n else:\n print(r*(r-1) % e)', 'import math\n\nl, r = map(int, input().split())\ne = 2019\ne1 = 3\ne2 = e // e1\n\nif r-l ==... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s774058881', 's994550782', 's706115820'] | [3060.0, 2940.0, 3060.0] | [20.0, 17.0, 758.0] | [209, 281, 246] |
p02983 | u268792407 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r=map(int,input().split())\nif r-l>=2019:\n print(0)\nelse:\n a=2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n if i==l and j=i+1:\n a=min((i%2019)*(j%2019)%2019,a)\nprint(a)', 'l,r=map(int,input().split())\nif r-l>=2019:\n print(0)\nelse:\n a=2019\n for i in range(l,r):\n for j in ... | ['Runtime Error', 'Accepted'] | ['s186356883', 's650732806'] | [2940.0, 3060.0] | [17.0, 938.0] | [194, 169] |
p02983 | u269235541 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\nS = set()\nT = set()\nif (R-L)>=673:\n print(0)\nelse:\n l = L%2019\n for i in range(R-L+1):\n S = S | {l+i}\n for i in S:\n for j in S:\n T = T | {(i*j)%2019}\n print(min(T))', 'L,R = map(int,input().split())\nS = list()\nn = R-L\nif n >= 67... | ['Wrong Answer', 'Accepted'] | ['s621316548', 's700119972'] | [3188.0, 6804.0] | [2104.0, 65.0] | [239, 230] |
p02983 | u273540356 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["L, R= list(map(int, input().split()))\n# array = np.arange(L, R+1)\n\ndef get_flg3():\n if R-L >= 3:\n return True\n elif R//3 != L//3:\n return True\n else:\n return False\n \n\ndef get_flg673():\n if R-L >= 673:\n return True\n elif R//673 != L//673:\n return Tru... | ['Wrong Answer', 'Accepted'] | ['s001365613', 's987077312'] | [3064.0, 3064.0] | [17.0, 34.0] | [534, 560] |
p02983 | u276204978 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\n\nres = 1000000007\n\namari = [i % 2019 for i in range(L, R + 1)]\nl = len(amari)\n\nif R - L + 1 > 2019:\n print(0)\nelse:\n for i in range(l + 1):\n a = amari[i]\n for j in range(i + 1, l + 1):\n b = amari[j]\n res = min(res, a * b % 2019)\... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s467476544', 's512211426', 's621884465', 's387690457'] | [848536.0, 3064.0, 2940.0, 3064.0] | [2157.0, 18.0, 18.0, 815.0] | [319, 326, 238, 318] |
p02983 | u279735925 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\nmin = 2019\nmodulo = 2019\nfor i in range(L, R + 1):\n base = (i * i) % 2019\n for j in range(i + 1, R + 1):\n modulo = (base + j) % 2019\n if (modulo < min):\n min = modulo\nprint(min)\n', 'L2, R2= map(int, input().split())\n\nL=L2%2019\nR=R2%2019\n\nhasamu=R2-L2\nkotae... | ['Wrong Answer', 'Accepted'] | ['s163049674', 's349529790'] | [2940.0, 3064.0] | [2104.0, 468.0] | [224, 274] |
p02983 | u281745878 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['List = list(map(int,input().split()))\nL = List[0]\nR = List[1]\ncount_dict = {}\ncount_list = []\nif R - L >= 2019:\n print(0)\nelse:\n for i in range(L,R+1):\n for j in range(i,R+1):\n count_dict[i,j] = (i * j) % 2019\n\n for i in count_dict.values():\n count_list.append(i)\n\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s138279217', 's869529381', 's586518507'] | [388180.0, 388184.0, 98544.0] | [2120.0, 2121.0, 1319.0] | [359, 357, 278] |
p02983 | u283520984 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = (int(i) for i in input().split()) \nS=[]\nj=0\nif R-L>=2:\n for i in range(L,R):\n S.append((L+j)%2019)\n j=j+1\n S.sort()\n for i in range(L,R):\n if S[i]%673==0 or S[0]==0:\n print(0)\n else:\n ans=(S[0]*S[1])%2019\n print(ans)\nelse:\n ... | ['Runtime Error', 'Accepted'] | ['s491988849', 's269277809'] | [279832.0, 2940.0] | [2121.0, 455.0] | [332, 236] |
p02983 | u286486951 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy as np\nL, R = map(int, input().split(" "))\narr = np.array(np.arange(L, R+1))\nmod_list = []\nmin_mod_list = []\nif (0 in (arr % 2019)) or (0 in arr):\n print(0)\nelse:\n for i in arr:\n# index_ = np.extract(i, arr)\n index_ = np.where(arr==i)\n for j in arr[int(index_[0])+1:]:\n mod_list... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s374216469', 's721561333', 's744630572'] | [1438848.0, 1438844.0, 12424.0] | [2108.0, 2108.0, 298.0] | [443, 441, 670] |
p02983 | u286955577 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['def solve():\n L, R = map(int, input().split())\n ans = 2019\n for i in range(L, R + 1):\n for j in range(i, R + 1):\n ans = min(ans, (i * j) % 2019)\n return ans\n\nprint(solve())', 'def solve():\n L, R = map(int, input().split())\n ans = 2019\n for i in range(L, R):\n for j in range(i + 1, R + 1):... | ['Wrong Answer', 'Accepted'] | ['s846857174', 's557435999'] | [2940.0, 2940.0] | [2104.0, 39.0] | [184, 225] |
p02983 | u288430479 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\nif r-l>=2018:\n print(2)\nelif r%2019>=0:\n print(0)\nelse:\n print(l%2019+(l+1)%2019)', 'l,r = map(int,input().split())\nm = 2018\nif r-l>=2019:\n print(0)\nelse:\n for i in range(l,r+1):\n for j in range(i+1,r+1):\n a = (i*j)%2019\n m = min(a,m)\n print(m)\n'] | ['Wrong Answer', 'Accepted'] | ['s889451827', 's543328145'] | [2940.0, 2940.0] | [18.0, 842.0] | [115, 176] |
p02983 | u290211456 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int, input().split())\nif r < 2019:\n\tprint((l*(l+1)) % 2019)\n\texit()\nelif r-l >= 2019:\n\tprint(0)\n\texit()\nelif r-l < 2019:\n\tif r % 2019 == 0 or l % 2019 == 0:\n\t\tprint(0)\n\t\texit()\n\telse:\n\t\tmini = 2018\n\t\tfor i in range(0,r-l):\n\t\t\tfor j in range(1,r-l+1):\n\t\t\t\tif i >= j:\n\t\t... | ['Wrong Answer', 'Accepted'] | ['s028805190', 's564815169'] | [14292.0, 3188.0] | [2104.0, 927.0] | [383, 368] |
p02983 | u294385082 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\nmod = 2019\n\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n mod = min(mod,(i*j)%2)\n if mod == 0:\n break\n if mod == 0:\n break\n \nprint(mod)', 'l,r = map(int,input().split())\nmod = 2019\n \nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n mod = min... | ['Wrong Answer', 'Accepted'] | ['s354183834', 's661703895'] | [3064.0, 2940.0] | [17.0, 59.0] | [191, 195] |
p02983 | u295294832 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R= [int(i) for i in input().split()]\nn=[]\nfor i in range(R-L+1):\t\n\tfor j in range(i+1,R-L+1):\n\t\ta = (L+i)*(L+j)%2019\n\t\tif a == 0:\n\t\t\tprint(0)\n\t\t\texit()\n\t\telse \n\t\t\tn.append((L+i)*(L+j)%2019)\nprint(min(n))\n', 'L,R= [int(i) for i in input().split()]\nn=[]\nfor i in range(R-L+1):\t\n\tfor j ... | ['Runtime Error', 'Accepted'] | ['s206755746', 's897063471'] | [2940.0, 6788.0] | [17.0, 92.0] | [206, 210] |
p02983 | u299840026 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = map(int, input().split())\nif r-l >= 2019:\n ans = 0\nelse:\n n = 2019\n l = l%n\n print(l)\n r = r%n\n print(r)\n ans = 2019\n a = min(l,r)\n b = max(l,r)\n\n for i in range(a,b):\n for j in range(a+1,b+1):\n print(i,j)\n ans = min(ans, (i*j)%n)\n\npr... | ['Wrong Answer', 'Accepted'] | ['s931179697', 's374491247'] | [13652.0, 3064.0] | [2104.0, 1546.0] | [308, 259] |
p02983 | u301908263 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\nl, r = list(map(int, input().split()))\n\nminmod = 2 * 10 ** 9\n\nprint(l,r)\n\nif r - l >= 2019:\n print(0)\n sys.exit()\n\nfor i in range(l,r):\n imod = i % 2019\n for j in range(i+1,r+1):\n jmod = j % 2019\n minmod = min(minmod, (imod * jmod) % 2019)\n if minmod == 0:\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s257451603', 's943638869', 's140136150'] | [3064.0, 3064.0, 3060.0] | [69.0, 64.0, 63.0] | [333, 333, 322] |
p02983 | u302292660 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\nx = []\nfor i in range(l,r-1):\n for j in range(i+1,r):\n res = (i*j)%2019\n x.append(res)\nxs = sorted(x)\nprint(x[1])', 'l,r = map(int,input().split())\nx = []\nif r-l>2019:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n res = (i*j)%2019\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s069530589', 's251440059', 's443267293', 's663953293', 's811859693', 's386073219'] | [311832.0, 2940.0, 103448.0, 319000.0, 4332.0, 75332.0] | [2123.0, 17.0, 2109.0, 2123.0, 2104.0, 625.0] | [151, 179, 149, 151, 182, 178] |
p02983 | u303846769 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['def solve(left, right):\n if right - left >= 2019:\n return 0\n l_mod = left % 2019\n r_mod = right % 2019\n if r_mod < l_mod:\n return 0\n ans = 2019\n for i in range(l_mod, r_mod + 1):\n for j in range(i + 1, r_mod + 1):\n ans = min(ans, i * j % 2019)\n return an... | ['Runtime Error', 'Accepted'] | ['s472822766', 's884879772'] | [3064.0, 3060.0] | [19.0, 1514.0] | [363, 209] |
p02983 | u304593245 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['\ndef solve():\n i = L//2019\n ans = 0\n while L <= 2019*i <= R:\n i += 1\n# print(i)\n if i >= 1:\n print(ans)\n else:\n ans = (L*(L+1)) % 2019\n print(ans)\n\n\nif __name__ == "__main__":\n L,R = list(map(int, input().split()))\n solve()\n', '\ndef solve():\n i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s795995169', 's992002451', 's388008393'] | [9100.0, 9100.0, 9196.0] | [117.0, 114.0, 50.0] | [276, 376, 378] |
p02983 | u305422591 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = [int(item) for item in input().split()]\nl, ml = divmod(L, 2019)\nr, mr = divmod(R, 2019)\nprint (l, ml)\nprint (r, mr)\nif (l==r):\n print((ml*(ml+1))%2019)\nelif (l < r):\n print(0)', 'L, R = [int(item) for item in input().split()]\nl, ml = divmod(L, 2019)\nr, mr = divmod(R, 2019)\nif (l==r):\n m = 2019\n... | ['Wrong Answer', 'Accepted'] | ['s289956216', 's914515584'] | [3064.0, 3064.0] | [17.0, 685.0] | [184, 232] |
p02983 | u306033313 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,n = map(int,input().split())\n\nans = 2018\nx = 2018\nx_min = 2018\nif l - n >= 673:\n ans = 0\nelif l - n > 2:\n for i in range(l,n+1):\n x = i % 673\n if x == 0:\n ans = 0\n bleak\n else:\n x = i % 2019\n if x < x_min:\n x_min =... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s037675414', 's372645998', 's552662419', 's866971222', 's705607080'] | [3064.0, 3064.0, 3064.0, 3060.0, 3064.0] | [2104.0, 17.0, 2104.0, 2104.0, 323.0] | [496, 526, 472, 356, 526] |
p02983 | u306664745 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r=map(int, input().split())\nif r-l>672:\n\tp=0\nelse:\n\tx=[]\n\tfor i in range(l, r):\n\t\tfor j in range(i+1, r+1):\n\t\t\tx.append(i*j%2019)\n\t\t\tif not p:\n\t\t\t\tbreak\n\t\tif not p:\n\t\t\tbreak\n\tp=min(x)\nprint(p)', 'l, r=map(int, input().split())\nif r-l>672:\n\tp=0\nelse:\n\tx=[]\n\tfor i in range(l... | ['Runtime Error', 'Accepted'] | ['s997370128', 's371918129'] | [3064.0, 6804.0] | [17.0, 46.0] | [195, 153] |
p02983 | u306950978 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l , r = map(int,input().split())\n\nif r - l >= 2020:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n p.append((i*j)%2019)\n print(min(p))', 'l , r = map(int,input().split())\np = []\nif r - l >= 2018:\n print(0)\nelse:\n for i in range(l,r):\n for j in ra... | ['Runtime Error', 'Accepted'] | ['s837260883', 's382660631'] | [2940.0, 75332.0] | [17.0, 606.0] | [179, 185] |
p02983 | u307516601 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import sys\nsys.setrecursionlimit(10**6)\n\nl, r = map(int, input().split())\n\nMOD = 2019\n\n#n = 2019\n#pf = {}\n#\n\n# while n % i == 0:\n# pf[i] = pf.get(i,0) + 1\n# n //= i\n#if n > 1: pf[n] = 1\n#print(pf)\n## 2019=3*673\n\nimport itertools\n\nl_mod = l%MOD\nr_mod = r%MOD\n\nif r-l > 2019:\n ... | ['Runtime Error', 'Accepted'] | ['s529518143', 's351937643'] | [2940.0, 3064.0] | [17.0, 57.0] | [552, 638] |
p02983 | u310381103 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['A=list(map(int,input().split()))\nt=True\nC=2019\nif t:\n for i in range(A[1]):\n for t in range(A[1]+1):\n if t>i and i>=A[0]:\n if i-t>2019:\n \tC=0\n t=False\n break\n else:\n if t*i%2019<C:... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s028417386', 's925609694', 's084623501'] | [3064.0, 19156.0, 3060.0] | [17.0, 2104.0, 40.0] | [349, 292, 286] |
p02983 | u311379832 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['inf = 2019\nL, R = map(int, input().split())\nans = 2018\ndf = R - L\nif df < 2019:\nfor i in range(L, R):\n for j in range(i + 1, R + 1):\n tmp = int((i%inf * j%inf) % inf)\n ans = min(ans, tmp)\n if ans == 0:\n break\n\nprint(ans)', 'inf = 2019\nL, R = map(int, input().split())\nans = 202... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s470025513', 's505105822', 's778750783', 's890506608', 's345885164'] | [2940.0, 3060.0, 2940.0, 3060.0, 3060.0] | [17.0, 19.0, 19.0, 18.0, 72.0] | [247, 229, 333, 295, 321] |
p02983 | u312913211 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['s=input()\n#s = ("2020 2040")\n#print(s) \ns = s.split(" ")\n\nL = int( s[0] )\nR = int( s[1] )\n\n\nresult =4.0e9 \nfor i in range(L,R):\n for j in range(i+1,R+1):\n mod = i*j % 2019\n print(i,j,i*j,mod)\n if result > mod:\n result = mod\n\nprint(result)\n', '\ns=input()\n#s = ("4... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s477491104', 's623473883', 's338252106'] | [46224.0, 3060.0, 3060.0] | [2104.0, 2104.0, 486.0] | [275, 242, 303] |
p02983 | u317018965 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import functools\nL, R = map(int, input().split())\nmod = 2019\n\n@functools.lru_cache(maxsize = None)\nfor i in range(L, R) :\n\tfor j in range(i + 1, R + 1) :\n\t\tif((i * j) % 2019 < mod) :\n\t\t\tmod = (i * j) % 2019\n\t\telse :\n\t\t\tpass\n\tif(mod == 0) :\n\t\tbreak\n\telse :\n\t\tpass\n\t\nprint(mod)', 'impor... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s754663371', 's940957445', 's521938681'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 41.0] | [275, 276, 336] |
p02983 | u318029285 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\n\nN = R - L + 1\nr = L % 2019\n\nif N >= 2019:\n print(0)\n exit()\n\nm1 = 2018\nm2 = 2017\nfor i in range(N):\n a = (r + i) % 2019\n if a < m1:\n m1 = a\n elif a < m2:\n m2 = a\n\nan = m1 * (m2 + 1)\nprint(an % 2019)', 'N = R - L + 1\nl = L % 2019\n\nif ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s589026409', 's779947296', 's199420348'] | [3064.0, 2940.0, 3060.0] | [20.0, 18.0, 80.0] | [261, 165, 227] |
p02983 | u321035578 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["import math\ndef main():\n l, r = map(int,input().split())\n if r - l >= 637:\n print(0)\n return\n l_mod = l % 2019\n r_mod = r % 2019\n ans = []\n if l_mod > r_mod :\n ans = [i for i in range(l_mod,2019)]\n ans.extend([i for i in range(r_mod+1)])\n else:\n ans... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s469109424', 's524969530', 's673505335'] | [3064.0, 3064.0, 3064.0] | [17.0, 83.0, 46.0] | [447, 534, 541] |
p02983 | u322999410 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = [int(x) for x in input().split()]\nm = 2019\n\nml = (l % 2019)\nmr = (r % 2019)\nt = l + 2019\nif r > t:\n m = 0\nelse:\n print(ml, mr)\n if ml < mr:\n for x in range(ml, mr):\n m = min(m, (x * (x+1)) % 2019)\n else:\n m = 0\nprint(m)', 'l, r = [int(x) for x in input().spli... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s677885683', 's997117590', 's684528099'] | [3060.0, 3060.0, 3064.0] | [18.0, 18.0, 642.0] | [263, 242, 284] |
p02983 | u323492289 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = input().split()\nl = int(l)\nr = int(r)\n\nif r - l >= 2019:\n print(0)\nelse:\n l = l % 2019\n r = r % 2019\n\n mod_min = 2019\n\n if l < r:\n for i in range(l, r):\n for j in range(i+1, r+1):\n print(i, j)\n mod = (i * j) % 2019\n ... | ['Wrong Answer', 'Accepted'] | ['s421152287', 's819915574'] | [15828.0, 3064.0] | [2104.0, 426.0] | [598, 351] |
p02983 | u329058683 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R=map(int,input().split())\nl=L//2019\nll=L%2019\nr=R//2019\nlll=L//673\nrrr=R//673\nif l<r or ll==0:\n print(0)\nelif lll>=1 and R-L>=3:\n print(0)\nelse:\n print(ll*(ll+1))\n', 'L,R=map(int,input().split())\nl=L//2019\nll=L%2019\nr=R//2019\nif l<r or ll==0 or :\n print(0)\nelse:\n print(ll*(ll+1))', 'L,R=map... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s382695111', 's390336766', 's559452239', 's747704551', 's039642115'] | [3060.0, 3064.0, 3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 763.0] | [169, 115, 256, 214, 178] |
p02983 | u329407311 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\n\nd = 10 ** 10\n\nif R -L > 2019:\n print(0)\nelse:\n N = R -L \n for i in range(N):\n for j in range(N):\n \n a = L+i\n b = L+j\n \n c = a * b % 2019\n d = min(c,d)\n print(d)', 'L,R = map(int,input().split())\n\nd = 10 ** 10\n\nif R -L > 2019:\n ... | ['Wrong Answer', 'Accepted'] | ['s625405179', 's909314968'] | [3060.0, 3060.0] | [2104.0, 1140.0] | [229, 236] |
p02983 | u330712095 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r = map(int,input().split())\ndiff = r - l\n\nif(diff >= 2019):\n print(0)\nelse:\n lmod = l % 2019\n rmod = r % 2019\n if(rmod < lmod):\n print(0)\n else:\n ans =2020\n for i in range(l,r+1):\n for j in range(i,r+1):\n if((i*j) % 2019 < ans):\n ans = (i*j) % 2019\n print(ans)... | ['Wrong Answer', 'Accepted'] | ['s930357581', 's942573371'] | [3060.0, 3064.0] | [413.0, 428.0] | [302, 304] |
p02983 | u335038698 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['# -*- coding utf-8 -*-\nL, R = map(int, input().split())\n\nL = L % 2019\nR = R % 2019 + (2019 if R >= 2019 else 0)\n\nans = 10000\n\n\nfor i in range(L, R):\n for j in range(i + 1, R + 1):\n ans = min(ans, (i*j) % 2019)\n\nprint(ans)\n', '# -*- coding utf-8 -*-\nL, R = map(int, input().split())\n\nL = L % ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s110131311', 's280899785', 's105623507'] | [2940.0, 3060.0, 3060.0] | [2103.0, 2103.0, 691.0] | [232, 210, 240] |
p02983 | u340153434 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = map(int, input().split())\nl_mod = L % 2019\nr_mod = R % 2019\nresult = 2019\nif l_mod > r_mod:\n print(0)\nelse:\n print(L_mod*(L_mod+1)%2019)', 'L, R = map(int, input().split())\nl_mod = L % 2019\nr_mod = R % 2019\n\nif l_mod > r_mod:\n print(0)\nelse:\n mod = (l_mod*(l_mod+1)) % 2019\n for i ... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s618110991', 's854303055', 's913177200', 's411216198'] | [2940.0, 12016.0, 3064.0, 3188.0] | [17.0, 1645.0, 17.0, 365.0] | [149, 319, 151, 281] |
p02983 | u340792767 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L, R = [int(x) for x in input().strip().split()]\n\nnew_L = (L*(L+1)) % 2019\nnew_R = (R*(R-1)) % 2019\nnum_range = new_R - new_L\nif num_range >= 2019 or num_range == 0 or L == 0: print(0)\nelse:\n delim_L = new_L % 2019\n delim_R = new_R % 2019\n if delim_L > delim_R: print(delim_R)\n else: print(delim_... | ['Wrong Answer', 'Accepted'] | ['s834605699', 's877922299'] | [3060.0, 75392.0] | [17.0, 400.0] | [310, 199] |
p02983 | u341267151 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l,r=map(int,input().split())\n\nif r-l>=2019:\n print(0)\nelse:\n m=2019\n for i in range(l,r+1,1):\n for j in range(l,r+1,1):\n m=min(i*j%2019,m)\n print(m)\n ', 'l, r = map(int, input().split())\n\nif r - l >= 2019:\n print(0)\nelse:\n m = 2019\n for i in range(l, r + 1, 1):\n for j i... | ['Wrong Answer', 'Accepted'] | ['s648707422', 's462224282'] | [9096.0, 9068.0] | [1364.0, 660.0] | [165, 206] |
p02983 | u344030307 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["l,r = map(int, input().split())\n\nif r//673 > (l-1)//673 and r-l = 2:\n print('0')\n\nelse:\n print((l%2019) * ((l+1)%2019))", "from itertools import combinations\n\nl,r = map(int, input().split())\n\nif r//673 > (l-1)//673 and r//3 >(l-1)//3:\n print('0')\n\nelse:\n cmb = list(combinations(range(l, r+1), 2)... | ['Runtime Error', 'Accepted'] | ['s571924059', 's085830273'] | [9016.0, 20288.0] | [24.0, 66.0] | [123, 266] |
p02983 | u345094945 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\nans = 1000000000\nfor i in range(L,R + 1):\n\tif ans == 0:\n\t\tbreak\n\t\t\n\tfor j in range(i,R + 1):\n\t\tif ans > i*j % 2019:\n\t\t\tans = i*j % 2019\n\t\t\tif ans == 0\n\t\t\t\tbreak\nprint(ans)', 'L,R = map(int,input().split())\nans = 10000000000\nfor i in range(L,R + 1):\n\tif a... | ['Runtime Error', 'Accepted'] | ['s638277481', 's878697384'] | [2940.0, 3060.0] | [17.0, 39.0] | [202, 208] |
p02983 | u350093546 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['a,b=map(int,input().split())\nmod=2019\nif b-a>=2018:\n print(0)\nelse:\n ans=0\n for i in range(a,b+1):\n for j in range(i+1,b+1):\n ans=max(ans,(i*j)%mod)\n print(ans)', "a,b=map(int,input().split())\nmod=2019\nif b-a>=2018:\n print('0')\nelse:\n ans=2018\n for i in range(a,b+1):\n for j in range(... | ['Wrong Answer', 'Accepted'] | ['s444356734', 's759507172'] | [3060.0, 2940.0] | [796.0, 790.0] | [172, 178] |
p02983 | u350578302 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['import numpy as np\n\nL, R = map(int, input().split())\n\ntmp = 0\nans = 100000\n\nif L * R < 2019:\n\ti = L\n\tj = R\n\ttmp = i * j % 2019\n\t\n\tif tmp < ans:\n\t\tans = tmp\n\nelif (L + 2019 - L%2019) + 1 <= R:\n\tif L <= L + 2019 - L % 2019 and L + 2019 - L % 2019 + 1 <= R:\n\t\ti = L + 2019 - L % 2019\n\t\tj = ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s151060827', 's178850750', 's246636717', 's312626279', 's385782890', 's416948265', 's776592874'] | [12520.0, 12396.0, 21792.0, 12520.0, 2940.0, 2940.0, 3060.0] | [149.0, 148.0, 329.0, 157.0, 19.0, 17.0, 61.0] | [797, 405, 654, 807, 444, 407, 187] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.