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 | u356539385 | 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(input().split())\nif int(R/2019)-int(L/2019)>=1 or (R/2019.is_integer)==True or (L/2019.is_integer)==True:\n\tprint(0)\nelif R-L>=3:\n\tif int((R+1346)/2019)-int(L/2019)>=1 or int(R/2019)-int((L-674)/2019)>=1:\n\t\tprint(0)\n\telif int((R+673)/2019)-int(L/2019)>=1 or int(R/2019)-int((L-1347)/2019)>=1:\n\t\tpr... | ['Runtime Error', 'Accepted'] | ['s588243103', 's267445424'] | [2940.0, 75412.0] | [17.0, 796.0] | [420, 168] |
p02983 | u357949405 | 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# L = 2020\n# R = 2040\ndiff = (R - L) % MOD\nnew_L = L % MOD\nnew_R = new_L + diff\n# print("diff:{}, new_L:{}, new_R:{}".format(diff, new_L, new_R))\n\nans = L*R%MOD\nfor i in range(new_L, new_R):\n for j in range(i+1, new_R+1):\n count += 1\n if ans >... | ['Runtime Error', 'Accepted'] | ['s452927783', 's354631650'] | [2940.0, 2940.0] | [17.0, 43.0] | [352, 244] |
p02983 | u358254559 | 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\nmi=10**10\nfor l in range(L,new_R+1):\n for r in range(L+1,new_R+1):\n mod = (l*r) % 2019\n if mod < mi:\n mi=mod\n if mi==0:\n print(mi)\n import sys\n sys.exit()\nprint(mi)', 'L, R = map(int, input().split())\n\n... | ['Runtime Error', 'Accepted'] | ['s286691049', 's168760910'] | [3060.0, 3060.0] | [17.0, 48.0] | [266, 247] |
p02983 | u359747364 | 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. | ["# Setup\nimport sys\nsys.setrecursionlimit(4100000)\n\nl,r = [int(i) for i in input().split()]\na = []\nl = l%2019\nr = r%2019\ntemp = float('inf')\nfor i in range(l,r+1):\n for k in range(i+1,r+1):\n print(i,k)\n if i*k%2019 < temp:\n temp = i*k%2019\nprint(temp)", "import sys\nsys.setrec... | ['Wrong Answer', 'Accepted'] | ['s712877025', 's435589676'] | [17876.0, 3060.0] | [2104.0, 326.0] | [278, 344] |
p02983 | u359837458 | 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 = [int(i) for i in input().split()]\n\nif R - L > 2019:\n print(0)\nelse:\n arr = np.array(range(L, R + 1))\n l4min = sorted(arr % 2019)\n l4max = sorted(arr % 2019, reverse=True)\n a_1 = (l4min[0] * l4min[1]) % 2019\n a_2 = (l4max[0] * l4max[1]) % 2019\n a_3 = (l4max[0] * l4min[0]) ... | ['Wrong Answer', 'Accepted'] | ['s404604381', 's058773271'] | [14408.0, 76132.0] | [152.0, 221.0] | [446, 282] |
p02983 | u360515075 | 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\nM = []\nfor i in range(L, R+1):\n for j in range(i+1, R+1):\n if i % 3 == 0 or j % 3 == 0:\n M.append (i * j / 3 % 673)\n else:\n M.append(i * j % 2019)\nif len(M) == 0:\n print(L)\nelse:\n print (min(M))', 'L, R = map(int, input().split())\nif R-L >= 2019:\n pr... | ['Wrong Answer', 'Accepted'] | ['s759679976', 's954956804'] | [222232.0, 75412.0] | [2117.0, 623.0] | [247, 160] |
p02983 | u361381049 | 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 = 100000000000000000\nif r -l > 2019:\n print('0')\nelse:\n for i in range(l-1,r+1):\n for j in range(i+1,r+1):\n if (i*j)%2019 < ans:\n ans = (i*j)%2019\nprint(ans)", "l, r = map(int, input().split())\nans = 100000000000000000\nif r -l > 2019:\n print('0')\nels... | ['Wrong Answer', 'Accepted'] | ['s056976302', 's747092962'] | [3060.0, 3060.0] | [413.0, 433.0] | [211, 212] |
p02983 | u363599046 | 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\n\nfor i in range(l,r):\n\tfor j in range(i+1,r+1):\n\t\ttemp = (i*j)%2019\n\t\tprint("{} {}".format(i,j))\n\t\tif ans > temp:\n\t\t\tans = temp\n\t\t\tif ans == 0:\n\t\t\t\tprint(ans)\n\t\t\t\texit()\nif ans == 2019:\n\tans = l*r\nprint(ans)\n\n', 'l, r = map(int,input()... | ['Wrong Answer', 'Accepted'] | ['s461977952', 's650491661'] | [5364.0, 3060.0] | [143.0, 43.0] | [253, 254] |
p02983 | u366482170 | 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())\nmod1 = []\nmod2 = []\nfor i in range(l,r+1):\n mod1.append(i%2019)\nprint(mod1)\nfor i in range(len(mod1)-1):\n for j in range(i+1,len(mod1)):\n mod2.append((mod1[i]*mod1[j])%2019)\nprint(mod2)\nprint(min(mod2))', 'l, r = map(int, input().split())\nmod1 = []\nmod2 = []\nfor i in... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s048687296', 's271995709', 's385612407'] | [471576.0, 482840.0, 75436.0] | [2132.0, 2133.0, 772.0] | [240, 241, 327] |
p02983 | u367147039 | 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=0\nd=r-l\nif d>=2019:\n d=2019\n\nfor i in range(l%2019,(l+d)%2019):\n for j in range(i+1,(l+d)%2019+1):\n a=(i*j)%2019\n if a<ans:\n a=ans\nprint(ans)\n', 'l,r=map(int,input().split())\nans=2018\nfor i in range(l,min(r,l+2020)):\n for j in range(i+1... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s104777472', 's633832889', 's635924113'] | [2940.0, 2940.0, 2940.0] | [380.0, 19.0, 463.0] | [206, 201, 204] |
p02983 | u371385198 | 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 l = []\n for i in range(L, R + 1):\n for j in range(i, R + 1):\n l.append(i * j % 2019)\n print(min(l))', 'L, R = map(int, input().split())\nif R - L > 2019:\n print(0)\nelse:\n l = []\n for i in range(L, R + 1):\n for j in range... | ['Wrong Answer', 'Accepted'] | ['s800196571', 's614006899'] | [80856.0, 80960.0] | [518.0, 525.0] | [178, 182] |
p02983 | u372102441 | 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. | ['\nLR = input().split()\nL = int(LR[0])\nR = int(LR[1])\nS = []\n\nif R - L >= 2019:\n print("0")\nelse:\n for i in range(L+1,R):\n for j in range(i+1,R+1):\n S.append(i * j % 2019)\n print(min(S))\n\n', '\nLR = input().split()\nL = int(LR[0])\nR = int(LR[1])\nS = []\n\nif R - L > 2019:\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s844925800', 's991518134', 's660332937'] | [75324.0, 75444.0, 75332.0] | [575.0, 615.0, 568.0] | [213, 211, 212] |
p02983 | u373047809 | 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. | ['x, y = map(int,input().split())\nprint([x, -1][x%y])', 'l, r = map(int,input().split())\ns = range(l, r+1)[:673]\nprint(min(i*j % 2019 for i in s for j in s if i<j))'] | ['Runtime Error', 'Accepted'] | ['s880928471', 's930222405'] | [2940.0, 2940.0] | [17.0, 74.0] | [51, 107] |
p02983 | u374974389 | 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 = [i % 2019 for i in range(L,R+1)]\nprint(n)\ni = n[n.index(min(n))]\nn[n.index(min(n))] = 2020\nj = n[n.index(min(n))]\nprint(i * j % 2019)', 'L,R = map(int,input().split())\nans = []\nif(R - L >= 2019):\n print(0)\nelse:\n for i in range(L,R):\n for j in range(i+1,R+1)... | ['Wrong Answer', 'Accepted'] | ['s939648357', 's847065618'] | [849048.0, 75332.0] | [2157.0, 585.0] | [168, 196] |
p02983 | u375695365 | 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\nans1 = 0\nans2 = 0\nmin1 = 1000000000\nmin2 = 10000000000\n\n\nfor i in range(min(n, 2024)):\n # print(l+i)\n if (l+i) % 2019 == 0:\n print(0)\n break\nelse:\n ans = 10000000000\n for i in range(min(n, 2019)):\n for j in range(i+1, min(n, 20... | ['Wrong Answer', 'Accepted'] | ['s130933681', 's161315506'] | [9204.0, 9172.0] | [519.0, 528.0] | [448, 478] |
p02983 | u377834804 | 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, input().split())\n\nif R-L >= 2019:\n print('0')\n sys.exit()\n\nL = L % 2019\nR = R % 2019\nif L > R:\n print('0')\n\nmmin = 2019\nfor i in range(L, R):\n for j in range(j, R+1):\n mmin = min(mmin, (i*j)%2019)\nprint(mmin)", "import sys\n \nL, R = map(int, input().split())\n \nif... | ['Runtime Error', 'Accepted'] | ['s354720255', 's840515821'] | [3064.0, 3064.0] | [18.0, 658.0] | [243, 249] |
p02983 | u378171362 | 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 <= 2019 and 2019 <= R) :\n print(0)\nelse :\n min = (2 * (10 ** 9)) ** 2 + 1\n for i in range(L, R):\n for j in range(L + 1, R):\n print(i, j, i * j % 2019)\n mod = i * j % 2019\n if (min > mod) :\n min = mod\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s209652378', 's485063650', 's700989350'] | [8544.0, 8544.0, 2940.0] | [437.0, 391.0, 808.0] | [494, 490, 198] |
p02983 | u379959788 | 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\nans= []\nif R - L >= 2019:\n print(0)\nelse:\n for i in range(l, r):\n \u3000\u3000\u3000\u3000for k in range(l+1, r+1):\n \u3000\u3000\u3000\u3000ans.append(i * k % 2019)\nprint(min(ans))', 'L, R = map(int, input().split())\n\nif R - L > 2... | ['Runtime Error', 'Accepted'] | ['s499991240', 's061294189'] | [3188.0, 3060.0] | [17.0, 351.0] | [232, 332] |
p02983 | u382407432 | 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 pass', 'L, R = map(int,(input().split()))\nif(R-L >= 2019):\n print("0")\nelse:\n pass\n', 'L, R = map(int,(input().split()))\nmod_min = 2018\nif(R-L >= 673):\n print("0")\nelse:\n for i in range(L,R):\n for j in range(L+1,R+1):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s578899982', 's669300301', 's528598002'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 70.0] | [75, 77, 240] |
p02983 | u382431597 | 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 = list(map(int, input().split()))\nimin = 0\n\nif r-l+1 <=2019:\n for i in range(1,2019):\n for j in range(i+1,2020):\n if imin > (i*j)%2019:\n imin = (i+j)%2019\nelse:\n print(0)', 'import sys\n\nl,r = list(map(int, input().split()))\nimin = 0\n\nif r-l+1 <=20... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s022060642', 's085399978', 's120278900', 's169246602', 's413619817', 's775366773'] | [2940.0, 3060.0, 3060.0, 3064.0, 3064.0, 3060.0] | [381.0, 427.0, 380.0, 17.0, 17.0, 461.0] | [225, 237, 241, 468, 468, 243] |
p02983 | u382639013 | 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\n if R - L >= 2019:\n print(0)\n exit()\n \nans = float('inf')\nfor i in range(L, R):\n for j in range(i+1, R+1):\n t = i*j%2019\n ans = min(ans,t)\nprint(ans)", "L, R = list(map(int,input().split()))\n\nif(R - L) >= 2019:\n print(0)\n exit(... | ['Runtime Error', 'Accepted'] | ['s092381070', 's936033098'] | [2940.0, 3060.0] | [17.0, 1000.0] | [219, 211] |
p02983 | u383416302 | 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\nfrom sys import stdin\n\nL,R=[int(x) for x in stdin.readline().rstrip().split()]\n\nL1,L2=divmod(L,2019)\nR1,R2=divmod(R,2019)\n\nret=L2*R2\nret1=ret % 2019\n\nprint(ret1,flush=True)', 'l,r=map(int,input().split())\na=0\nif r-l<2019:\n \ta=min([(i*j)%2019 for i in range(l,r+1) for j in range(i+1,r... | ['Wrong Answer', 'Accepted'] | ['s934802335', 's168670022'] | [13812.0, 75312.0] | [152.0, 402.0] | [191, 122] |
p02983 | u383450070 | 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())\namari = 2018\nfor i in range(l, l+2020):\n for j in range(i+1, l+2020):\n temp = (i*j)%2019\n if temp < amari:\n amari = temp\nprint(amari)', 'l,r=map(int,input().split())\namari = 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... | ['Wrong Answer', 'Accepted'] | ['s347972372', 's787889312'] | [2940.0, 3060.0] | [562.0, 515.0] | [174, 218] |
p02983 | u385244248 | 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())\nM=2019\nfor i in range(L,R):\n for j in range(i+1,R+1) :\n if (i*j)%2019 < MOD :\n M = (i*j)%2019\nprint (M)\n\n', 'L,R=map(int,input().split())\nM=2019\nimport sys\nfor i in range(L,R):\n for j in range(i+1,R+1) :\n if (i*j)%2019 < M :\n M = (i*... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s390403977', 's915551739', 's958075724', 's847036225'] | [2940.0, 3952.0, 2940.0, 3316.0] | [17.0, 94.0, 17.0, 39.0] | [155, 219, 214, 237] |
p02983 | u390694622 | 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 = 2019\nL,R = list(map(int,input().split()))\nR = min(R, L + MOD)\nnums = range(L,R+1)\nanswer = MOD\nfor i in range(L,R+1):\n for j in range(max(i+1,L), R+1):\n c = (i*j)%MOD\n if c < answer:\n print(c,i,j)\n answer = min(c,answer)\nprint(answer)', 'MOD = 2019\nL,R = list(map(i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s171097076', 's358002154', 's426467954'] | [3064.0, 3064.0, 3064.0] | [1035.0, 748.0, 892.0] | [275, 243, 279] |
p02983 | u391328897 | 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. | ['left, right = map(int, input().split())\nimod = []\njmod = []\n\nfor i in range(left, right):\n imod.append(i % 2019)\n\nfor i in range(imod.index(min(imod))+1, len(imod)):\n jmod.append(imod[i])\n\nprint((min(imod) + min(jmod)) % 2019)\n', 'left, right = map(int, input().split())\nmod = []\nif right - left > 2... | ['Runtime Error', 'Accepted'] | ['s434720448', 's786543568'] | [473560.0, 149296.0] | [2134.0, 1229.0] | [233, 226] |
p02983 | u394731058 | 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())\nfor i in range(l, r-1):\n for j in range(i+1, r):\n if i*j%2019 == 0:\n print(0)\n sys.exit()\n elif ans > i*j%2019:\n ans = i*j%2019\nprint(ans)', 'import sys\nl, r = map(int, input().split())\nans = l*r%2019\nfor i in range(l, r):\n for j in range... | ['Runtime Error', 'Accepted'] | ['s558683615', 's355852609'] | [2940.0, 2940.0] | [20.0, 59.0] | [204, 220] |
p02983 | u396391104 | 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 = []\n\nl = l%2019\nr = r%2019 + 2019\n\nfor n in range(l,r+1):\n for m in range(n+1,r+1):\n tmp = n*m%2019\n if tmp == 0:\n print(0)\n exit()\n ans.append(tmp)\nprint(min(ans))', 'l,r=map(int,input().split())\nans = [0]\n\nl = l%2019\nr ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s546734538', 's985815606', 's617773964'] | [3060.0, 6804.0, 6788.0] | [18.0, 48.0, 52.0] | [244, 238, 214] |
p02983 | u397953026 | 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\nif r-l+1 >= 2019:\n print(0)\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n print("i,j,",i,j)\n ans = min( (i*j) % 2019, ans)\n print(ans)', 'l,r = map(int,input().split())\nans = 2019\nif r-l+1 >= 2019:\n print(0)\nelse:... | ['Wrong Answer', 'Accepted'] | ['s013319725', 's758219254'] | [33764.0, 3060.0] | [2104.0, 738.0] | [223, 193] |
p02983 | u399754648 | 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\nimport numpy as np \ndef minimize():\n L, R=map(int,input().split())\n lis=[]\n for i in range(L,R):\n for j in range(i+1, R+1):\n x=(i*j) %2019\n lis.append(x)\n if len(np.uniq(lis))==2018:\n break\n lis=np.array(lis)\n ans=lis.min()\n prin... | ['Runtime Error', 'Accepted'] | ['s271433494', 's198381123'] | [413640.0, 100660.0] | [2135.0, 733.0] | [325, 554] |
p02983 | u400221789 | 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+1)>2019:\n print(0)\nelse:\n mod=[]\n ans=[]\n for i in range(r-l+1):\n mod.append((l+i)%2019)\n for i in range(r-l):\n for j in range(i,r-l+1):\n ans.append((mod[i]*mod[j])%2019)\n print(min(ans))', 'l,r=map(int,input().split())\nif(r-l+1)>2019:\n print(0)\nelse... | ['Wrong Answer', 'Accepted'] | ['s867790869', 's064294793'] | [75568.0, 75436.0] | [642.0, 671.0] | [240, 244] |
p02983 | u401487574 | 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 l-r>=2019:\n print(0)\n exit()\nans = 2019\nfor i in range(l,r+1):\n for j in range(i,r+1):\n ans = min(ans,(i*j)%2019)\n', 'l,r = map(int,input().split())\nif r-l>=2019:\n print(0)\n exit()\nans = 2019\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ... | ['Wrong Answer', 'Accepted'] | ['s802936783', 's450572329'] | [2940.0, 2940.0] | [2104.0, 745.0] | [164, 177] |
p02983 | u402672613 | 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. | ["if(modR <= modL):\n modMin = 0\nelse:\n modMin = 2018\n\nfor i in range(modL,modR):\n for j in range(i+1,modR+1):\n modIJ = (i*j)%2019\n # print(i)\n # print(j)\n # print('----')\n #print(modMin)\n #print(modIJ)\n #print('---')\n if modIJ < modMin:\n ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s248185647', 's313766794', 's316152440', 's373849890'] | [2940.0, 17040.0, 3060.0, 3060.0] | [18.0, 2104.0, 17.0, 379.0] | [340, 396, 317, 337] |
p02983 | u403269302 | 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()]\n\nremainder_list = []\n\nif r - l >= 2019:\n\tprint(0)\nelse :\n\tfor x in range(l, r):\n \tremainder_list.append((l * (x + 1)) % 2019)\n\nremainder_list.sort()\nprint(remainder_list[0])\n \t', 'import sys\n\nl, r = [int(x) for x in input().split()]\n\nremainder_list = ... | ['Runtime Error', 'Accepted'] | ['s422305086', 's955404299'] | [2940.0, 81428.0] | [17.0, 1269.0] | [223, 290] |
p02983 | u403331159 | 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\nans=10**12\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n flag=i*(j%MOD)\n if flag==0:\n print(0)\n exit()\n ans=min(ans,flag)\nprint(ans)', 'L,R=map(int,input().split())\nMOD=2019\nans=10**9\nfor i in range(L,R):\n for j i... | ['Wrong Answer', 'Accepted'] | ['s354226549', 's338324306'] | [3060.0, 3060.0] | [985.0, 64.0] | [220, 215] |
p02983 | u407311141 | 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\nmod_l = l % 2019\nmod_r = r % 2019\n\nif (r - l >= 2019) or (mod_r > mod_l):\n print('0')\nelse:\n rem = 2018\n for i in range(mod_l, mod_r):\n for j in range(i+1, mod_r+1):\n if rem > (i*j)%2019:\n continue\n else:\n rem = (i*j)%2019\n\n print(rem)\n"... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s060431854', 's460886262', 's795443218', 's134277120'] | [3060.0, 3064.0, 3064.0, 3060.0] | [17.0, 663.0, 708.0, 344.0] | [300, 294, 294, 299] |
p02983 | u407372398 | 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 = 2019\n\nfor i in range(r - l):\n t = 2019\n for j in range(i + 1, r - l + 1):\n tmp = (l + i) * (l + j) % 2019\n print(l + i,l + j,tmp)\n if tmp > t:\n break\n t = tmp\n if a > tmp:\n a = tmp\n\nprint(a)', 'l, r = map... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s335290600', 's573451771', 's900299692'] | [27476.0, 30944.0, 2940.0] | [2104.0, 2104.0, 56.0] | [290, 221, 330] |
p02983 | u407891541 | 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\nS=input()\n\ntmp=S.split()\n\nL=int(tmp[0])\nR=int(tmp[1])\n\nn=L*R\n\nprint(n%2019)\n', 'import numpy as np\n\nS=input()\n\ntmp=S.split()\n\nL=int(tmp[0])\nR=int(tmp[1])\n\nL_list=np.sort(np.array(range(L,R+1),dtype=np.int32)%2019)\n#R_list=L_list.copy()\n\nprint(L_list)\n#print(R_list)\n\nprint(L_list[0]*L_list... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s103958327', 's539461740', 's405562214'] | [2940.0, 20024.0, 3064.0] | [17.0, 2108.0, 609.0] | [78, 213, 321] |
p02983 | u408375121 | 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 + 1 >= 2019:\n print(0)\nelse:\n ans = 2019\n for i in range(r, l-1):\n for j in range(i+1, l):\n mod = (i*j) % 2019\n ans = min(ans, mod)\n print(ans)', 'l, r = map(int, input().split())\nif r - l + 1 >= 2019:\n print(0)\nelse:\n ans = 2019\n for i in ra... | ['Wrong Answer', 'Accepted'] | ['s373240253', 's790325360'] | [9100.0, 9160.0] | [27.0, 715.0] | [202, 203] |
p02983 | u409064224 | 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\n#f = 0\nl = []\n\nif R-L>=2019:\n #f = 1\n print(0)\n exit()\n\nfor i in range(L,R):\n for j in range(i+1,R+1):\n l.append((i*j)%2019)\nelse:\n l.sort()\n\nif 3 in l and 673 in l:\n print(0)\nelif 3 in l:\n print(min(l),637)\nelif 637 in l:\n print(min(... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s399600868', 's608821800', 's515604893'] | [81376.0, 2940.0, 81428.0] | [1508.0, 18.0, 1247.0] | [328, 330, 208] |
p02983 | u411302151 | 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\n\nif R-L>=L:\n print(0)\nelse:\n for l in range(L,R):\n for r in range(l+1, R+1):\n z = min(z, ((l % 2019) * (r % 2019)) % 2019)\n print(z)\n', 'L, R = map(int, input().split())\n\nz = 2019\n\nif R-L>= 2019:\n print(0)\nelse:\n for l in range(L,R):\... | ['Runtime Error', 'Accepted'] | ['s763858107', 's913581994'] | [2940.0, 3060.0] | [18.0, 970.0] | [194, 207] |
p02983 | u412563426 | 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\ngen = 7\nl, r = map(int, input().split())\n\nfor i in range(l, l+gen+1):\n if i%gen == 0:\n check = i - l\n\nif r-l>=check:\n print(0)\n exit()\n\nll = min(l%gen, r%gen)\nrr = max(l%gen, r%gen)\n\nif rr-ll == 1:\n print((ll*rr)%gen)\n exit()\n\nans = 10*... | ['Wrong Answer', 'Accepted'] | ['s787113844', 's693287658'] | [3064.0, 3064.0] | [18.0, 668.0] | [402, 405] |
p02983 | u414699019 | 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())\nlength=R-L\nstart=L%2019\nif start+length<3:\n print((start*(start+1))%2019)\nelse:\n print(0)', 'L,R=map(int,input().split())\nmod_min=2019\nzero_judge=0\nfor i in range(L,R):\n if zero_judge==1:\n break\n else:\n for j in range(i+1,R+1):\n mod_calc=... | ['Wrong Answer', 'Accepted'] | ['s994684406', 's579576707'] | [2940.0, 3060.0] | [17.0, 44.0] | [124, 358] |
p02983 | u415154163 | 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 itertools\nLR = input().split(' ')\nL = int(LR[0])\nR = int(LR[1])\n\nmin_num = 2000000001\nstore = [0,0]\nnum_list = range(L,R+1)\ncombination_list = list(itertools.combinations(num_list,2))\n\nfor comb in combination_list:\n mod = (comb[0] * comb[1] ) % 2019\n if mod < min_num:\n min_num = mod\n... | ['Runtime Error', 'Accepted'] | ['s625449458', 's081329568'] | [2015896.0, 3064.0] | [2272.0, 44.0] | [390, 333] |
p02983 | u422272120 | 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 = 2019\n\nfor i in range(L,R+1):\n for j in range(L,R+1):\n if i == j:\n pass\n else:\n x = (i*j)%2019\n if x < n:\n n = x\n \n if x == 0:\n print (x)\n exit ()\nprint... | ['Wrong Answer', 'Accepted'] | ['s609066707', 's472585380'] | [2940.0, 2940.0] | [91.0, 83.0] | [308, 316] |
p02983 | u422673384 | 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 = lr[0]\nr = lr[1]\n \nans=2019\nl_2019 = l % 2019\nr_2019 = r % 2019\n \nfor i in range(l_2019,r_2019):\n for j in range(i+1, r_2019+1):\n new_ans = (i * j) % 2019\n if new_ans < ans:\n ans = new_ans\n \nprint(ans)', 'l = lr[0]\nr = lr[1]\n \nans... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s034995898', 's329302441', 's034799289'] | [3064.0, 3060.0, 3060.0] | [17.0, 17.0, 1566.0] | [272, 239, 209] |
p02983 | u423585790 | 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. | ["#!/usr/bin/env python3\nfrom collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop\nimport sys\nimport math\nimport bisect\nimport random\nimport itertools\nsys.setrecursionlimit(10**5)\nstdin = sys.stdin\nbisect_left = bisect.bisect_left\nbisect_right = bisect.bisect_righ... | ['Wrong Answer', 'Accepted'] | ['s745927641', 's765280260'] | [3700.0, 3700.0] | [610.0, 610.0] | [1828, 1847] |
p02983 | u427485170 | 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 os, sys, re, math\n\n(L, R) = [int(n) for n in input().split()]\n\nresult = None\nfor i in range(L, R + 1):\n if i % 2019 == 0:\n result = 0\n break\n\nif result is None:\n if abs(2019 - L % 2019) < abs(2019 - R % 2019):\n result = (L * (L + 1)) % 2019\n else:\n result = ((... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s013187016', 's282678426', 's757130185'] | [3188.0, 3188.0, 3316.0] | [19.0, 19.0, 810.0] | [338, 334, 219] |
p02983 | u436982376 | 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\nr_min = min(l+2019,r)\ninf = float('inf')\nans = inf\n\nfor i in (l,r_min):\n for j in (i+1,r_min):\n modu = i*j\n if modu%2019 <= ans:\n print(modu)\n ans = modu%2019\n\nprint(ans)\n", "l,r = map(int,input().split())\n\nr_min = min(l+2019,r)\ni... | ['Wrong Answer', 'Accepted'] | ['s483647875', 's263115692'] | [2940.0, 3188.0] | [17.0, 538.0] | [242, 232] |
p02983 | u437351386 | 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()))\ns=[]\nimport sys\n\nif r-l>2050:\n print(0)\nelse:\n for i in range(l,r+1):\n s.append(i%2019)\n\nn=len(s)\nans=30000\nfor i in range(n-1):\n for j in range(i+1,n):\n ans=min(ans,(i*j)%2019)\n\nprint(ans)\n\n \n \n ', 'l,r=list(map(int,input().split()))\ns=[]\nimport sy... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s042309863', 's876019423', 's593221865'] | [9184.0, 9120.0, 9052.0] | [522.0, 522.0, 776.0] | [243, 256, 474] |
p02983 | u440161695 | 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=100100100\nfor i in range(min(R-L,2000),min(R,2001):\n for j in range(i+1,min(R,2002)):\n if ans>((i*j)%2019):\n ans=((i*j)%2019)\nprint(ans)', 'L,R=map(int,input().split())\nans=100100100\nfor i in range(R-L,R):\n for j in range(i+1,R+1):\n if ans>((i*j)%2019):\n a... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s629529493', 's671025669', 's731079116', 's747737795', 's860342824', 's303271580'] | [2940.0, 2940.0, 3060.0, 2940.0, 2940.0, 3060.0] | [17.0, 2107.0, 48.0, 48.0, 17.0, 695.0] | [178, 151, 206, 162, 11, 239] |
p02983 | u440334385 | 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 = 2018\ni = L\nif R > 2019:\n print(0)\n for i in range(L, R):\n for j in range(i+1, R+1):\n num = (i*j) % 2019\n mod = min(mod, num)\n if mod == 0:\n break\nprint(mod)', 'L, R = map(int, input().split())\nmod = 2018\ni... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s035578378', 's341302103', 's398995831'] | [3064.0, 3060.0, 3060.0] | [2104.0, 17.0, 63.0] | [256, 262, 264] |
p02983 | u447456419 | 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\nrem_l = l%2019\nrem_r = r%2019\n\nans = -1\n\nif r - l >= 2019:\n ans = 0\n\nelif rem_l >= rem_r:\n ans = 0\n\nelse:\n ans = float('INF')\n for i in range(l, r):\n for j in range(i, r):\n temp = (i * j) % 2019\n if temp < ans:\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s435851627', 's482714098', 's383248695'] | [9120.0, 9124.0, 9160.0] | [484.0, 25.0, 450.0] | [325, 325, 331] |
p02983 | u450956662 | 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\nl = L // mod\nr = R // mod\n\nif l != r:\n print(0)\nelse:\n l_ = L % mod\n r_ = R % mod\n ans = 2019\n for i in range(l_, r_):\n for j in range(i+1, r_+1):\n a = i * j % mod\n ans = min(ans, a)\n if ans == 1:\n ... | ['Runtime Error', 'Accepted'] | ['s693121765', 's305976021'] | [2940.0, 9172.0] | [17.0, 718.0] | [363, 200] |
p02983 | u450983668 | 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=range(l,r+1)[:2019]\nprint(min(i*j%2019for i in s for j in s if i<j', 'l,r=map(int,input().split())\ns=range(l,r+1)[:2019]\nprint(min(i*j%2019for i in s for j in s if i<j))'] | ['Runtime Error', 'Accepted'] | ['s599351596', 's110500294'] | [2940.0, 2940.0] | [17.0, 528.0] | [97, 99] |
p02983 | u452824632 | 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 = int(input())\nR = int(input())\n\nans = 2019*2019\n\nif(R-L >=2019):\n print(0)\nelse:\n for i in range(L,R-1):\n for j in range(i+1,R):\n ans = np.minimum(ans,(i*j)%2019)\n if(ans == 0):\n print(0)\n exit()\n print(ans)', 'im... | ['Runtime Error', 'Accepted'] | ['s954241834', 's362060835'] | [14440.0, 12396.0] | [150.0, 490.0] | [297, 310] |
p02983 | u453526259 | 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())\ngap = r-l\n\nvlist = []\n\n v = (l+x) % 2019\n vlist.append(v)\n\nvlist.sort()\n#print(vlist)\n\n#res = i*j % 2019\nprint(vlist[0]*vlist[1])', 'l,r = map(int, input().split())\ngap = r-l\n\nvlist = []\nmini = 2019\nxlist = []\n\nfor x in range(gap+1):\n v = (l+x) % 2019\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s173979419', 's233829243', 's263308435', 's681846872', 's738043747', 's834561302'] | [2940.0, 350872.0, 3064.0, 2940.0, 3064.0, 3064.0] | [17.0, 2125.0, 100.0, 17.0, 104.0, 104.0] | [167, 308, 446, 166, 448, 516] |
p02983 | u453634575 | 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\nif r-l >= 2019:\n print(0)\nelse:\n l %= 2019\n r %= 2019\n res=2019\n if l > r:\n print(0)\n else:\n for i in range(r-l):\n for j in range(r-l):\n if l < r:\n if res > l*(l+1):\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s033936389', 's293315222', 's411833937', 's673836317'] | [3064.0, 3064.0, 3064.0, 3064.0] | [2104.0, 17.0, 2104.0, 400.0] | [382, 200, 396, 387] |
p02983 | u456376495 | 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. | ['n1,n2 = map(int,input().split())\n\nn1mod = n1 % 2019\nn2mod = n2 % 2019\n\na = (n1mod * n2mod) % 2019\n\nprint(a)', 'L,R = map(int,input().split())\n\nilist = [False for x in range(2020)]\na=2*10**9\nfor i in range(R+1)[L:L+2020]:\n imod = i % 2019\n if ilist[imod]:\n continue\n ilist[imod] = True\n for j in ... | ['Wrong Answer', 'Accepted'] | ['s290639572', 's721081116'] | [2940.0, 3060.0] | [17.0, 1946.0] | [107, 292] |
p02983 | u457289860 | 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 >= 2018 :\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)\n', 'l,r = map(int,input().split())\n\nif r - l >= 2018 :\n print(0)\nelse:\n ans = 2019\n for i in r... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s216230943', 's420652936', 's710096918', 's328748453'] | [2940.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 773.0] | [199, 195, 199, 195] |
p02983 | u459590249 | 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()))\nc=[0]*(r-l+1)\nfor i in range(l,r+1):\n\tc[i-l]=i%2019\nminc=min(c)\nprint(minc*minc+1))', 'l,r=list(map(int, input().split()))\nminmod=2018\nif r-l>=2018:\n\tprint(0)\nelse:\n\tfor i in range(l,r+1):\n\t\tfor j in range(i+1,r+1):\n\t\t\tminmod=min(minmod,(i*j)%2019)\n\tprint(minm... | ['Runtime Error', 'Accepted'] | ['s281397784', 's089351683'] | [2940.0, 3188.0] | [17.0, 796.0] | [119, 176] |
p02983 | u462329577 | 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. | ['#!/bin/env python3\ndef main():\n l,r = map(int,input().split())\n res = 0\n if r-l >= 2019:\n pass\n else:\n for i in range(l%2019,r-2019*(l//2019)):\n for j in range(i,r-2019*(l//2019)):\n res = min(res,i*j%2019)\n\n print(res)\n\nmain()\n', '#!/bin/env python3\ndef main():\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s431796840', 's680980289', 's717810488'] | [2940.0, 2940.0, 3064.0] | [524.0, 512.0, 517.0] | [268, 272, 282] |
p02983 | u464205401 | 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()))\nans=[]\nif r-l==1:print(r*l%2019)\nelse:\n for i in range(l,r-1):\n for j in range(l+1,r):\n ans.append(i*j%2019)\n print(min(ans))', 'l,r=list(map(int,input().split()))\nm=2018\nfor i in range(l,min(r+1,l+2019)):\n for j in range(i+1,min(r+1,l+2019)):\n m=min(m,i... | ['Wrong Answer', 'Accepted'] | ['s493331998', 's766691734'] | [4364.0, 2940.0] | [2104.0, 781.0] | [174, 146] |
p02983 | u465101448 | 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()]\nif L//2019 != R//2019:\n mod_min=0\nelse:\n mod_list=[]\n\n mod_min = 10**10\n for i in range(L,R):\n for j in range(i,R+1):\n if mod_min >= i*j%2019:\n mod_min = i*j%2019\n \n if mod_min == 0:\n ... | ['Wrong Answer', 'Accepted'] | ['s553549295', 's203348514'] | [9032.0, 9092.0] | [47.0, 51.0] | [414, 416] |
p02983 | u466143662 | 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\nminimum = l%2019\nmaximum = r%2019\n\nans = 10000\nif r-l >= 673:\n print(0) \nelif r-l < 2019:\n for i in range(l,r):\n if i%673 ==0:\n flag = 1\n ans = min(i*(i+1)%2019,ans)\n \n if flag==1:\n print(0)\n else:\n print(ans)', '... | ['Runtime Error', 'Accepted'] | ['s667366541', 's742733125'] | [3060.0, 3060.0] | [17.0, 734.0] | [297, 187] |
p02983 | u466968658 | 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=list(map(int,input().split()))\n#A=list(map(int,input().split()))\nprint((N[0]%2019)*(N[1]%2019)%2019)', 'N=list(map(int,input().split()))\n#A=list(map(int,input().split()))\nif N[1]>=((673-N[0]%673)+N[0]):\n if N[1]==N[0]+1:\n p=(N[1]*N[0])%2019\n else:\n p=0\nelse:\n a=N[0]%2019\n b=N[1]%2019\n max1=2018\... | ['Wrong Answer', 'Accepted'] | ['s527486091', 's250980096'] | [2940.0, 3064.0] | [17.0, 35.0] | [102, 329] |
p02983 | u471212175 | 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,input().split())\nif R-L>673:\n print(0)\nelse:\n A =[]\n if L == 0 and R-L>1:\n L = 1\n else:\n print(0)\n sys.exit()\n for i in range(R-L+1):\n n = (L+i)\n if n % 673 == 0 and (R-L+1) >= 3:\n print(0)\n sys.exit()\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s121468354', 's169283078', 's957971503'] | [3064.0, 3060.0, 3060.0] | [17.0, 17.0, 84.0] | [384, 312, 323] |
p02983 | u474423089 | 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 tmp = 2019\n if l//2019 < r//2019:\n print(0)\n else:\n for i in range(l,r):\n if tmp > (i*(i+1))%2019:\n tmp = (i*(i+1))%2019\n if tmp == 0:\n print(tmp)\n\nif __name__ == '__main__':\n main... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s197092544', 's323445396', 's641229774', 's654865790', 's077758531'] | [2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 342.0, 341.0, 341.0, 344.0] | [307, 311, 315, 315, 315] |
p02983 | u475675023 | 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())\nmn=2018\nif r-l>2019:\n for i in range(l%2019,r%2019+1):\n for j in range(l%2019,r%2019+1):\n if i<j:\n mn=min(mn,(i*j)%2019)\n print(mn)\nelse:\n print(0)', 'l,r=map(int,input().split())\nmn=2018\nif r-l<2019:\n for i in range(l%2019,r%2019+1):\n for j in range(l%2... | ['Wrong Answer', 'Accepted'] | ['s573340432', 's050573788'] | [3060.0, 3060.0] | [183.0, 910.0] | [194, 194] |
p02983 | u477977638 | 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=10**9\nif R-L>2019:\n print(0)\nelse:\n L=L%2019**2\n R=R%2019**2\n for i in (L,R):\n for j in (L,R):\n ans=min(ans,(i*j)%2019)\n print(ans)\n', 'import sys\n\nread = sys.stdin.buffer.read\ninput = sys.stdin.buffer.readline\ninputs = sys.stdin.buffer.readlines\n\n\n# rst... | ['Wrong Answer', 'Accepted'] | ['s717374048', 's326838230'] | [2940.0, 3064.0] | [17.0, 730.0] | [178, 1109] |
p02983 | u481250941 | 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 ans = L * R % 2019\n if R - L >= 2019\n ans = 0\n else:\n l = L % 2019\n r = R % 2019\n if l == r:\n ans = 2*l\n else:\n ans = min(l*(l+1), l*r)\n\n print(ans)\n\n\nif __name__ == '__main__':\n ... | ['Runtime Error', 'Accepted'] | ['s304957493', 's196764460'] | [2940.0, 2940.0] | [17.0, 606.0] | [309, 289] |
p02983 | u486065927 | 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. | ['b, c = map(int, input().split())\nif c-b >=2018:\n print(0)\nelse:\n t = b%2019\n if t+(c-b+1) >= 2019:\n print(0)\n else:\n import numpy as np\n ind = [t+i for i in range(c-b+1)]\n print(np.dot(ind, np.array(ind).T)%2019)', 'b, c = map(int, input().split())\nif c-b >=2018:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s408520409', 's989800502', 's663873563'] | [22144.0, 15824.0, 16024.0] | [321.0, 156.0, 182.0] | [252, 273, 399] |
p02983 | u486646943 | 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 enum import Enum\nfrom queue import Queue\nimport collections\nimport numpy as np\n\n\nimport sys\nimport math\n\nBIG_NUM = 2000000000\nMOD = 1000000007\nEPS = 0.000000001\n\nL,R = map(int,input().split())\nmin = BIG_NUM\nif (R%2019 - L%2019)>=1:\n print(0)\nelse:\n for i in range(L,R+1):\n for j in... | ['Wrong Answer', 'Accepted'] | ['s516986181', 's932091061'] | [13312.0, 12488.0] | [2109.0, 177.0] | [459, 461] |
p02983 | u488127128 | 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 x = int(input())\n l = [i**j for i in range(1,x+1) for j in range(1,x+1) if i**j<=x]\n return max(l)\n \nif __name__ == '__main__':\n print(solve())", "def solve():\n l,r = map(int, input().split())\n if r-l<2019:\n arr = []\n for i in range(l,r):\n for... | ['Runtime Error', 'Accepted'] | ['s615847513', 's614632372'] | [3060.0, 6808.0] | [18.0, 58.0] | [176, 347] |
p02983 | u489061952 | 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())\ntmpmin = 2020\ntmprem = i*r%2019\nif l*r<2019:\n print(l*(l+1))\nelse:\n for i in range(l, r+1):\n for j in range(l+1, r+1):\n tmp = (i*j)%2019\n tmpnxt = (i*(j+1))%2019\n if tmp < tmpmin:\n tmpmin = tmp\n ... | ['Runtime Error', 'Accepted'] | ['s828211144', 's121919995'] | [3060.0, 3060.0] | [17.0, 72.0] | [364, 362] |
p02983 | u489559146 | 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\nflag = 0\nmin_ = 2020\nfor i in range(L,R):\n for j in range(i+1,R+1):\n s = (i*j) % 2019\n if s == 0:\n print('0')\n exit()\n if s < min_:\n print(i,j)\n min_ = s\nprint(min_)\n", "L, R = map(int,input().split('... | ['Wrong Answer', 'Accepted'] | ['s323762341', 's272561618'] | [3060.0, 2940.0] | [45.0, 47.0] | [270, 247] |
p02983 | u492447501 | 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 goto import goto, label\n\nS = input()\n\nS = S.split()\n\nL = int(S[0])\nR = int(S[1])\nmin = 2 * (10**10)\n\nflg = 0\n\nfor i in range(L, R, 1):\n if flg == 0:\n for j in range(i+1, R+1, 1):\n mod = (i*j) % 2019\n if mod < min:\n min = mod\n if min ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s084772131', 's492100625', 's530791809', 's902469060', 's991186884', 's669088288'] | [3060.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [17.0, 17.0, 2104.0, 17.0, 17.0, 41.0] | [395, 395, 216, 308, 256, 366] |
p02983 | u496212176 | 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 = 10 ** 9\nfor i in range(L, R+1):\n for j in range(i, R):\n mod = i * j % 2019\n if ans > mod:\n ans = mod\n elif mod == 0:\n ans = 0\n break\n else:\n continue\n break\nprint(ans)', 'L, R = map(int , input... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s382041448', 's757101374', 's826916208', 's919123664'] | [3060.0, 3060.0, 2940.0, 3060.0] | [48.0, 45.0, 17.0, 46.0] | [278, 256, 272, 258] |
p02983 | u497047499 | 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)\nN = int(2019)\n \nans = (l * (l + 1)) % N\ncount = 0\nfor i in range(l,r-1):\n for j in range(l+1,r):\n if(count >= (N - 1)):\n flag = True\n break\n if(ans > (i * j) % N):\n ans = (i * j) % N\n count += 1\n if flag:\n break\n \nprint(ans... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s006477892', 's023394805', 's707372075', 's872536452'] | [3064.0, 2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0, 795.0] | [301, 306, 269, 205] |
p02983 | u498136917 | 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 = int(input())\nd = list(map(int, input().split()))\nd.sort()\n\nhalf = int(n/2)\n\nn1 = d[half-1]\nn2 = d[half]\n\nif n2-n1 == 0:\n print(0)\n exit()\nelse: \n print(n2-n1)', 'l, r = map(int, input().split())\n\nif r-l >= 673:\n print(0)\n exit()\nelse:\n ans = 2018\n for i in range(l, r):\n ... | ['Runtime Error', 'Accepted'] | ['s842796029', 's538977850'] | [9108.0, 9020.0] | [23.0, 62.0] | [171, 205] |
p02983 | u502389123 | 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\ndiff = R - L\n\nif diff < 2019:\n ans = 10 ** 10\n for i in range(R, L):\n for j in range(i+1, L+1):\n ans = min(ans, i * j % 2019)\nelse:\n ans = 0\n\nprint(ans)', 'L, R = map(int, input().split())\n\na = R % 2019\nb = L % 2019\n\nif a > 2019 // 2:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s185140718', 's315604532', 's266451510'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 798.0] | [213, 156, 213] |
p02983 | u502731482 | 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. | ['\nL, R = map(int, input().split())\n\nmini = (L * R) % 2019\n\nif R - l >= 2019:\n print(0)\n exit()\n\nfor i in range(L % 2019, R % 2019):\n for j in range(i + 1, R % 2019 + 1):\n mini = min(mini, (i * j) % 2019)\n\n\n\nprint(mini)', '\nL, R = map(int, input().split())\n\nmini = (L * R) % 2019\n\nif ... | ['Runtime Error', 'Accepted'] | ['s998732898', 's108512888'] | [3060.0, 3060.0] | [17.0, 691.0] | [233, 233] |
p02983 | u503111914 | 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())\nmod = 2019\nif R - L >= 2019:\n print(0)\nelse:\n m = 10**5\n for i in range(L+1,R+1):\n if L * i % mod == 0:\n print(0)\n sys.exit()\n print((L * i) % mod)', 'import sys\nL,R = map(int,input().split())\nmod = 2019\nif R - L >= 2019:... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s522167848', 's594370531', 's118283186'] | [9140.0, 9184.0, 9164.0] | [30.0, 25.0, 84.0] | [230, 241, 300] |
p02983 | u505420467 | 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. | ["if __name__ == '__main__':\n l, r = map(int, input().split())\n tmp = []\n for i in range(l, min(r + 1, l + 4029)):\n print(i)\n tmp.append(i % 2019)\n tmp.sort()\n print(tmp[0] * tmp[1] % 2019)\n", "if __name__ == '__main__':\n l, r = map(int, input().split())\n if r - l >= 2018:\n... | ['Wrong Answer', 'Accepted'] | ['s816985255', 's542864348'] | [3444.0, 2940.0] | [21.0, 678.0] | [217, 317] |
p02983 | u508927589 | 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())\nif r-l >= 2019:\n print(0)\n sys.exit()\n\ntemp = 2019\nfor i in range(1,min(r-l+1,2020)):\n temp = min(temp,(l+i)%2019)\n \nprint(temp*(temp+1))', 'l,r = map(int,input().split())\nans = 99999999999999\nif r-l >= 2019:\n ans = 0\n\nl %= 2019\nr %= 2019\n\nfor... | ['Wrong Answer', 'Accepted'] | ['s871443996', 's108537188'] | [3060.0, 3060.0] | [18.0, 693.0] | [191, 207] |
p02983 | u509911932 | 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 L % 2019 == 0:\n low = L // 2019\nelse:\n low = L // 2019 + 1\nhigh = R // 2019\nif low <= high:\n \n print(0)\nelse:\n print(L*(L+1))\n', 'L, R = map(int, input().split())\nif L % 2019 == 0:\n low = L // 2019\nelse:\n low = L // 2019 + 1\nhigh = R // 2019\n\n... | ['Wrong Answer', 'Accepted'] | ['s300840441', 's746131487'] | [2940.0, 2940.0] | [17.0, 469.0] | [219, 395] |
p02983 | u512293334 | 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())\nresults = []\nfor n in range(1):\n if diff > 2019:\n ret = 0\n break\n for i in range(L, R):\n for j in range(i+1,R+1):\n results.append((i*j)%2019)\n ret = min(results)\nprint(ret)', 'L, R = map(int, input().split())\ndiff = R-L\nfor n in... | ['Runtime Error', 'Accepted'] | ['s742001647', 's194900857'] | [3060.0, 75392.0] | [18.0, 401.0] | [250, 260] |
p02983 | u515638999 | 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 = (l-1)//2019\nb = r/2019\nif a!=b:\n print('0')\n exit()\nif l<2019:\n a = l%2019\nelif l>2019:\n a = l%2019\n b=(l+1)%2019\nif r<2019:\n b = (l+1)%2019\nelif r>2019 and l<2019:\n print('0')\n exit()\nprint((a*b)%2019)", "l, r = map(int, input().split())\na = (l-1)//2019\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s473771326', 's501614064', 's881414636', 's541606686'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 414.0, 377.0] | [247, 239, 233, 235] |
p02983 | u515723930 | 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\nans = -1\nfor i in range(L, min(R, L + 2018)):\n for j in range(i+1, min(R, L+2018) + 1):\n ans = min(ans,(i % MOD) * (j % MOD))\n if ans == 0:\n break\nprint(ans)', 'L,R = map(int,input().split())\nMOD = 2019\nans = -1\nfor i in range(L, min(R, ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s622067995', 's888882998', 's342160864'] | [3060.0, 3060.0, 3188.0] | [1008.0, 604.0, 73.0] | [227, 218, 248] |
p02983 | u516554284 | 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=2018\nfor i in range(l,r+1):\n for j in range(i,r+1):\n if c<((i*j)%2019):\n c=(i*j)%2019\nprint(c)\n', 'l,r=map(int,input().split())\nc=2018\nfor i in range(l,r+1):\n for j in range(i,r+1):\n if c<(i*j%2019):\n c=i*j%2019\nprint(c)', 'l,r=map(int,input().split())\nc=... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s331390755', 's548509507', 's670722611', 's720771075', 's730852500', 's840657802', 's941716888', 's286145667'] | [2940.0, 2940.0, 3060.0, 2940.0, 3060.0, 3060.0, 3060.0, 3060.0] | [2104.0, 2104.0, 19.0, 2107.0, 17.0, 812.0, 1764.0, 813.0] | [135, 130, 213, 133, 213, 235, 213, 220] |
p02983 | u516687307 | 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=[]\nif ((r//2019)!=(l//2019)):\n a=0\n s.append(a)\nelif((r-l!=1)):\n for i in range(l,r-1):\n for j in range(l+1,r):\n #print(i,j)\n a=(i*j)%2019\n #print(a)\n s.append(a)\n if (a==0):\n break\ne... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s872851674', 's978097102', 's562008032'] | [2940.0, 93596.0, 59304.0] | [17.0, 2109.0, 592.0] | [357, 297, 355] |
p02983 | u517152997 | 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# \nimport math\nimport sys\nimport itertools\nimport numpy as np\n\n\n\nl,r = map(int, input().split())\n\nl = r + (l-r) % 2019\n\nanswer = 9999\nfor j in range(l,r+1):\n for i in range(l,j):\n a = i % 2019\n b = j % 2019\n answer = min(answer,(a*b)%2019)\n\nprint(ans... | ['Wrong Answer', 'Accepted'] | ['s723795696', 's260755599'] | [12396.0, 12424.0] | [149.0, 1210.0] | [323, 364] |
p02983 | u517389396 | 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() \nprint(s) \nprint(s[0]) \nprint(s[1]) \n\na = int(s[0])\nb = int(s[1])\nm = 2019\n\nfor i in range(a,b+1):\n for j in range(i+1,b+1):\n m = min((i*j)%2019 ,m)\n if m == 0: \n break\n if m == 0:\n break\n\nprint(m)\n\n', 's = input().split() \n\na = int(s[0])\... | ['Wrong Answer', 'Accepted'] | ['s338150051', 's135270357'] | [3060.0, 3064.0] | [59.0, 128.0] | [361, 309] |
p02983 | u517930510 | 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 = []\nfor i in range(l,r-1):\n for j in range(i+1,r):\n a = i*j\n b = a%2019\n l.append(b)\nprint(min(l))', 'l,r = map(int, input().split())\nif r-l+1>2019:\n print(0)\n exit()\nL = []\nfor i in range(l,r):\n for j in range(i+1,r+1):\n a = i*j\n b = a%2019\n L.... | ['Runtime Error', 'Accepted'] | ['s413675932', 's885949139'] | [2940.0, 59208.0] | [17.0, 626.0] | [143, 206] |
p02983 | u518042385 | 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,m=map(int,input().split())\nif m-n>=2018:\n print(0)\nelse:\n l=[]\n for i in range(n,m+1):\n l.append(i%2019)\n t=10000\n for i in range(len(l)):\n for j in range(len(l)):\n if t>(l[i]*l[j])%2019:\n t=(l[i]*l[j])%2019\n print(t)', 'n,m=map(int,input().split())\nif m-n=>2018:\n print(0)\nel... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s049723771', 's690169791', 's515956262'] | [3064.0, 2940.0, 3060.0] | [1011.0, 17.0, 528.0] | [243, 145, 250] |
p02983 | u520276780 | 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 = []\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 tmp = i*j%2019\n ans.append(tmp)\n \npritn(mimn(ans))', 'l, r = map(int, input().split( ))\nans = []\nif r - l>=2019:\n print(0)\nelse:\n for i in range(l,r):\n ... | ['Runtime Error', 'Accepted'] | ['s598198512', 's623117630'] | [75332.0, 75332.0] | [642.0, 625.0] | [194, 210] |
p02983 | u521323621 | 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\nl2 = l // 2019\nr2 = r // 2019\n\nif l2 != r2:\n print(0)\nelse:\n ans=2019\n for i in range(l2, r2):\n for j in range(i+1, r2 + 1):\n ans = min(ans, (i * j) % 2019)\n print(ans)\n ', 'l, r = map(int, input().split())\n\nl2 = l // 2019\nr2 = r // 2019\n\nif l2 != r2:\... | ['Wrong Answer', 'Accepted'] | ['s656800042', 's319890573'] | [2940.0, 2940.0] | [17.0, 785.0] | [218, 214] |
p02983 | u522293645 | 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\nnl = l%MOD\ndiff = r-l\nli1 = []\nli2 = []\n\nprint(nl)\n\nif diff>2018:\n print(0)\nelse:\n for i in range(diff+1):\n li1.append(nl+i)\n for j in range(len(li1)):\n for k in range(j+1,len(li1)):\n li2.append(li1[j]*li1[k]%MOD)\n print(min(li2))', 'l,r = ma... | ['Wrong Answer', 'Accepted'] | ['s271954710', 's512900601'] | [75444.0, 75440.0] | [693.0, 686.0] | [288, 277] |
p02983 | u523545435 | 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\nl=L%2019\nr=R%2019\n\nans=0\n\nif R-L<2019 and l<r:\n D=[]\n for i in range(l,r):\n for j in range(i+1,r+1):\n D.append((i*j)%2019)\n\nprint(ans)', 'L,R=map(int,input().split())\n\nl=L%2019\nr=R%2019\n\nans=0\n\nif R-L<2019 and l<r:\n D=[]\n for i in range... | ['Wrong Answer', 'Accepted'] | ['s767713168', 's798349846'] | [75412.0, 75412.0] | [498.0, 499.0] | [188, 203] |
p02983 | u524489226 | 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\nl = l%2019\nr = r%2019\n\nlist_score = []\nfor i in range(l+1, r+1):\n for j in range(l+1, r+1):\n list_score.append(i*j%2019)\n print(i*j%2019)\n\nprint(int(min(list_score)))\n', 'l, r = map(int, input().split())\n\nl = l%2019\nr = r%2019\n\nif l > r:\n r += 20... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s258801039', 's318853085', 's552310776', 's831609968', 's956833983', 's322455020'] | [85760.0, 75376.0, 77784.0, 75412.0, 3064.0, 75416.0] | [2110.0, 540.0, 2108.0, 510.0, 17.0, 490.0] | [218, 216, 270, 191, 317, 357] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.