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 | u527977536 | 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\nmin = 2018\nif l == 0 or r == 0:\n min = 0\nelse:\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 if mod < min:\n min = mod\nprint(min)', 'L, R = map(int, input().split())\nl = L % 2019\nr =... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s028373567', 's735212936', 's535409725'] | [18260.0, 15316.0, 3064.0] | [2104.0, 2104.0, 421.0] | [250, 250, 284] |
p02983 | u528124741 | 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 ret = 2020\n for i in range(l,r+1,1):\n for j in range(l,r+1,1):\n ret = min(ret,(i*j)%2019)\n\nprint(ret)\n', 'l,r = map(int,input().split(" "))\n\nif r-l > 2019:\n print(0)\nelse:\n ret = 2020\n for i in rang... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s161646831', 's356955525', 's528896323', 's749701596', 's973748679', 's418750463'] | [2940.0, 3064.0, 3060.0, 3060.0, 30580.0, 3060.0] | [1523.0, 1512.0, 17.0, 18.0, 2104.0, 828.0] | [196, 194, 112, 52, 229, 211] |
p02983 | u529012223 | 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 mod = 2019\n for i in range(L, R+1):\n for j in range(i, R+1):\n m = i * j % 2019\n if m < mod:\n mod = m\n print(mod)', 'L, R = map(int, input().split())\n\nif R - L >= 2019:\n print(0... | ['Wrong Answer', 'Accepted'] | ['s798845216', 's383627664'] | [3060.0, 3060.0] | [536.0, 524.0] | [237, 241] |
p02983 | u529180657 | 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\nif R - L >= 2019:\n print(0)\nelse:\n m = 2019\n for i in range(R, L+1):\n m = min(m, i)\n if m == 0:\n print(0)\n else:\n if R % 2019 == m:\n print(m * (L % 2019) % 2019)\n else:\n print(m * (m+1) % 2019)\n \n ', 'L, R = map(int, input().spli... | ['Wrong Answer', 'Accepted'] | ['s690358026', 's940012918'] | [2940.0, 3060.0] | [17.0, 748.0] | [270, 179] |
p02983 | u530335051 | 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 >= r%2019:\n print(0)\nelif l%2019 == 0 or r%2019 == 0:\n print(0)\nelse:\n print((l%2019*r%2019)%2019)', 'l, r = map(int, input().split())\n\nif l%2019 >= r%2019:\n print(0)\nelif l%2019 == 0 or r%2019 == 0:\n print(0)\nelse:\n h = []\n for i in rang... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s241373147', 's940994312', 's955036301', 's390908328'] | [2940.0, 75436.0, 75508.0, 75428.0] | [17.0, 983.0, 989.0, 996.0] | [151, 276, 307, 309] |
p02983 | u531220228 | 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 = 1\nR = 2018\n\nind_s = L\nind_e = min(L + 2019, R)\n\nchoices_mod = [x%2019 for x in range(ind_s, ind_e+1)]\n# choices_mod_sort = sorted(choices_mod)\n\nif len(choices_mod) == 1:\n print(choices_mod[0])\nelif 0 in choices_mod:\n print(0)\nelse:\n import itertools\n ... | ['Wrong Answer', 'Accepted'] | ['s664771948', 's858743026'] | [220732.0, 220732.0] | [842.0, 735.0] | [470, 413] |
p02983 | u531813438 | 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>=2019:\n print(0)\nelse:\n for i in range(R-L):\n ans.append(L*(L+i)%2019)\n print(min(ans))', 'L, R = list(map(int, input().split()))\nans=[]\nif R-L>=2019:\n print(0)\nelse:\n for i in range(R-L):\n for j in range(R-L):\n ... | ['Wrong Answer', 'Accepted'] | ['s744041141', 's042715568'] | [3060.0, 147652.0] | [18.0, 1694.0] | [156, 195] |
p02983 | u534953209 | 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 != R//2019:\n print(0\nelif:\n L%2019<= 673 and R%2019 >= 673 and L-R >= 2:\n print(0)\nelse:\n print(min((L*(L+1))%2019,(R*(R-1)%2019)))\n', 'L, R = map(int, input().split())\nif L//2019 != R//2019:\n print(0)\nelif L % 2019 <= 673 and R % 2019 >= 673 and R... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s691043896', 's831834552', 's488224316'] | [2940.0, 3060.0, 3060.0] | [17.0, 56.0, 59.0] | [188, 271, 273] |
p02983 | u536034761 | 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\nw = R - L\nif s + w >= 2019:\n print(0)\nelse:\n print(min((s * (s + 1))% 2019, (l * (l - 1)) % 2019)', 'L, R = map(int, input().split())\nl = L % 2019\nr = R % 2019\nw = R - L\nif l + w >= 2019:\n print(0)\nelse:\n ans = 2019\n for i in range(l, r + ... | ['Runtime Error', 'Accepted'] | ['s447267662', 's509088939'] | [2940.0, 3060.0] | [17.0, 697.0] | [158, 228] |
p02983 | u537782349 | 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())\nc = a * b\nfor i in range(a, b+1):\n for j in range(a, b+1):\n if i != j:\n if c > i * j % 2019:\n print(i)\n print(j)\n c = i * j % 2019\n if c == 0:\n print(0)\n exit()\nprint... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s027892984', 's040430437', 's068064309', 's269889317', 's312653683', 's513756068', 's525162994', 's540548655', 's824012039', 's176273127'] | [2940.0, 4724.0, 2940.0, 2940.0, 2940.0, 3060.0, 2940.0, 3408.0, 2940.0, 2940.0] | [80.0, 28.0, 17.0, 43.0, 17.0, 20.0, 67.0, 24.0, 65.0, 59.0] | [310, 260, 180, 267, 235, 268, 221, 468, 184, 208] |
p02983 | u538381753 | 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\nr = 2*(10**9)\nl = r - 2018\n\nif (r-l) > 2019:\n print(0)\nelse:\n a = [x for x in range(l, r+1)]\n res = [i*j%2019 for i in a for j in a if i!=j]\n print(min(res))\n", "l, r = [int(x) for x in input().split(' ')]\n\nif (r-l) > 2019:\n print(0)\nelse:\n a = [x for... | ['Wrong Answer', 'Accepted'] | ['s911137647', 's297292609'] | [151472.0, 147760.0] | [919.0, 872.0] | [207, 179] |
p02983 | u540799318 | 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())\nimport numpy as np\nLL = L%2019\nRR = R%2019\nmin = 2019\n\nif R-L >= 2018 or RR <= LL:\n min= 0\nelif RR*(RR-1)<2019:\n min = LL*(LL-1)\nelse:\n for i in range(LL, RR+1):\n for j in range(i+1, RR+1):\n if (i*j)%2019 < min:\n min= (i*j)%2019\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s006861858', 's039890468', 's135948056', 's172581305', 's335433989', 's339032380', 's535989278', 's608852606', 's843572208', 's919187347'] | [12504.0, 12488.0, 12492.0, 12508.0, 12488.0, 14460.0, 12488.0, 2940.0, 12508.0, 12504.0] | [464.0, 151.0, 684.0, 475.0, 738.0, 2108.0, 2108.0, 17.0, 525.0, 185.0] | [317, 184, 313, 306, 301, 188, 189, 272, 316, 420] |
p02983 | u541610817 | 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()]\nNUM = 2019\nres = 0\nif r // NUM - (l + NUM - 1) // NUM >= 0: \n res = 0\nelif r // 3 - (l + 3 - 1) // 3 >= 0 and r // 673 - (l + 673 - 1) // 673 >= 0:\n res = 0\nelse: \n res = 2019\n for i in range(l, r + 1):\n for j in range(l, r + 1):\n res =... | ['Wrong Answer', 'Accepted'] | ['s361920199', 's060156905'] | [3060.0, 3064.0] | [102.0, 57.0] | [409, 405] |
p02983 | u543000780 | 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 < R:\n tmp = 10**9\n for l in range(L,R):\n for r in range(l+1, R+1):\n if (l*r)%2019 < tmp:\n tmp = (l*r)%2019\n print(tmp)\nelse:\n print("0")', 'L, R = map(int, input().split())\nif L + 2019 < R:\n tmp = 10**9\n for l in range(L,R):\n for r in r... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s112150057', 's638659004', 's011967468'] | [8980.0, 9076.0, 9036.0] | [2206.0, 2205.0, 393.0] | [200, 199, 202] |
p02983 | u547167033 | 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,r=L%2019,R%2019\nx,y=L//2019,R//2019\nif x<y:\n print(0)\nelse:\n ans=10**9\n for i in range(l,r):\n for j in range(i,r+1):\n ans=min(ans,(i*j)%2019)', 'L,R=map(int,input().split())\nl,r=L%2019,R%2019\nx,y=L//2019,R//2019\nif x<y:\n print(0)\nelse:\n ans=10**9\n for i in ... | ['Wrong Answer', 'Accepted'] | ['s167164556', 's270543636'] | [3060.0, 3064.0] | [724.0, 655.0] | [183, 198] |
p02983 | u547748135 | 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\n\n\n\n# (i*j) mod 2019 = (i mod 2019) * (j mod 2019)\n\nif(R <= 2019):\n ans = (R%2019)* ((R-1)%2019)\n\nif(L >= 2019):\n ans = min(ans,(L%2019)* ((L+1)%2019))\nprint(ans)', 'L,R = map(int,input().split())\n\n\n\n\n\n# (i*j) mod 2019 = (i mod 2019) * (j mod 2019) %2019\n\n# =... | ['Runtime Error', 'Accepted'] | ['s435933007', 's253259461'] | [2940.0, 2940.0] | [18.0, 809.0] | [285, 724] |
p02983 | u555503067 | 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 math\n#L,R = map(int, input().split())\n#L,R = 4,5\nL,R = 2019,4037\n\nl_mod = L % 2019\nl_div = L // 2019\nr_mod = R % 2019\nr_div = R // 2019\n\nif r_div - l_div >= 1:\n ans = 0\nelse:\n if l_mod == 0:\n ans = 0\n else:\n ans = l_mod * (l_mod + 1) % 2019\nprint(ans)', 'impo... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s591656699', 's792839701', 's731055820'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 58.0] | [292, 285, 516] |
p02983 | u556070294 | 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)\nelif L%2019 > R%2019:\n print(0)\nelse:\n print((R*(R-1))%2019)\n', 'L, R = map(int, input().split())\nif R-L >= 2019:\n print(0)\n exit()\nelif L%2019 > R%2019:\n print(0)\n exit()\nelse:\n min = 2020\n for l in range(L, R):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s105217790', 's129873464', 's563305200', 's130423442'] | [2940.0, 3060.0, 3060.0, 2940.0] | [17.0, 1064.0, 953.0, 1873.0] | [129, 296, 293, 189] |
p02983 | u556225812 | 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())\nsmall1 = L % 2019\nsmall2 = R % 2019\nfor i in range(L, R+1):\n ans = i % 2019\n if ans < small1:\n small2 = small1\n small1 = ans\n elif ans < small2:\n small2 = ans\n if small1 == 0:\n break\nprint(small1 * small2)', 'L, R = map(int, input()... | ['Wrong Answer', 'Accepted'] | ['s057619343', 's710265902'] | [3060.0, 3060.0] | [20.0, 465.0] | [279, 234] |
p02983 | u556589653 | 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())\nnow = 0\nfor i in range(l,r):\n for j in range(i+1,r+1):\n if i*j % 2019 == 0:\n print(0)\n break\n else:\n if i*j % 2019 < now:\n now = i*j % 2019\nif now != 0:\n print(now)', 'L,R = map(int,input().split())\nans = 1145141919810\nfor i in range(L,R):\n f... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s378980990', 's610921870', 's901951105', 's436716490'] | [9260.0, 3060.0, 2940.0, 9176.0] | [2206.0, 2104.0, 852.0, 64.0] | [225, 224, 252, 264] |
p02983 | u556849401 | 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())\na = (n%2019) * (m%2019)\nprint(a%2019)', '# -*- coding: utf-8 -*-\n"""\nCreated on Sun Jul 28 20:37:55 2019\n\n@author: avina\n"""\n\nl,r = map(int, input().split())\nk = 2020\n\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n k = min(k, (i*j)%2019)\n if k == 0:\n ... | ['Wrong Answer', 'Accepted'] | ['s591758628', 's517172786'] | [2940.0, 3060.0] | [17.0, 60.0] | [69, 272] |
p02983 | u558242240 | 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. | ['ll, rr = map(int, input().split())\nif rr - ll >= 2019:\n print(0)\n exit()\n\nl = ll % 2019\nr = rr % 2019\n\nif l > r:\n print(0)\n exit()\nprint(l,r)\nans = 10**9\nfor i in range(l, r + 1):\n for j in range(i+1, r+1):\n x = (i * j) % 2019\n print(x)\n ans = min(x, ans)\n\nprint(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s657677464', 's752712218', 's585114662'] | [11088.0, 11732.0, 3060.0] | [2103.0, 2104.0, 800.0] | [304, 158, 277] |
p02983 | u561083515 | 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\nLENGTH = (R-L+1) / MOD\nif LENGTH < 1:\n ans = float("inf")\n for i in range(L, R):\n for j in range(i+1, R+1):\n answer = min(ans, (i * j) % MOD)\n print(ans)\nelse:\n print(0)', 'L,R = map(int,input().split())\nMOD = 2019\n\nLENGTH = (R-L+1... | ['Wrong Answer', 'Accepted'] | ['s826302135', 's090878516'] | [3060.0, 3060.0] | [897.0, 797.0] | [242, 239] |
p02983 | u562541930 | 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 N, M = map(int, input().split())\n ans = -1\n if M >= 2019:\n ans = 0\n else:\n for n in range(M)[N:]:\n for i in range(M + 1)[n + 1:]:\n mod = n * i % 2019\n if ans < 0 or mod < ans:\n ans = mod\n print(ans)\n\n\ni... | ['Wrong Answer', 'Accepted'] | ['s094803050', 's563585144'] | [2940.0, 2940.0] | [17.0, 38.0] | [341, 371] |
p02983 | u564770050 | 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\nif r - l >= 2019:\n print(0)\n exit()\n\nfor i in range(l,r+1):\n for j in range(i,r+1):\n\n mod = min(mod,(i*j)%2019)\n if mod == 0:\n break\n\nprint(mod)\n', 'l,r = map(int,input().split())\nmod = 2019\n\nif r - l >= 2019:\n print(0)... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s185782409', 's312569993', 's859095270', 's054204086'] | [3060.0, 3060.0, 3060.0, 2940.0] | [58.0, 53.0, 56.0, 61.0] | [222, 242, 242, 224] |
p02983 | u566264434 | 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\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n print([i,j])\n ans=min((i*j)%2019,ans)\n \n \nprint(ans)', 'l,r = map(int,input().split())\nans=2019\n\nfor i in range(l,r+1): \n if r-l>=2019:\n ans=0\n break\n for j in r... | ['Wrong Answer', 'Accepted'] | ['s935431886', 's326060125'] | [35572.0, 2940.0] | [2104.0, 728.0] | [173, 200] |
p02983 | u570018655 | 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)\n# elif L == 0:\n# print(0)\nelse:\n ans = float("inf")\n for i in range(L, R+1):\n for j in range(L, R+1):\n ans = min(i * j % 2019, ans)\n \n # print(i)\n print(ans)\n', 'L, R = map(int, input().split(... | ['Wrong Answer', 'Accepted'] | ['s809062319', 's932769573'] | [2940.0, 2940.0] | [1458.0, 963.0] | [302, 263] |
p02983 | u571969099 | 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()]\nl2,r2=l%2019,r%2019\nif l2>r2:\n print(0)\nelif r-l>=2019:\n print(0)\nelse:\n print(l*(l+1))', 'l,r=[int(i) for i in input().split()]\nl2,r2=l%2019,r%2019\nif l//2019<r//2019:\n print(0)\nelse:\n k=2019*2019\n for i in range(l,r):\n for j in range(i+1,r+1):\n k=mi... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s715078168', 's890088187', 's597163153'] | [3060.0, 3060.0, 3060.0] | [17.0, 788.0, 805.0] | [128, 184, 195] |
p02983 | u572142121 | 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 R-L>2018:\n print(0)\nelse:\n if l>r:\n print(0)\n else:\n ans=2019\n for i in range(r-l):\n for j in range(r-l-i):\n x=((l+i)*(l+j))%2019\n ans=min(ans,x)\n print(ans)\n ', 'L,R=map(int,input().split())\nl=L%2019\nr=R%2019\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s334059284', 's824856173', 's255124163'] | [3060.0, 3060.0, 3064.0] | [896.0, 975.0, 984.0] | [250, 247, 245] |
p02983 | u573272932 | 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\nwhile L>N:\n\tL -= N\nwhile R>N:\n\tR -= N\nans = R*L\n\nprint(ans%2019)\n', 'L, R = map(int, input().split())\nN = 2019\n\nif R-L>N:\n\tprint(0)\nelif L < N and N < R:\n\tprint(0)\nelse:\n\twhile L>N:\n\t\tR -= N\n\t\tL -= N\n\n\ti = R\n\tj = R-1\n\tans = i*j%N\n\twhile ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s312690412', 's627487742', 's512600269'] | [2940.0, 3060.0, 3064.0] | [367.0, 235.0, 931.0] | [108, 274, 213] |
p02983 | u573754721 | 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 for 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', "l,r=map(int,input().split())\n\nif r-l>=2019:\n print(0)\n exit()\n\nans=float('inf')\nfor i in range(l,r):\n for j in range(i... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s355899938', 's804554333', 's143681799'] | [2940.0, 2940.0, 2940.0] | [17.0, 654.0, 1495.0] | [169, 173, 179] |
p02983 | u577902321 | 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 make_list(L, R):\n mod_list = list()\n\n for i in range(L, R):\n for j in range(i + 1, i + 2020):\n mod_list.append((i * j) % 2019)\n\n return mod_list\n\n\ndef main():\n L, R = map(int, input().split())\n\n mod_list = make_list(L, R)\n\n print(min(mod_list))\n\n return\n\n\... | ['Wrong Answer', 'Accepted'] | ['s118861531', 's876975024'] | [468376.0, 149916.0] | [2132.0, 932.0] | [337, 508] |
p02983 | u578953945 | 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 = 2020\nif R - L <= 2019:\n for i in range(L,R):\n for j in range(i,R):\n \tANS = min(ANS, (i * j) % 2019)\nelse:\n ANS = 0\nprint(ANS)', 'L,R = map(int, input().split())\n\nANS = 2020\nif R - L <= 2019:\n for i in range(L,R+1):\n for j in range(i+1,R+1):\n #if ... | ['Wrong Answer', 'Accepted'] | ['s853922085', 's904906855'] | [2940.0, 2940.0] | [789.0, 790.0] | [172, 251] |
p02983 | u580920947 | 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\np = 2019\nL, R = list(map(int, input().split()))\nif (R - L) >= (p -1):\n ans = 0\n print(ans)\nelse:\n L, R = \n if L < R:\n ans = L * (L+1)\n else:\n ans = 0\n print(ans)\n \nmain()\n\n\n \n', 'def main():\n\np = 2019\nL, R = list(map(int, input().split()))\nif (R - L) >= (p -1):\n ans... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s225833580', 's340932719', 's878826370'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 296.0] | [202, 224, 326] |
p02983 | u587425560 | 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\nl,r=map(int,input().split())\na=l%2019\nb=r%2019\nif l-r>=2018:\n print(0)\nelif b-a<=0:\n print(0)\nelif (a<=672)&(b>=673):\n print(0)\nelif(a<=673)&(b>=675):\n print(0)\nelif (a<=1345)&(b>=1346):\n print(0)\nelif(a<=1346)&(b>=1348):\n print(0)\nelif a<=20&b>=101:\n print(1)\nelse:\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s273613492', 's424383705', 's603577964'] | [4340.0, 7028.0, 3064.0] | [162.0, 555.0, 656.0] | [445, 368, 239] |
p02983 | u591503175 | 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 resolve():\n \'\'\'\n code here\n \'\'\'\n L, R = [int(item) for item in input().split()]\n aL, bL = divmod(L, 2019)\n aR, bR = divmod(R, 2019)\n\n if bL == 0:\n res = 0\n elif aL < aR:\n res = 0\n elif aL == aR:\n res = 2019\n for i in range(bL,bR+1):\n ... | ['Wrong Answer', 'Accepted'] | ['s045948245', 's095175740'] | [3064.0, 3064.0] | [1022.0, 1018.0] | [427, 427] |
p02983 | u593019570 | 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 = input().split(' ')\na = int(a)\nb = int(b)\n\nans = 5000\n\nfor i in range(a, b - 1):\n for j in range(i + 1, b):\n for k in range(2, ans):\n if (i * j) % k == 2019 % k:\n print((i * j) % k, 2019 % k)\n ans = k\n break\n\nprint(ans)", "a,b = inpu... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s247852238', 's789138947', 's641851824'] | [3060.0, 3064.0, 3060.0] | [2104.0, 17.0, 425.0] | [290, 298, 234] |
p02983 | u593567568 | 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\nL,R = map(int,input().split())\nif 2019 <= (R - L) + 1:\n print(0)\n exit()\n \nlst = list(range(L,R+1))\nmd = [x * y % 2019 for x,y in itertools.combination(lst,2)]\nmd.sort()\nprint(md[0])', 'import itertools\nL,R = map(int,input().split())\nif 2019 <= (R - L) + 1:\n print(0)\n exit()\n \nls... | ['Runtime Error', 'Accepted'] | ['s854791133', 's355125971'] | [3060.0, 81556.0] | [18.0, 1197.0] | [202, 204] |
p02983 | u594244257 | 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 if R-L >= 2019:\n multiple = [0]\n else:\n L,R = L%2019, R%2019\n L,R = min(L,R),max(L,R)\n multiple = [i*j for i in range(L,R) for j in range(i,R+1)]\n \n print(min(multiple))\n\nsolve()', 'def solve():\n L,R = map(int... | ['Wrong Answer', 'Accepted'] | ['s362501595', 's340586496'] | [83608.0, 75416.0] | [217.0, 336.0] | [272, 279] |
p02983 | u596297663 | 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%print(l,r)\n\nbest = 2019\nfor i in range(l, r):\n\tfor j in range(l+1,r+1):\n\t\tif i*j % 2019 < best:\n\t\t\tbest = i*j % 2019\n\nprint(best)', 'l, r = map(int, input().split())\n#print(l,r)\n\nbest = 2019\nfor i in range(l, min(r,l+2019)):\n\tfor j in range(l+1,min(r+1,l+2019+1))... | ['Runtime Error', 'Accepted'] | ['s541798457', 's659013538'] | [3064.0, 3060.0] | [17.0, 842.0] | [163, 189] |
p02983 | u597455618 | 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\nif r - l < 673:\n print(0)\nelse:\n ans = 2018\n l = l%m\n r = r%m\n for i in range(l, r):\n for j in range(i+1, r+1):\n ans = min(ans, (i*j)%m)\n print(ans)', 'l, r = map(int, input().split())\nm = 2019\nif r - l >= 673:\n print(0)\ne... | ['Wrong Answer', 'Accepted'] | ['s891991047', 's658008600'] | [3060.0, 3060.0] | [702.0, 17.0] | [226, 242] |
p02983 | u598229387 | 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())\nll=l%2019\nrr=r%2019+2019\n\nans=float('inf')\nfor i in range(ll,rr):\n for j in range(i+1,rr+1):\n ans=min(ans,i*j%2019)\n if ans==0:\n break\nprint(ans)", "l,r=map(int,input().split())\nll=l%2019\nrr=r%2019+2019\n\nans=float('inf')\nfor i in range(ll,rr):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s355233744', 's908488524', 's513069031'] | [2940.0, 2940.0, 2940.0] | [21.0, 2103.0, 759.0] | [200, 165, 175] |
p02983 | u598720217 | 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 f = True\n for i in range(L,R+1):\n t = i % 2019\n if t==0:\n f = False\n break\n if f:\n ans = 2019\n for i in range(L,R+1):\n for j in range(i,R+1):\n ans = mi... | ['Wrong Answer', 'Accepted'] | ['s686909979', 's911948320'] | [3064.0, 3064.0] | [59.0, 60.0] | [418, 420] |
p02983 | u600402037 | 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\nminimum = L * R\nfor i in range(L, min(R, L+2020)):\n for j in range(i+1, min(R+1, i+2021)):\n \n minimum = min(minimum, i * j // 2019)\n \n\nprint(minimum)', 'L, R = list(map(int,input().split()))\n\nminimum = L * R\nfor i in range(L, L + 2019):\n f... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s111177040', 's141215058', 's168196086', 's219226613', 's276336502', 's306628996', 's908002161'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 3064.0] | [1484.0, 1554.0, 1490.0, 17.0, 2104.0, 2103.0, 1097.0] | [212, 180, 212, 211, 216, 168, 354] |
p02983 | u607075479 | 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 heapq\nL,R = map(int, input().split())\nif R - L >= 672:\n print(0)\n exit()\nelse:\n hq3 = []\n hq673 = []\n hq2019 = []\n for i in range(L, R+1):\n heapq.heappush(hq2019, i%2019)\n heapq.heappush(hq673, i%673)\n heapq.heappush(hq3, i%3)\n a = heapq.heappop(hq2019)\n ... | ['Runtime Error', 'Accepted'] | ['s284152094', 's964513343'] | [3064.0, 3060.0] | [18.0, 1083.0] | [519, 275] |
p02983 | u608809251 | 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\nans = 0\nif R-L < m:\n ans = m\n L = L%m\n R = R%m\n print(L,R)\n lis = list(range(L,R+1))\n lis2 = [i%m for i in lis]\n for i in range(len(lis2)):\n for j in range(i+1,len(lis2)):\n if ans > (lis2[i]*lis[j])%m:\n ans = (l... | ['Wrong Answer', 'Accepted'] | ['s620190090', 's759250360'] | [3064.0, 3064.0] | [521.0, 552.0] | [332, 317] |
p02983 | u613943630 | 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**7)\ninput = sys.stdin.readlines\nfrom math import sqrt\n\ndef isSquare(n):\n m = int(sqrt(n))\n for x in range(m-2, m+2):\n if x**2 == n:\n return True\n\ndef getDistance(xi, xj, dimention):\n d = 0\n for i in range(dimention):\n d += (xi[i] -... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s241081104', 's825929751', 's827414859'] | [9232.0, 9232.0, 9216.0] | [28.0, 30.0, 362.0] | [707, 707, 700] |
p02983 | u614320306 | 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())\nZ = 2020\nif R - L >= 2019:\n print(0)\nelse:\n for i in range(L,R+1):\n a = i % 2019\n for j in range(L,R+1):\n b = j % 2019\n if i != j and (a*b)%2019 < Z:\n X = a\n Y = b\n Z = (a*b) % 2019\n print(Z)', 'L, R = (int(i) for i in input().split... | ['Wrong Answer', 'Accepted'] | ['s795179291', 's232530666'] | [3060.0, 3060.0] | [571.0, 611.0] | [264, 238] |
p02983 | u616468898 | 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 = list(map(int, input().split(' ')))\nx = []\nx.append(L % 2019)\nfor i in range(L+1, R+1):\n m = i % 2019\n if s == m:\n break\n x.append(m)\nmin_v = 2018\nfor i in range(0, len(x)-1):\n tmp = np.amin(np.mod([x[i]*x[j] for j in range(i+1, len(x))], 2019))\n if tmp < min... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s503129482', 's946366077', 's963386750', 's975762775'] | [12464.0, 14200.0, 18540.0, 12392.0] | [148.0, 154.0, 278.0, 657.0] | [343, 343, 343, 351] |
p02983 | u619458041 | 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\ndef main():\n input = sys.stdin.readline\n L, R = map(int, input().split())\n\n if L == 0:\n return 0\n\n if (R // 2019) > ((L-1) // 2019):\n return 0\n\n if (R // 673) > ((L-1) // 673):\n if R - L >= 2:\n return 0\n if (R % 3) == 0 or (L % 3) == 0:\... | ['Runtime Error', 'Accepted'] | ['s538895375', 's890129861'] | [3060.0, 3060.0] | [17.0, 50.0] | [429, 345] |
p02983 | u620755587 | 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)\n exit()\nminn = 2*(10**9)*2\nfor i in range(l, r+1):\n for j in range(i+1, r+1):\n if minn > i * j % 2019:\n minn = min(minn, i * j % 2019)\nprint(minn)', 'l, r = map(int, input().split())\nif r - l >= 2019:\n print(0)\n exit... | ['Runtime Error', 'Accepted'] | ['s991322946', 's769874380'] | [2940.0, 3060.0] | [17.0, 767.0] | [230, 198] |
p02983 | u620846115 | 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(2)\nelse:\n ans = 2019\n for i in range(L,R-1):\n a = ((i%2019)*((i%2019)+1))%2019\n ans = min(ans,a)\n print(a)', 'L,R = map(int,input().split())\nans = 2019\nwhile True:\n for i in range(L,R-1):\n a = (i*(i+1))%2019\n ans = min(ans,a)\nprint... | ['Runtime Error', 'Time Limit Exceeded', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s290220682', 's375763737', 's503609959', 's745676898', 's876712857', 's999160059', 's035602299'] | [9124.0, 9080.0, 9172.0, 9176.0, 9116.0, 8960.0, 9156.0] | [26.0, 2206.0, 392.0, 27.0, 31.0, 20.0, 79.0] | [171, 132, 182, 158, 161, 174, 188] |
p02983 | u622045059 | 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\n L,R = map(int, input().split())\n\n f_v = s_v = 2018 \n\n range_t = min(2019, R-L)\n\n print(range_t)\n\n for i in range(range_t + 1):\n if f_v % 2019 > (L + i) % 2019:\n s_v = f_v\n f_v = (L + i)\n elif s_v % 2019 > (L + i) % 2019:\n s_v = (L ... | ['Wrong Answer', 'Accepted'] | ['s902281650', 's403418548'] | [3060.0, 3060.0] | [18.0, 617.0] | [377, 316] |
p02983 | u623283955 | 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. | ['c=list(map(int,input().split()))\nl,r=c[0],c[1]\nif r-l>2017:\n print(0)\nelse:\n ml,mr=l%2019,r%2019\n if ml>mr:\n print(0)\n else:\n mini=2019\n for i in range(mr-ml):\n for j in range(ml-mr-i):\n mini=min(mini,((ml+i)*(ml+i+1+j))%2019)\n print(mini)\n', 'c=list(map(int,input().split()))... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s042575322', 's544117053', 's762350722', 's881949745', 's964094062', 's839152024'] | [3060.0, 3064.0, 3064.0, 3064.0, 16992.0, 3064.0] | [23.0, 17.0, 756.0, 753.0, 2103.0, 636.0] | [268, 259, 258, 258, 313, 300] |
p02983 | u626337957 | 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\ndiv_l = L//2019\ndiv_r = R//2019\ndiv_ll = L//673\ndiv_rr = R//673\n\nans = 0\nif div_l == div_r and div_ll == dir_rr:\n mod_l = L%2019\n mod_r = R%2019\n ans = mod_l * (mod_l+1)\nprint(ans)\n', 'L, R = map(int, input().split())\n\nif R - L >= 2019:\n print(0)\nelse:\n mod... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s129240068', 's420581024', 's550204929', 's765890965', 's541541086'] | [2940.0, 4048.0, 2940.0, 2940.0, 3064.0] | [17.0, 145.0, 17.0, 17.0, 68.0] | [218, 403, 218, 218, 380] |
p02983 | u626468554 | 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 r = l + 2020\n\nans = 2020\nfor i in range(l):\n for j in range(i+1,r):\n sub = i*j%2019\n\n if sub < ans:\n ans = sub\n\nprint(ans)\n', 'l, r = map(int, input().split())\n\nif r - l > 2020:\n r = l + 2020\n\nans = 2020\nfor i in... | ['Wrong Answer', 'Accepted'] | ['s950311410', 's562573365'] | [2940.0, 2940.0] | [2104.0, 529.0] | [206, 212] |
p02983 | u629246993 | 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 permutations\nl, r = map(int,input().split())\na = []\nfor i in range(l,r+1):\n tmp = i%2019\n if tmp not in a:\n a.append(tmp)\nprint (a)\nperm = permutations(a,2)\nmin = 2019\nfor i in list(perm):\n tmp = i[0]*i[1]%2019\n if min > tmp:\n min = tmp\nprint(min)\n', 'fro... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s171468909', 's942412075', 's782097030'] | [293456.0, 2940.0, 3064.0] | [2104.0, 17.0, 44.0] | [296, 264, 368] |
p02983 | u629350026 | 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())\ni=1\ntemp=0\nwhile r>2019*i:\n if l<=2019*i:\n temp=1\n break\n i=i+1\n\ncount=2019\nr=r%2019\nl=l%2019\nfor i in range(0,r+1):\n for j in range(l+1,r+1):\n temp=(i*j)%2019\n count=min(count,temp)\n\nif temp==1:\n print(0)\nelse:\n print(count)', 'l,r=map(int,input().spl... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s005607856', 's373934756', 's079139404'] | [3064.0, 2940.0, 3064.0] | [1571.0, 2104.0, 934.0] | [271, 147, 273] |
p02983 | u631706425 | 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( ))\np=2019\nif r-l>=p:\n\tprint(0)\nelse:\n\ttmp=p\n\tfor i in range(l,r+1):\n\t\tfor j in range(i+1,r+1):\n\t\t\tans=min(tmp,(i*j)%p)\n\tprint(ans)\n\t', 'l,r=map(int,input().split( ))\np=2019\nif r-l>=p:\n\tprint(0)\nelse:\n\ttmp=p\n\tfor i in range(l,r+1):\n\t\tfor j in range(i+1,r+1):\n... | ['Wrong Answer', 'Accepted'] | ['s143612816', 's789201407'] | [2940.0, 2940.0] | [822.0, 789.0] | [159, 158] |
p02983 | u631755487 | 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. | ['i, j = map(int, input().split())\n\nprint((i%2019)*(j%2019))', "i, j = map(int, input().split())\na = i % 2019\na_r = i // 2019\n\nb = j % 2019\nb_r = j // 2019\n\nif a_r == b_r:\n minv = float('INF')\n for first in range(a, b):\n for second in range(a+1, b+1):\n result = first*second%2019\n ... | ['Wrong Answer', 'Accepted'] | ['s375424170', 's732826392'] | [2940.0, 3060.0] | [17.0, 805.0] | [58, 335] |
p02983 | u633684453 | 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())\nminimum=2019\nif r-l>=2019:\n\tprint(0)\n\tsys.exit()\nelse:\n\tl,r=l%2019,r%2019\n\tif l>r:\n\t\tprint(0)\n\t\tsys.exit()\n\telif r-l==1:\n\t\tprint((l*r)%2019)\n\telse:\n\t\tfor i in range(l,r):\n\t\t\tfor j in range(l,r+1):\n\t\t\t\tprint(i,j)\n\t\t\t\tif minimum==0:\n\t... | ['Wrong Answer', 'Accepted'] | ['s658645415', 's347356520'] | [5364.0, 3064.0] | [267.0, 54.0] | [404, 389] |
p02983 | u634079249 | 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 os\n\nMOD = 2019\n\n\ndef main():\n if os.getenv("LOCAL"):\n sys.stdin = open("input.txt", "r")\n\n L, R = list(map(int, sys.stdin.readline().split()))\n ret = float(\'inf\')\n print(L, R)\n for i in range(L, R):\n for j in range(L + 1, R + 1):\n ret = min(re... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s416686956', 's666727577', 's828240192'] | [3060.0, 3064.0, 3832.0] | [2104.0, 2104.0, 57.0] | [375, 382, 990] |
p02983 | u634159866 | 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\nP = 2019\n\nL = L%2019\nR = min(R, L+4038)\n\ntmp = 2018\nfor i in range(L, R):\n for j in range(L+1, R+1):\n tmp = min((i*j)%P, tmp)\n \nprint(tmp)', 'L, R = map(int, input().split())\n\nP = 2019\n\ndef mul(a, b):\n return ((a % P) * (b % P)) % P\n\nR = min(R, ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s180759117', 's324658632', 's664424698'] | [3060.0, 3064.0, 3060.0] | [2104.0, 17.0, 182.0] | [189, 232, 177] |
p02983 | u640123177 | 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+1 >= 2019:\n print(0)\nelse:\n for i in range(L, R+1):\n for j in range(L, R+1):\n a = i*j\n if a < 2019:\n li.append(a)\n else:\n while a > 2019:\n a %= 2019\n li.append(a)\n print(min(li))', 'L, R = map(int, input... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067390009', 's633066811', 's667761475', 's817886327', 's917538453', 's928167196'] | [147788.0, 139696.0, 3060.0, 3316.0, 3064.0, 149040.0] | [1944.0, 2112.0, 18.0, 19.0, 18.0, 1168.0] | [279, 305, 185, 178, 177, 232] |
p02983 | u640603056 | 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\nL,R=map(int,input().split())\nif L%2019==0 or R%2019==0:\n\tans=0\nelse:\n\tL%=2019\n\tR%=2019\n\n\tprint(L,R)\n\tINF=10*9\n\tans=INF\n\tfor c in itertools.combinations(range(min(L,R),max(L,R)),2):\n\t\tans=min(ans,(c[0]*c[1])%2019)\nprint(ans)', 'import itertools\nL,R=map(int,input().split())\nif L... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s397842768', 's543422019', 's773056510', 's521517162'] | [3064.0, 3064.0, 2940.0, 3060.0] | [762.0, 18.0, 2104.0, 928.0] | [240, 209, 133, 160] |
p02983 | u642528832 | 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 = 10**18\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 m = min(m,i*j%2019)\n print(m)', 'L,R = map(int,input().split())\nm = 10**18\nif R-L>=2019:\n print(0)\nelse:\n for i in range(L,R):\n s = i%... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s136357396', 's371956199', 's561018608'] | [9288.0, 10596.0, 9140.0] | [1231.0, 2213.0, 657.0] | [185, 225, 177] |
p02983 | u647767910 | 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 print(l*r)\nelif l <= 2019 and 2019 <= r:\n print(0)\nelif l > 2019:\n if (r-l) >= 2018:\n print(0)\n else:\n new_l = l % 2019\n new_r = r % 2019\n count_l = l // 2019\n count_r = r // 2019\n if new_r >= 2 and count... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s293806448', 's977308645', 's424434026'] | [3064.0, 3060.0, 3060.0] | [484.0, 17.0, 510.0] | [581, 331, 242] |
p02983 | u648064928 | 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 , r = L//2019, R//2019\nif R - L >= 2019:\n print(0)\nelse:\n flag=0\n Amari=[]\n for i in range(R-1):\n for j in range(i+1,L+1):\n amari = (i*j) % 2019\n Amari.append(amari)\n print(min(Amari))\n', 'L, R = map(int,input().split())\nl , r ... | ['Wrong Answer', 'Accepted'] | ['s542140596', 's696384960'] | [104216.0, 75432.0] | [2108.0, 678.0] | [263, 241] |
p02983 | u651803486 | 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\nmod = 2019\n\nl = L % 2019\nr = R % 2019\n\nif l >= r:\n print(0)\n exit()\nelse:\n _min = 2*1000000000+5\n for i in range(l, r):\n for j in range(i, r+1):\n _min = min(_min, i*j%mod)\n\nprint(_min)', 'L, R = map(int, input().split())\n\... | ['Wrong Answer', 'Accepted'] | ['s481721635', 's272325911'] | [3060.0, 2940.0] | [697.0, 762.0] | [261, 188] |
p02983 | u651879504 | 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 \nmin = 20000000\n \n\nfor i in range(L,R+1):\n tmp = i\n if tmp % 2019 == 0:\n print(tmp)\n break\nif L == 0:\n print(0)\nelse:\n for i in range(L,tmp+1):\n for j in range(i + 1,tmp+1):\n if min > (i * j) % 2019 and i <= R and j <= R... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s110265574', 's448529575', 's290168893'] | [3064.0, 3064.0, 3060.0] | [40.0, 44.0, 41.0] | [516, 411, 397] |
p02983 | u652569315 | 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(0)\n exit()\nelse:\n a = 2018\n x = list(range(l,r+1))\n for i in range(r+1-l):\n a = min(a,x[i]%2019)\n print(a)\n if x[i]%2019 == 0:\n print(0)\n exit()\n print(a*(a+1))', 'L,R = map(int,input().split())\nif R - L >= 672:\n print(0)... | ['Wrong Answer', 'Accepted'] | ['s171468343', 's051369434'] | [3316.0, 3060.0] | [21.0, 17.0] | [241, 290] |
p02983 | u655048024 | 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-2018)or(L==0):\n print(0)\nelse:\n ans = 2020\n l = L%2019\n r = R%2019\n for i in range(l,r):\n for j in range(i+1,r):\n min(ans,(i*j)%2019)\n print(ans)\n ', 'L,R = map(int,input().split())\nif(L<=R-2019):\n print(0)\nelse:\n ans = 2020\n l = L%2019\n r =... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s045090126', 's437364908', 's696810897', 's751053107', 's768389156', 's773759413'] | [2940.0, 2940.0, 2940.0, 3060.0, 3060.0, 3060.0] | [636.0, 666.0, 659.0, 17.0, 646.0, 854.0] | [203, 195, 195, 249, 229, 223] |
p02983 | u657901243 | 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())\nmin2019 = L\nwhile True:\n if min2019 % 2019 == 0:\n break\n else:\n min2019 -= 1\n\nif min2019 + 2019 <= R+1:\n max2019 = 2018\nelse:\n max2019 = R % 2019\n\nmin2019 = L % 2019\n\nprint(min2019, max2019)\n\nans = min2019*max2019 % 2019\nfor i in range(min20... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s257069084', 's718019679', 's002080357'] | [3060.0, 3060.0, 3060.0] | [329.0, 416.0, 554.0] | [418, 401, 332] |
p02983 | u659511702 | 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())\n\nif l <= 2019 <= r or r <= 2019 <= l:\n print(0)\n exit()\n\nwhile l // 2019 > 0 or r // 2019 > 0:\n l = l % 2019\n r = r % 2019\n\nmini = 2*(1e+9)\nprint(l,r)\nif l < r:\n for i in range(l,r+1):\n for j in range(i+1,r+1):\n print(i,j)\n mini = min(mini, (i*... | ['Wrong Answer', 'Accepted'] | ['s815572185', 's505945833'] | [16212.0, 3064.0] | [2104.0, 687.0] | [487, 477] |
p02983 | u661829326 | 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())\nresult = R*R\nif R - L + 1 > 2019:\n R = L + 2018\nfor i in range(L,R+1):\n print("i="+str(i))\n for j in range(i+1,R+1):\n print("j="+str(j))\n if (i * j) % 2019 < result:\n result = (i * j) % 2019\nprint(result)', 'L, R = map(int, input().split())\... | ['Wrong Answer', 'Accepted'] | ['s872945795', 's476027327'] | [29572.0, 9120.0] | [1389.0, 407.0] | [271, 221] |
p02983 | u662449766 | 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\ninput = sys.stdin.readline\n\n\ndef main():\n l, r = [int(i) for i in input().split()]\n\n if r // 2019 * 2019 >= 1:\n print(0)\n else:\n num = [i for i in range(l, min(r + 1, l + 2019))]\n min_ = 2019\n for i, n in enumerate(num):\n for j in num[i + 1 :]:... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s084465835', 's535414334', 's652261745', 's766882305', 's406261124'] | [3060.0, 3064.0, 3060.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0, 694.0] | [413, 433, 405, 206, 446] |
p02983 | u664373116 | 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=list(map(int,input().split()))\nif M-N>2018 or (N%2019>M%2019):\n print(0)\nelse:\n\n N=N%2019\n M=M%2019\n ans=2018\n for i in range(N,M+1):\n for j in range(i,M+1):\n ans=min(ans,(i*j)%2019)\n print(ans)', 'N,M=list(map(int,input().split()))\nif M-N>2018 or (N%2019>M%2019):\n... | ['Wrong Answer', 'Accepted'] | ['s821523808', 's042953800'] | [3060.0, 3060.0] | [677.0, 738.0] | [234, 211] |
p02983 | u665038048 | 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 fractions import gcd\n\n\nl, r = map(int, input().split())\nlr_ans = []\nif r - l + 1 >= 2019:\n print(2)\n exit()\nfor i in range(l, min(l+2019+1, r+1)):\n lr_ans.append(i%2019)\nlr_ans.sort()\nprint(int((lr_ans[0]*lr_ans[1])/gcd(lr_ans[0], lr_ans[1])))', 'from fractions import gcd\n\n\nl, r = map(int,... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s274139016', 's399183097', 's460865588', 's562217008', 's477369975'] | [5344.0, 5304.0, 5304.0, 480736.0, 75332.0] | [38.0, 41.0, 38.0, 2133.0, 589.0] | [257, 257, 239, 194, 194] |
p02983 | u665335685 | 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()))\nSet = set([l%2019])\nfor i in range(r-l):\n\tSet.add((l+1+i)%2019)\nList = list(Set)\nanswer = (l * r) % 2019\nk = 0\nfor i in range(len(List)):\n\tfor j in range(len(List)):\n\t\tif(i < j):\n\t\t\tif(k == 0 or (i >= 45 and j >= 46))\n\t\t\t\tif(answer > (List[i] * List[j])% 201... | ['Runtime Error', 'Accepted'] | ['s214553720', 's046134074'] | [2940.0, 3064.0] | [17.0, 863.0] | [364, 356] |
p02983 | u665452497 | 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=min(R-L,2020)\ni=2020\nj=2020\nfor n in range(L,L+m+1):\n if i>j:\n i=min(i,n%2019)\n else:\n j=min(j,n%2019)\n print(n,i,j)\nprint((i*j)%2019)', "L,R=map(int,input().split())\ni,j=2020,2020\nif R-L+1>=2019:\n print(0)\nelse:\n ans=float('inf')\n for n i... | ['Wrong Answer', 'Accepted'] | ['s150444137', 's681817313'] | [9364.0, 9088.0] | [30.0, 665.0] | [188, 222] |
p02983 | u666415539 | 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())\n\nif R-L > 2019:\n print (0)\nelse:\n mod1 = L%2019\n print ("mod1", mod1)\n mod2 = R%2019\n print("mod2", mod2)\n if mod2 < mod1:\n print (0)\n else:\n modmin =2019 -1\n for i in range(L,R+1):\n for j in range(i+1,R+1):\n mod3 = (i*j)%2019\n# ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s475437255', 's644923660', 's423406545'] | [3064.0, 2940.0, 2940.0] | [49.0, 17.0, 44.0] | [460, 377, 368] |
p02983 | u667458133 | 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\nnum = l % 2019\nif r >= l + 2019 - num:\n print(0)\n\nelse:\n result = 2019\n for i in range(num, r-l+num):\n for j in range(i, r-l+num+1):\n result = min(result, i*j%2019)\n if result == 0:\n break\n\n if result == 0:\n ... | ['Wrong Answer', 'Accepted'] | ['s384213046', 's476769488'] | [2940.0, 3060.0] | [53.0, 647.0] | [338, 246] |
p02983 | u667469290 | 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 -*-\nfrom itertools import combinations\nprint(673*3)\ndef solve():\n L, R = map(int, input().split())\n l, r = L%2019, R%2019\n if R-L >= 2019-1 or l >= r or l == 0:\n return '0'\n elif R-L >= 673-1 or ((R-L >= 3-1 or L%3 >= R%3 or L%3 == 0) and L%673 >= R%673) or ((R-L >= 3-1 ... | ['Wrong Answer', 'Accepted'] | ['s841698158', 's430015361'] | [3064.0, 3064.0] | [37.0, 37.0] | [559, 546] |
p02983 | u668503853 | 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=[]\nfor i in range(L,R):\n for j in range(i+1,R+1):\n if i*j>=2019**2:\n break\n mod=(i*j)%2019\n li.append(mod)\n if mod==0:\n break\nprint(min(li))\n', 'L,R=map(int,input().split())\nli=[]\nfor i in range(L,R):\n for j in range(i+1,R+1):\n whil... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s676546197', 's750443530', 's157070955'] | [61328.0, 262296.0, 59280.0] | [2107.0, 2123.0, 560.0] | [208, 194, 187] |
p02983 | u668705838 | 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())\nimport numpy as np\nif r-l+1 >= 2019 or 3 <= r-l+1 <= 673:\n print(0)\nelse:\n k = sorted(np.mod(np.array([i for i in range(l,r+1)]),2019))\n print((k[0] * k[1])%2019)', 'l,r = map(int, input().split())\nimport numpy as np\nMOD = 2019\nif r-l+1 >= 673:\n print(0)\nelse:\n k = sor... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s133832787', 's905400241', 's716697828'] | [12500.0, 12428.0, 15712.0] | [149.0, 149.0, 187.0] | [197, 193, 279] |
p02983 | u670180528 | 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\nL,R = map(int,input().split())\nif R-L >= 2018:\n print(0);exit()\nli = [i%2019 for i in range(L,R+1)]\nli = list(set(li))\nif 0 in li or 3 in li or 673 in li:\n print(0);exit()\npro = []\nfor i,j in itertools.combinations(li,2):\n pro.append(i*j%2019)\nprint(min(pro))', 'import itertools\nL,R = ... | ['Wrong Answer', 'Accepted'] | ['s078047837', 's991682614'] | [6832.0, 6832.0] | [44.0, 46.0] | [279, 282] |
p02983 | u671239754 | 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\ndef repeat_division(n):\n while True:\n if n < 2019:\n break\n n %= 2019\n return n\n\nl = repeat_division(L)\nr = repeat_division(R)\n\nif R - L >= 2019:\n print(0)\nelif l > r:\n print(0)\nelse:\n min = 2019\n for l in range(1,l+1):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s750952318', 's964790334', 's258484390'] | [3060.0, 3060.0, 3060.0] | [891.0, 594.0, 652.0] | [431, 431, 433] |
p02983 | u671252250 | 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# Your code here!\n\nL, R = map(int, input().split())\nL_mod = L % 2019\nR_mod = R % 2019\nmin_mod = pow(2018,2)\nnum = 0\nprint(L_mod)\nprint(R_mod)\n\nif L_mod < R_mod:\n for i in range(L_mod, R_mod):\n for j in range(i + 1, R_mod + 1):\n num = (i * j) % 2019\n if mi... | ['Wrong Answer', 'Accepted'] | ['s147609541', 's605264583'] | [3064.0, 3064.0] | [399.0, 421.0] | [590, 605] |
p02983 | u672475305 | 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\nx = r // mod\nline = x * mod\nprint(line)\n\nif l < line < r:\n print(0)\n\nelse:\n y = l % 2019\n print((y*(y+1))%mod)', 'l,r = map(int,input().split())\nmod = 2019\nline = (r // mod) * mod\nif l*r < mod:\n print(l*r)\nelif l < line < r:\n print(0)\nelse:\... | ['Wrong Answer', 'Accepted'] | ['s551939221', 's889110032'] | [2940.0, 3064.0] | [17.0, 708.0] | [162, 370] |
p02983 | u673361376 | 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())\nfor b in range(0, 2019):\n for i in range(L,R):\n for j in range(i+1,R+1):\n if int((R*(R-1)-b)/2019) == 0:\n if int(i*j) == int(b):\n print(b)\n exit()\n else:\n for a in range(int((R*(R-1)-b)/2019)):\n print(b,i,j,a)\n ... | ['Wrong Answer', 'Accepted'] | ['s770909357', 's289106597'] | [30776.0, 2940.0] | [2104.0, 749.0] | [383, 216] |
p02983 | u673559119 | 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\ntmp=2019//L\nans=0\nfor i in range(1,tmp+1):\n if i*2019>=L and i*2019<=R:\n print(0)\n break\n if i==tmp:\n print((L%2019*(L+1)%2019)%2019)', '#coding utf-8\nL,R=map(int,input().split())\n\ntmp=99999999999999\nif R-L>=2019:\n tmp=0\nelse:\n for i in range(L... | ['Runtime Error', 'Accepted'] | ['s425979102', 's842515108'] | [2940.0, 3060.0] | [17.0, 487.0] | [188, 286] |
p02983 | u674588203 | 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# C - Remainder Minimization 2019\nL,R=map(int,input().split())\n\nmod=2019\n\nl=L%mod if L<=mod else 0\nr=R%mod if R<=mod else 0\nm=min(l,r)\n\nprint(m*(m+1))', '\n# C - Remainder Minimization 2019\nL,R=map(int,input().split())\n\nmod=2019\nans=20000\n\nfor i in range (L,min(R,L+mod)):\n for j in range (L+1,min... | ['Wrong Answer', 'Accepted'] | ['s096044076', 's962784616'] | [9088.0, 9124.0] | [30.0, 1383.0] | [181, 303] |
p02983 | u675757825 | 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()]\n\nif (r - l >= 672):\n print(0)\nelse:\n a = 2018\n for i in range(l, r):\n for j in range(i + 1, r + 1):\n b = i % 2019\n print(b)\n c = j % 2019\n print(c)\n d = (b * c) % 2019\n a = min(a, ... | ['Wrong Answer', 'Accepted'] | ['s830495605', 's484440295'] | [4340.0, 3060.0] | [206.0, 75.0] | [321, 279] |
p02983 | u677267454 | 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\nleft = L // 2019\nright = R // 2019\n\nif left != right:\n print(0)\nelse:\n left_edge = (L) * (L - 1) % 2019\n right_edge = (R) * (R - 1) % 2019\n print(min(left_edge, right_edge))\n', "L, R = map(int, input().split())\nmod = 2019\nleft = L // mod\nright = R // mod\nl_... | ['Wrong Answer', 'Accepted'] | ['s185480149', 's282908071'] | [2940.0, 3064.0] | [17.0, 709.0] | [220, 331] |
p02983 | u680851063 | 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())\nprint(a,b)\nc = []\nif b - a >= 2019:\n print(0)\nelse:\n for i in range(a,b):\n for j in range(i+1,b+1):\n c.append((i*j)%2019)\n#print(c)\nprint(min(c))\n', '\n\n\n\na, b = map(int, input().split())\nif b-a >= 2019:\n print(0)\nelse:\n c = []\n for ... | ['Runtime Error', 'Accepted'] | ['s660073073', 's654118000'] | [75332.0, 75332.0] | [576.0, 607.0] | [203, 330] |
p02983 | u682271925 | 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_mod = l % 2019\nr_mod = r % 2019\nli = []\n\nif r - l > 2018:\n ans = 0\nfor i in range(l,r):\n for j in range(l,r):\n li.append((i * j) % 2019)\n\nans = min(li)\n\nprint(ans)', 'l, r = map(int,input().split())\n\nli = []\n\nif r - l > 2018:\n ans = 0\nelse:\n f... | ['Wrong Answer', 'Accepted'] | ['s434619547', 's189722544'] | [369176.0, 75332.0] | [2127.0, 571.0] | [211, 206] |
p02983 | u685662874 | 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\nans=[]\nif L < 2019:\n for i in range(n+1):\n l=L+i\n ans.append(l % 2019)\n a=ans.sort()\n print(a[0]*a[1])\nelse:\n if R < 4038:\n for i in range(n+1):\n l=L+i\n ans.append(l % 2019)\n a=ans.sort()\n print(a[0... | ['Runtime Error', 'Accepted'] | ['s082348405', 's721901452'] | [302488.0, 75316.0] | [2122.0, 1009.0] | [339, 304] |
p02983 | u685983477 | 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%=2019\nr%=2019\nres = 10000000000\nif(l>r):\n print(0)\nelse:\n for i in range(min(l,r),max(l,r)):\n for j in range(i+1, max(l,r)+1):\n print(l,r)\n res = min(res,(i*j)%2019)\n print(res)\n', 'print(0)', 'l,r=map(int, input().split())\nif(r-l>=201... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s213166120', 's902222878', 's550088066'] | [17404.0, 9136.0, 9024.0] | [1499.0, 25.0, 512.0] | [248, 8, 245] |
p02983 | u687044304 | 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\n\ndef solve():\n L, R = list(map(int, input().split()))\n MOD = 2019\n\n L %= MOD\n R = L+2019\n\n ans = MOD\n for i in range(L, R):\n for j in range(i+1, R+1):\n ans = min(ans, (i*j)%MOD)\n if ans == 0:\n print(ans)\n ... | ['Wrong Answer', 'Accepted'] | ['s009073381', 's233556459'] | [3064.0, 2940.0] | [18.0, 607.0] | [1156, 384] |
p02983 | u693933222 | 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\nls = l % 2019\nrs = r % 2019\n\ndif = r / 2019 - l / 2019\n\n#print("dif = {}".format(dif))\n\nif (dif != 0):\n print(0)\nelif (rs - ls == 1):\n print(ls*rs % 2019)\nelse:\n mini = []\n for i in range(ls, rs):\n mini.append(min(i * j % 2019 for j i... | ['Wrong Answer', 'Accepted'] | ['s592742966', 's124668512'] | [3060.0, 3060.0] | [17.0, 636.0] | [343, 345] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.