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 | u694810977 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 comb(n, k):\n m = 1\n if n < 2 * k:\n k = n - k\n for i in range(1, k + 1):\n m = m * (n - i + 1) / i \n return m % 2019\nL,R = map(int,input().split())\nmin = 999999999\nlists = list(range(L,R+1))\nfor i in range(len(lists)):\n if min > comb(L,lists[i]) and min !=1 :\n min ... | ['Runtime Error', 'Accepted'] | ['s508849543', 's824573176'] | [42356.0, 2940.0] | [2274.0, 783.0] | [335, 445] |
p02983 | u696444274 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 r-l >= 2019: \n ans = 0\nelif r-l >= 673: \n ans = 0\nelif l <= 2019 and 2019 <= r: \n ans = 0\nelif l <= 673 and 673 <= r and r-l >= 3: \n ans = 0\nelif r-l >= (r % 2019): \n ans = 0\nelif r-l >= (r % 673) and r-l >= 3: \n ans = 0\nelse:\n ans = (l*(l+1)) % 2019\n\nprint(ans)', 'l, r = ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s152450035', 's572296063', 's094726652'] | [3060.0, 3060.0, 9120.0] | [18.0, 17.0, 471.0] | [500, 590, 693] |
p02983 | u697559326 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nmini = 2019 \ncount1 = 0\n\nfor i in range(L,R):\n count2 = 0\n for j in range(i+1, R+1):\n print((i % mod) * (j % mod))\n if mini > ((i % mod) * (j % mod)):\n mini = ((i % mod) * (j % mod))\n count2 += 1\n if count2 == mod:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s637593746', 's867600441', 's703697625'] | [16152.0, 15816.0, 3060.0] | [2104.0, 2104.0, 1839.0] | [404, 394, 491] |
p02983 | u698771758 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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=2018\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n ans=min(ans,i*j%2018)\n if ans==0:\n print(0)\n exit()\nprint(ans)', 'L,R=map(int,input().split())\nans=2018\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n ans=min(ans,i*j... | ['Wrong Answer', 'Accepted'] | ['s821502821', 's158766738'] | [3316.0, 3060.0] | [58.0, 58.0] | [189, 189] |
p02983 | u698919163 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = 2020\n\nR = min(R,2020)\n\nfor i in range(L,R):\n for j in range(i+1,R-1):\n mod = (i*j)%2019\n if minimum > mod:\n minimum = mod\nprint(minimum)', 'L,R = list(map(int,input().split()))\n\nminimum = 2020\n\nR = min(R,2020)\n\nfor i in range... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s271405249', 's640420504', 's573270707'] | [3060.0, 3060.0, 2940.0] | [415.0, 412.0, 59.0] | [212, 212, 166] |
p02983 | u700805562 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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()\nans = 2019\nfor i in range(l, r+1):\n for j in range(i+1, r+1):\n ans = min(ans, (i*j)%2019)\nprint(ans)', '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 fo... | ['Runtime Error', 'Accepted'] | ['s749914045', 's285994609'] | [2940.0, 3060.0] | [17.0, 762.0] | [184, 185] |
p02983 | u701318346 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = 0\nif R - L >= 673:\n ans = 0\nelse:\n for i in range(L, R):\n for j in range(L + 1, R + 1):\n work = (i * j) % 2019\n print(i, j, work, ans)\n ans = min(ans, work)\n\nprint(ans)', 'L, R = map(int, input().split())\nMOD = 2019\nl ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s402744397', 's521432369', 's541494738'] | [9020.0, 3188.0, 2940.0] | [488.0, 20.0, 102.0] | [254, 336, 284] |
p02983 | u703712147 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nrl = r-l\nl2 = l%2019\nr2 = l2+rl\n\nif rl>2019:\n print(0)\nelse:\n min_dif = 2019\n for j in range(l2, r2+1):\n if (l2*j)%2019 < min_dif:\n min_dif = (l2*j)%2019\n print(min_dif)\n', 'l,r = map(int, input().split())\n\nrl = r-l\nl2 = l%2019\nr2 = l2+r... | ['Wrong Answer', 'Accepted'] | ['s959873149', 's227614387'] | [2940.0, 2940.0] | [17.0, 327.0] | [233, 272] |
p02983 | u704001626 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = list(map(int,input().split()))\nif R-L >= 2019:\n import sys\n print(0)\n sys.exit()\nmod_2019 = lambda x:x%2019\nret = 2020\nij_list = [i for i in range(L,R+1)]\nfor i in range(len(ij_list)):\n for j in range(i):\n k = mod_2019(ij_list[i]*ij_list[j])\n print(k... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s356987723', 's771082286', 's371048529'] | [12352.0, 12352.0, 3060.0] | [1969.0, 1904.0, 786.0] | [359, 379, 342] |
p02983 | u704563784 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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()\n\nl = l%2019\nr = r%2019\n\nif l >= r:\n print(0)\nelse:\n ans = float('inf')\n for left in range(l, r+1):\n for right in range(left+1, r+1):\n # ans = min(ans, (left*right)%2019)\n score = (left*right... | ['Runtime Error', 'Accepted'] | ['s438409609', 's839776082'] | [2940.0, 3064.0] | [17.0, 701.0] | [431, 282] |
p02983 | u706828591 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split(" "))\nmin = 1000000000000\nfor i in range(L%2019,(R+1)%2019 + 2019):\n for j in range(i+1,(R+1)%2019 + 2019):\n tmp = (i * j)%2019\n if min > tmp:\n min = tmp\nprint(min)\n', 'L,R = map(int,input().split(" "))\nmin = 1000000000000\nif (R-L >= 2019):\n print("0")\n quit()... | ['Wrong Answer', 'Accepted'] | ['s430415900', 's070213260'] | [2940.0, 2940.0] | [823.0, 390.0] | [205, 236] |
p02983 | u707030679 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 or L>R :\n print(0)\n exit()\nif L%2019+(R-L)>2019 :\n print(0)\n exit()\n\nans = (L*(L+1))%2019\nfor i in range(L%2019,R%2019):\n for j in range(L%2019,(R+1)%2019):\n ans = min( (i*j)%2019, ans)\n\nprint( ans )', 'L,R = map(int,input().split())\n\ni... | ['Wrong Answer', 'Accepted'] | ['s492170131', 's649239365'] | [9128.0, 9160.0] | [82.0, 1143.0] | [265, 308] |
p02983 | u708255304 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nflag = True\nfor i in range(L, L+2019):\n if flag:\n for j in range(i, L+2019):\n if j > R:\n flag = False\n break\n ans = min(((i % 2019) * (j % 2019)) % 2019, ans)\nprint(ans)\n', 'L, R = map(int, input().s... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s367118561', 's455078083', 's361126752'] | [2940.0, 3064.0, 2940.0] | [1069.0, 1032.0, 788.0] | [277, 277, 170] |
p02983 | u712822150 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nimport numpy as np\nINF = 1000000000\nMOD = 2019\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\ndef main():\n l, r = [int(e) for e in input().split()]\n ans = INF\n for i in range(l, min(l + MOD, r + 1)):\n for j in range(j + 1, min(l + MOD, r + 1)):\n ... | ['Runtime Error', 'Accepted'] | ['s099489105', 's682437782'] | [12448.0, 12448.0] | [148.0, 1008.0] | [377, 377] |
p02983 | u723583932 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['#abc133 c\nL,R=map(int,input().split())\nans=0\nR=min(R,L+2019*2)\nans=2018\namari=[]\nfor i in range(L,R+1):\n tmp=i%2019\n amari.append(tmp)\n if len(amari)==2019*2:\n break\nfor i in range(len(amari)):\n for j in range(len(amari)):\n if i==j:\n continue\n ans=min(ans,(am... | ['Wrong Answer', 'Accepted'] | ['s454260774', 's498576324'] | [3064.0, 3060.0] | [1938.0, 63.0] | [373, 230] |
p02983 | u724844363 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nij = [_ % 2019 for _ in range(L, R+1)]\nij_s = sorted(ij)\nif ij_s in 3 and 673:\n print(0)\nelse:\n print((ij_s[0]*ij_s[1]))', 'l, r = map(int, input().split())\nif r-l > 2019:\n print(0)\nelse:\n print(min(i * j % 2019 for i in range(l, r + 1) for j in range(l, i)))\n'] | ['Runtime Error', 'Accepted'] | ['s718828137', 's474113714'] | [846180.0, 2940.0] | [2156.0, 396.0] | [159, 142] |
p02983 | u729133443 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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());s=range(l,r+1);print(+(r-l<2019)and min(i*j%2019for i in s for j in s))', "s=range(*eval(input().replace(' ',',1+')))[:673];print(min(i*j%2019for i in s for j in s if i<j))"] | ['Wrong Answer', 'Accepted'] | ['s239941320', 's390162333'] | [2940.0, 2940.0] | [773.0, 74.0] | [100, 97] |
p02983 | u729300713 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nla = l % 2019\nlb = l // 2019\nra = r % 2019\nrb = r // 2019\nans = (la * ra) // 2019\n# (la + lb) * (ra * rb) // 2019\nprint(ans)\n', 'l, r = map(int, input().split())\nla = l % 2019\nlb = l // 2019\nra = r % 2019\nrb = r // 2019\nans = (la * ra) % 2019\n# (la + lb) * (ra * rb) // 2... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s059913320', 's393683319', 's456846494', 's859018322', 's963839483', 's986687118'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 3064.0] | [18.0, 17.0, 17.0, 425.0, 17.0, 376.0] | [158, 157, 245, 234, 119, 287] |
p02983 | u732061897 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\ntarget = 2019\nL_mod = L % target\nR_mod = R % target\n#print(L_mod,'L',R_mod,'R')\nif L_mod > R_mod:\n print(0)\n exit(0)\nif L_mod == R_mod and L < R:\n print(0)\n exit(0)\nif L_mod == R_mod:\n print(L_mod)\n exit(0)\nif L+1 == R:\n print(L * R % target)\n exi... | ['Wrong Answer', 'Accepted'] | ['s448643174', 's346830757'] | [3064.0, 3064.0] | [1240.0, 49.0] | [648, 709] |
p02983 | u732870425 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nif R - L >= 2018:\n ans = 0\nelse:\n for i in range(L, R+1):\n for j in range(L, R+1):\n ans = min(ans, i*j%2019)\n\nprint(ans)', 'L, R = map(int, input().split())\n\nans = 10**9\nif R - L >= 2018:\n ans = 0\nelse:\n for i in range(L, R+1)... | ['Wrong Answer', 'Accepted'] | ['s668592602', 's169496856'] | [2940.0, 3060.0] | [1471.0, 799.0] | [190, 192] |
p02983 | u733608212 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nfor i in range(l, r):\n if r > 2019:\n ans = 0\n break\n for j in range(r, l-1, -1):\n if i == j:\n break\n mod = (i * j) % 2019\n if mod < ans:\n ans = mod\nprint(ans)', 'l, r = map(int, input().split())\na... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s324865248', 's697329702', 's842340513', 's865596102', 's916085717', 's231934329'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 1590.0, 17.0, 2104.0, 2104.0, 1462.0] | [266, 201, 267, 203, 251, 199] |
p02983 | u736479342 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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=[]\n\nif R-L>=2019:\n ans=0\nelse:\n l, r = L%2019, R%2019\n for i in range(l,r):\n for j in range(l+1,r+1):\n k = (i*j) % 2019\n ans = min(ans,k)\nprint(ans)', 'L, R = map(int, input().split())\na=[]\n\nif R-L>=2019:\n ans=0\nelse:\n l, r = L%2019, R%2019\n ... | ['Runtime Error', 'Accepted'] | ['s254088927', 's634030188'] | [8896.0, 9096.0] | [29.0, 1108.0] | [203, 217] |
p02983 | u736729525 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['\ndef solve(L, R):\n M = 2019\n I = 0\n for i in range(L, R):\n m = i % 2019 \n if m == 0:\n return 0\n if m == M:\n I = i\n break\n if m < M:\n M = m\n I = i\n M = 2019\n J = I+1\n for i in range(I+1, R+1):\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s719396438', 's761071311', 's848711196', 's694695920'] | [3064.0, 3064.0, 4208.0, 4208.0] | [18.0, 18.0, 438.0, 438.0] | [596, 594, 1231, 1240] |
p02983 | u740284863 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["l,r = map(int,input().split())\nans = float('inf')\nif r - l + 1> 2019:\n print(0)\n exit()\nnum = list([i%2019 for i in range(l,r+1)])\nprint(list([i for i in range(l,r+1)]))\nnum.sort()\nans = num[0]*num[1]\n\nprint(ans)\n", 'l,r = map(int,input().split())\n\nif r - l + 1> 2019:\n print(0)\n exit()\nnum... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s330194507', 's601410539', 's987597560'] | [3188.0, 3188.0, 2940.0] | [19.0, 18.0, 864.0] | [219, 201, 243] |
p02983 | u745223262 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['list = input().split()\nl = int(list[0])\nr = int(list[1])\n\nmax = (l*(l+1))%2019\nfor i in range(l,r):\n for j in range(i+1,r+1):\n k = (i*j)%2019\n if k > max:\n max = k\nprint(max)\n ', 'list = input().split()\nl = int(list[0])\nr = int(list[1])\n# print(l, r)\nans=2018\nif r-l > 2019:\n\tmin = 201... | ['Wrong Answer', 'Accepted'] | ['s653915024', 's874956009'] | [2940.0, 3064.0] | [2104.0, 905.0] | [191, 246] |
p02983 | u745385679 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['print(0)', 'L, R = map(int, input().split())\nN = 2019\n\nif R - L > N:\n print(0)\nelse:\n tmp_i = tmp_j = 0\n num = -1\n for i in range(L, R):\n for j in range(i+1, R+1):\n if num == -1:\n num = i * j % 2019\n else:\n num = min(num, i * j % 2019... | ['Wrong Answer', 'Accepted'] | ['s273995912', 's966557530'] | [2940.0, 3188.0] | [17.0, 829.0] | [8, 309] |
p02983 | u747602774 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = 4000\n\nfor i in range(L,R+1):\n i %= 2019\n for j in range(i+1,R+1):\n ans = min(ans,i*j%2019)\n if ans == 0:\n break\n else:\n continue\n break\nprint(ans)\n', 'L,R = map(int,input().split())\nans = 4000\n\nfor i in range(L,R+1):\n ... | ['Wrong Answer', 'Accepted'] | ['s351836092', 's212501109'] | [9164.0, 9172.0] | [21.0, 56.0] | [228, 214] |
p02983 | u747703115 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nr = 2018\nll = min(l+2019, r)+1\nfor i in range(l, ll):\n for j in range(i+1, ll):\n r = min(r, i*j%2019)\n if r == 0:\n break\nprint(r)', 'l, r = map(int, input().split())\nr = 2018**2\nll = min(l+2019, r)+1\nfor i in range(l, ll):\n for j in range(i+1... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s003805152', 's407009946', 's957605606'] | [2940.0, 2940.0, 3060.0] | [20.0, 20.0, 58.0] | [190, 193, 203] |
p02983 | u748241164 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nL1 = L%2019\nR1 = R%2019\nL2 = L//2019\nR2 = R//2019\nans = 2018\nif L2 != R2:\n ans = 0\nelse:\n for i in range(L+1,R):\n for j in range(i+1,R):\n x = (i*j)%2019\n ans = min(ans,x)\nprint(ans)', 'L, R = map(int, input().split())\nL1 = L%2019\nR1 = R%2019\nL2 = L//2019... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s371481093', 's722837421', 's815475692'] | [3064.0, 3064.0, 3064.0] | [851.0, 820.0, 835.0] | [260, 265, 274] |
p02983 | u748311048 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nL-=2019*(L//2019)\nR-=2019*(L//2019)\nif R>=2019:\n print(0)\n exit() \n\n\nM=2019\nfor i in range(L, R+1):\n for j in range(i+1, R+1):\n M=min(M, (i*j)%2019)\n\nprint(M)', 'L, R = map(int, input().split())\nif R-L >= 2018:\n print(0)\nelse:\n ans = 2019\n for i in ran... | ['Wrong Answer', 'Accepted'] | ['s068354581', 's335195536'] | [3060.0, 2940.0] | [17.0, 766.0] | [281, 205] |
p02983 | u750378652 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nif r-l > 2019:\n l = l%2019\n r = r%2019 + 2019\n\nans = 2019\nfor i in range(l, r):\n for j in range(l+1, r+1):\n print(i, j)\n if (i*j) % 2019 < ans:\n ans = (i*j) % 2019\n\nprint(ans)', '#... | ['Wrong Answer', 'Accepted'] | ['s433707277', 's060169941'] | [35580.0, 3060.0] | [2104.0, 627.0] | [299, 370] |
p02983 | u753386263 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 end=R+1\nelse:\n end=L+2019\n\nmod=2019\nnum=0\nfor i in range(L,end):\n if i%2019<mod:\n mod=i%2019\n num=i\n\nprint(num,num+1)', 'L,R=map(int,input().split())\n\nif R<L+2019:\n end=R\nelse:\n end=L+2018\n\nans=2020*2020\nfor l in range(L,end):\n for r in ra... | ['Wrong Answer', 'Accepted'] | ['s809594918', 's758836743'] | [3060.0, 3060.0] | [17.0, 42.0] | [170, 218] |
p02983 | u755116850 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['\ndef main():\n l, r = list(map(int, input().split(" ")))\n \n m = 3000\n for i in range(l, r):\n for j in range(i, r+1):\n r = i*j % 2019\n if r == 0:\n print(0)\n return\n else:\n m = min(m, r)\n print(m)\n \n \nmain... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s091123227', 's857486861', 's288501521'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 40.0] | [305, 287, 366] |
p02983 | u758815106 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 mod(num):\n return num % 2019\n\nt1 = 10 ** 9\nt2 = 10 ** 9\n\nfor i in range(R, L + 1, -1):\n if mod(i) < t1:\n t2 = t1\n t1 = mod(i)\n\nif R - L == 1:\n print(mod(L * R))\nelse:\n print(mod(t1 * t2))\n', 'L, R = map(int, input().split())\n\ndef mod(n... | ['Wrong Answer', 'Accepted'] | ['s358756796', 's878802944'] | [9100.0, 9060.0] | [2206.0, 782.0] | [252, 264] |
p02983 | u759412327 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['a = list(map(int,input().split()))\nb = []\nd = [a[0]%10000,a[1]%10000]\ne = sorted(d)\n\nfor i in range(d[0],d[1]+1):\n for j in range(d[0],i):\n c = (i*j)%2019\n b.append(c)\nelse:\n print(b)', 'L,R = map(int,input().split())\nR = min(R,L+2019)\nans = 2019\n\nfor i in range(L,R+1):\n for j in range(i+1,R+1... | ['Wrong Answer', 'Accepted'] | ['s010174121', 's713991391'] | [107796.0, 9072.0] | [656.0, 708.0] | [191, 150] |
p02983 | u761000575 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\n\nstr = [int(i) for i in input().split()]\nl, r = str\n\nif l == 2019:\n print(0)\nelif l < 2019 and r >= 2019:\n print(0)\nelif l * r < 2019:\n print(l * (l + 1))\nelse:\n s = 2020\n for i in range(l, r):\n for j in range(i + 1, r + 1):\n print(i, j)\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s292309297', 's684103264', 's877185934'] | [46824.0, 46712.0, 12404.0] | [2108.0, 2108.0, 558.0] | [385, 418, 405] |
p02983 | u761471989 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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_2019 = L % 2019\nr_2019 = R % 2019\n\nif R - L >= 2017 or L == 0:\n print(0)\nelse:\n if l_2019 >= r_2019:\n print(0)\n else:\n if l_2019 >= 2019 - r_2019:\n if r_2019 % 3 == 0:\n print((r_2019-1)*(r_2019-2)%2019)\n elif... | ['Wrong Answer', 'Accepted'] | ['s181173531', 's922216214'] | [3064.0, 3060.0] | [19.0, 346.0] | [685, 265] |
p02983 | u762420987 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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**9 + 7\nfor i in range(L, min(L + mod, R)):\n for j in range(i + 1, min(i + mod, R)):\n ans = min((i * J) % mod, ans)\nprint(ans)', 'L, R = map(int, input().split())\nmod = 2019\nans = float("inf")\n\nfor i in range(L, min(R+1, L+mod+1)):\n for j in range(... | ['Runtime Error', 'Accepted'] | ['s547355771', 's766384664'] | [3060.0, 3060.0] | [17.0, 806.0] | [182, 191] |
p02983 | u762469320 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nfor h in range(0,2):\n\tfor i in range(l,r+1):\n\t\tif i % (2019+h) == 0:\n\t\t\tprint(h)\n\t\t\texit()\n\t\telif i % (673+h) == 0 and (r-l)>=2:\n\t\t\tprint(h)\n\t\t\texit()\n\t\telif i % (2019-h) == 0:\n\t\t\tprint(h)\n\t\t\texit()\n\t\telif i % (673-h) == 0 and (r-l)>=2:\n\t\t\tpr... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s004772931', 's069874391', 's083368504', 's325113957', 's367853013', 's442241488', 's461510877', 's733291045', 's785211771'] | [3952.0, 3064.0, 3060.0, 3824.0, 2940.0, 3064.0, 3064.0, 3064.0, 10624.0] | [25.0, 24.0, 18.0, 24.0, 18.0, 18.0, 27.0, 18.0, 113.0] | [394, 369, 271, 394, 196, 395, 396, 395, 445] |
p02983 | u763280125 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = list(map(int, input().split()))\nif math.ceil(L / 2019) <= R // 2019:\n print(0)\nelse:\n res = 0\n for i in range(L % 2019, R % 2019):\n for j in range(L % 2019 + 1, R % 2019 + 1):\n res = min(res, (i * j) % 2019)\n print(res)\n', 'import math\nINF = 2_000_000_001\nL... | ['Wrong Answer', 'Accepted'] | ['s500005232', 's576743842'] | [9108.0, 8896.0] | [1039.0, 1041.0] | [269, 291] |
p02983 | u763968347 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = []\nfor i in range(L,min(R,L+MOD)+1):\n l.append(i%MOD)\nl = sorted(l)\nprint(l)\nprint((l[0]*l[1])%MOD)', 'L,R = map(int,input().split())\nMOD = 2019\n\nans = 10**10\nfor i in range(L,min(R,L+MOD)+1):\n for j in range(i+1,min(R,L+MOD)+1):\n if ans > (i*j... | ['Wrong Answer', 'Accepted'] | ['s351783278', 's323192489'] | [3060.0, 3060.0] | [17.0, 447.0] | [149, 197] |
p02983 | u764956288 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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//2019 - L//2019\n\nif L % 2019 == 0:\n answer = 0\nelif diff > 0:\n answer = 0\nelse:\n L = L % 2019\n R = R % 2019\n _min = 2019\n for i in range(L, R+1):\n for j in range(i, R+1):\n _min = min(_min, (i * j) % 2019)\n answer = _min\n... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s325198591', 's572023936', 's630880391', 's878288959'] | [3060.0, 3060.0, 3060.0, 3064.0] | [701.0, 17.0, 744.0, 741.0] | [317, 161, 283, 285] |
p02983 | u765758367 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nN, D = map(int, input().split())\nx = [list(map(int,input().split())) for i in range(N)]\ntmp = 0\nans = 0\nfor i in range(N):\n for j in range(i + 1,N):\n for d in range(D):\n tmp += (x[i][d] - x[j][d])**2\n tmp = math.sqrt(tmp)\n if tmp.is_integer():\n ans ... | ['Runtime Error', 'Accepted'] | ['s075346484', 's899388897'] | [3064.0, 3064.0] | [17.0, 778.0] | [338, 207] |
p02983 | u768256617 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ["L.R=map(int,input().split())\nans=float('inf')\nfor i in range(L,R+1):\n for j in range(L,R+1):\n s=(i*j)%2019\n if s==0:\n print(0)\n exit()\n else:\n ans=min(s,ans)\n \nprint(ans)\n ", "L,R=map(int,input().split())\nans=float('inf')\nfor i in range(L,R):\n for j in range(L+1,R+1):\... | ['Runtime Error', 'Accepted'] | ['s521525735', 's170371164'] | [8968.0, 9164.0] | [29.0, 102.0] | [205, 210] |
p02983 | u771007149 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nl,r = map(int,input().split())\ntmp = []\nif r*(r-1) < 2019:\n print(r*(r-1))\n \nelse:\n if r - l > 2019 or l <= (r//2019) * 2019 <= r :\n print(0) \n else:\n for i in range(l,r+1):\n for j in range(i,r+1):\n m = (i*j) % 2019\n tmp.append(m... | ['Wrong Answer', 'Accepted'] | ['s348434361', 's167002239'] | [75480.0, 75408.0] | [619.0, 627.0] | [343, 346] |
p02983 | u776311944 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nmini = 2018\nminib = 2018\n\nif R-L >= 2019:\n print('0')\nelse:\n for i in range(L, R+1):\n if (i % 2019) < mini:\n mini = i % 2019\n ans = i\n if i % 2019 == 0:\n ans = 0\n print('0')\n break... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s378729572', 's839293518', 's295948421'] | [3064.0, 3064.0, 2940.0] | [692.0, 18.0, 757.0] | [543, 492, 199] |
p02983 | u776864893 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 \nL = L%2019\nR = L%2019\n \nmin_ans = 10**18\nfor i in range(L,R):\n for j in range(i+1,R+1):\n ans = (i*j)%2019\n \n if ans < min_ans:\n min_ans = ans\n if min_ans == 0:\n break\nprint(min_ans)\n', 'input_arr = [int(x) fo... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s001031519', 's172122751', 's296910694', 's427393980', 's761096344', 's895718903'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 46.0] | [277, 282, 205, 225, 264, 292] |
p02983 | u778926388 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 L %= 2019\n R %= 2019\n if L<R:\nm = 2019\n for i in range(L,R+1):\n for j in range(i+1,R+1):\n m = min(m, (i*j)%2019)\n print(m)\n else:\nprint(0)\n', 'L,R=map(int, input().split())\n\nif R-L+1>=... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s015411438', 's140419404', 's247498488', 's472075652', 's586402716'] | [2940.0, 2940.0, 2940.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 649.0] | [256, 168, 169, 170, 274] |
p02983 | u781262926 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['from itertools import combinations\n\nmod = 2019\n\nfor i, j in combinations(range(L, R+1), 2):\n i, j = i%mod, j%mod\n mini = min(mini, i*j % mod)\n if mini == 0:\n break\nprint(mini)', 'from itertools import combinations\n\nmod = 2019\nl, r = L % mod, R % mod\nif l > r:\n l, r = r, l\n\nmini = l*... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s366691535', 's553130304', 's867399461', 's938044046', 's165492972'] | [3060.0, 3060.0, 42356.0, 42356.0, 3060.0] | [17.0, 17.0, 2265.0, 2266.0, 68.0] | [191, 240, 200, 224, 275] |
p02983 | u782748646 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\ns=set()\nfor i in range(l+1, r):\n s.add(i%2019)\ns=list(s)\n\nans=math.inf\nfor i in range(len(s)):\n for j in range(i+1, len(s)):\n ans=min(ans, (s[i]*s[j])%2019)\n\nprint(ans)\n', "l,r=map(int, input().split())\n\nif r-l > 2019:\n s=list(range(0, 2019))... | ['Runtime Error', 'Accepted'] | ['s648765531', 's348651442'] | [3188.0, 3188.0] | [2104.0, 974.0] | [225, 281] |
p02983 | u784022244 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nA=[0]*(R-L+1)\nfor i in range(L, R+1):\n A[i]=i%mod\n \nA=sorted(A)\nprint((A[0]*A[1])%mod)', 'L, R=map(int, input().split())\nmod=2019\nA=[0]*(R-L+1)\nfor i in range(L. R+1):\n A[i]=i%mod\n \nA=sorted(A)\nprint((A[0]*A[1])%mod)', 'L,R=map(int, input().split())\n\nif R-L>... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s147900860', 's546336303', 's833871999'] | [674292.0, 674292.0, 3060.0] | [917.0, 846.0, 735.0] | [128, 128, 237] |
p02983 | u785578220 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\n\n\ngap = y-x\nF = 0\nt = x%2019\ne = y%2019\n\ntq = x%673\neq = y%673\n\nm = min(t,e)\nM = max(t,e)\n\nmq = min(tq,eq)\nMq = max(tq,eq)\n\nt2 = 2200\nt1 = (m*(m+1))%2019\nif gap > 672:\n t2 = 0\nif gap > 2 and (eq < tq):\n t2 = 0\n\nk = 1 \nif gap <= 2:\n for i in range(x,y+1... | ['Wrong Answer', 'Accepted'] | ['s925209662', 's632792077'] | [3064.0, 3060.0] | [17.0, 712.0] | [339, 229] |
p02983 | u790812284 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 i_l=[]\n for i in range(l,r):\n for j in (i+1,r+1):\n i_l.append((i%2019*j%2019)%2019)\n print(min(i_l))\n ', 'l,r=map(int,input().split())\n\nif r-l>=2019:\n print(0)\nelse:\n i_l=[]\n for i in range(l,r):\... | ['Runtime Error', 'Accepted'] | ['s545488977', 's484583549'] | [2940.0, 75392.0] | [17.0, 748.0] | [199, 208] |
p02983 | u791489811 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nr = r % 2019\nl = l % 2019\nif r<l:\n r = r+2019\nprint(l, r)\nmod = 2019\nfor i in range(l, r):\n for j in range(i+1, r+1):\n mod = min(mod, (i * j) % 2019)\n\nprint(mod)', 'l,r=map(int,input().split())\nmod=2019\nif r - l >= 2019:\n print("0")\nelse:\n for i in range... | ['Wrong Answer', 'Accepted'] | ['s992651461', 's730845763'] | [3060.0, 2940.0] | [702.0, 787.0] | [203, 190] |
p02983 | u795245552 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nl_mod = l % 2019\nr_mod = l_mod + (r - l + 1) % 2019 - 1\n\nfor i in range(l_mod, r_mod):\n for j in range(i + 1, r_mod + 1):\n tmp = (i * j) % 2019\n if (i = l_mod and j = i + 1) or tmp < ans:\n ans = tmp\n\nprint(ans)', 'l, r = [int(x) for x in... | ['Runtime Error', 'Accepted'] | ['s493005119', 's884269517'] | [2940.0, 3060.0] | [17.0, 990.0] | [280, 331] |
p02983 | u795630164 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\ndef f(i, j):\n if j - i >= MOD:\n return 0\n i %= MOD\n j %= MOD\n if i > j:\n return 0\n ans = 2018\n for a in range(i, j):\n for b in range(a+1, j+1):\n ans = min(ans, a*b%MOD)\n\nprint(f(L,R))\n\n', 'L, R = map(int, i... | ['Wrong Answer', 'Accepted'] | ['s779186870', 's598162269'] | [3060.0, 3060.0] | [523.0, 527.0] | [280, 295] |
p02983 | u796424048 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\n\nif L-R > 2018:\n print(0)\nelse:\n minMod = 100000000\n for i in range(L,R):\n\n for j in range(i+1,R+1):\n \n if tmp == 0:\n \t\t\tminMod = tmp\n \t\tbreak\n \t\telif minMod > (i*j)%2019:\n minMod = (i*j)%2019\n \t\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s283170298', 's955702740', 's217072705'] | [2940.0, 3060.0, 3060.0] | [17.0, 18.0, 66.0] | [311, 345, 304] |
p02983 | u797550216 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nmin_2019 = min(2019,r-l)\nmin = 10**9\nfor i in range(l,min_2019+l):\n j = i+1\n print(i,j)\n if min > (i*j)%mod:\n min = (i*j)%mod\n\nprint(min)', 'l,r = map(int,input().split())\nmod = 2019\nmin = 10**9\nc = 0\nfor i in range(l,r):\n for j in range(l+1,... | ['Wrong Answer', 'Accepted'] | ['s939519503', 's659167166'] | [3444.0, 3060.0] | [20.0, 68.0] | [195, 252] |
p02983 | u798818115 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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!\nimport heapq\n \nL,R=map(int,input().split())\n \nans=2018*2017\nif (R-L)>=2019:\n print("0")\nelse:\n l=list(range(L,R+1))\n for i in range(len(l)):\n for j in range(i+1,len(l)):\n print(l[i],l[j])\n ans=min(ans,(l[i]*l[j])%2019)\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s816449405', 's885481558', 's297834301'] | [30588.0, 3060.0, 3060.0] | [2104.0, 921.0, 933.0] | [320, 276, 342] |
p02983 | u802772880 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nif l%2019>r%2019 or r-l>=2018:\n ans=0\nelse:\n if l%673>r%673 or r-l>=672:\n ans=0\n else:\n ll=l%2019\n rr=r%2019\n ans=min((rr*((r-1)%2019))%2019,(ll*((l+1)%2019)%2019)\nprint(ans)', 'l,r=map(int,input().split())\nans=l*r%2019\nfor i in rang... | ['Runtime Error', 'Accepted'] | ['s946687979', 's176308982'] | [3060.0, 2940.0] | [20.0, 61.0] | [246, 198] |
p02983 | u804924310 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['lr = list(map(int, input().split()))\nl = lr[0]\nr = lr[1]\nlmod = l%2019\n\ndef minfunc(x, y):\n if x > y:\n return y\n else:\n return x\n\nif r - l >= 2019:\n print(0)\nelif 2019 <= r - l + lmod:\n print(0)\nelse:\n min = 9999999\n for i in list(map(lambda x: x%2019,range(l,r))):\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s160024925', 's231299932', 's496065727', 's877787174', 's971163445', 's067390207'] | [512548.0, 2940.0, 530084.0, 2940.0, 2940.0, 3064.0] | [2136.0, 17.0, 2136.0, 17.0, 18.0, 697.0] | [415, 416, 417, 189, 401, 447] |
p02983 | u812576525 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 A =[]\n for i in range(L ,R):\n for j in range(L+1,R+1):\n b = i*j % 2019\n A.append(b)\n ans = min(A) \n print(ans)', 'L,R = list(map(int, input().split()))\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s069132374', 's108410033', 's772342846'] | [4340.0, 93668.0, 147632.0] | [2104.0, 2108.0, 1361.0] | [265, 182, 241] |
p02983 | u812587837 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 abs(L-R)>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 print(ans)', 'L, R = map(int, input().split())\n\nif abs(L-R)>2019:\n print(0)\nelse:\n ans = 2019\n for i in range(L, R):\n ... | ['Runtime Error', 'Accepted'] | ['s408490890', 's381801848'] | [2940.0, 2940.0] | [17.0, 803.0] | [181, 197] |
p02983 | u814265211 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nR = min(R, L+2019)\nprint(min([i * j % 2019 for i in range(L, R+1) for jj in range(i+1, R+1)]))\n', 'L, R = map(int, input().split())\nR = min(R, L+2019)\nprint(min([i * j % 2019 for i in range(L, R+1) for j in range(i+1, R+1)]))\n'] | ['Runtime Error', 'Accepted'] | ['s927397142', 's290136660'] | [9160.0, 81188.0] | [22.0, 380.0] | [128, 127] |
p02983 | u814986259 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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*(L+1)<2019:\n print(L*(L+1))\n \nelse:\n if R == L+1:\n print(R*L%2019)\n else:\n r =673 - L % 673\n if L+r <= R:\n print("0")\n else:\n print(L*L+1%2019)\n \n ', 'L,R=map(int,input().split())\nif L*(L+1)<2019:\n print(L*(L+1))\n \nelse:\n if R == ... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s333198668', 's436444617', 's976585290', 's835817866'] | [2940.0, 2940.0, 2940.0, 3064.0] | [17.0, 18.0, 17.0, 39.0] | [213, 208, 183, 408] |
p02983 | u815763296 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 LI():\n return list(map(int, input().split()))\n\n\nL, R = LI()\nans = 2020\nfor i in range(L, min(R, L+L)):\n x = (i*i) % 2019\n for j in range(i, R+1):\n y = (i*j) % 2019\n ans = min(ans, x)\n if x == y:\n break\n if ans == 0:\n break\nprint(ans)\n', 'def LI():... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s049390637', 's543124679', 's652455633', 's655481466', 's383310321'] | [9120.0, 9092.0, 9000.0, 9172.0, 9008.0] | [25.0, 30.0, 31.0, 2205.0, 61.0] | [289, 281, 281, 252, 264] |
p02983 | u819407764 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nmin = 2019\nfor i in range(y - x):\n s = (x + i) % 2019\n if s == 0:\n print(s)\n break\n elif min > s:\n min = s:\nmin2 = 2019\nfor j in range(y -x):\n g = (x + i) % 2019\n if g == 0:\n break\n elif min2 > g and g == s:\n min2 =g\n\nif s != 0:\n z = (s*g)%2019\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s205133020', 's230346018', 's247642431', 's286431157', 's607808156', 's719068160', 's876799802', 's971704640', 's776729243'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 54.0] | [309, 356, 323, 330, 358, 310, 340, 328, 256] |
p02983 | u820047642 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nl,r=L%MOD,R%MOD\nif R>=L+2018:print(0)\nelif l>=r:print(0)\nelse:\n ans=MOD\n for i in range(l,r-1):\n for j in range(i+1,r):ans=min(ans,((i+1)*(j+1)%MOD))\n print(ans)', 'L,R=map(int,input().split())\nMOD=2019\nl,r=L%MOD,R%MOD\nif R>=L+2018:print(0)\nelif l>=r:... | ['Wrong Answer', 'Accepted'] | ['s212385113', 's266581744'] | [3064.0, 3064.0] | [803.0, 701.0] | [215, 209] |
p02983 | u821432765 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['print(0)\n', 'L, R = map(int, input().split())\nif R - L >= 2018:\n\tprint(0)\nelse:\n\tans = 2019\n\tfor i in range(L, R):\n\t\tfor j in range(i + 1, R + 1):\n\t\t\tans = min(ans, i * j % 2019)\n\tprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s995796756', 's372468674'] | [2940.0, 3060.0] | [17.0, 802.0] | [9, 177] |
p02983 | u821590705 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['[L, R] = map(int, input().split())\n\nres = 2018\nR2 = min(R+1, L+2019)\nfor i in range(L, R2):\n for j in range(i+1, R2):\n res = min(res, ((i % 2019) * (j % 2019)) % 2019)\n if res == 0:\n break\n\n print(res)\n', '[L, R] = map(int, input().split())\n\nres = 2018\nR2 = min(R+1, L+2019)\nfor i in ra... | ['Wrong Answer', 'Accepted'] | ['s325748542', 's278547125'] | [2940.0, 3060.0] | [70.0, 69.0] | [219, 213] |
p02983 | u821712904 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nmin1=2018\nif r-l>=2018:\n print(0)\n exit()\nelse:\n for i in range(l,r):\n for j in range(i+1,r+1):\n min=min(i*j%2019,min1)\nprint(min1)\n \n', 'l,r=map(int,input().split())\nif r-l>=2018:\n print(0)\n exit()\nmin1=2018\nelse:\n for i in range(l,r):\n for j in ra... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s254442055', 's457384000', 's192555743'] | [3060.0, 2940.0, 2940.0] | [19.0, 17.0, 758.0] | [179, 178, 179] |
p02983 | u823585596 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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=l//2019\nd=list(range(l,r+1))\nfor j in range(len(d)):\n d[j]%=2019\n d2=sorted(d)\n print(d2[0]*d2[1])\n', 'l,r=map(int,input().split())\nx=l//2019\nif 2019*x<l and r<2019*(x+1):\n ans=float("inf")\n for i in range(l,r):\n for j in range(i+1,r+1):\n an... | ['Runtime Error', 'Accepted'] | ['s803096929', 's290187318'] | [3126488.0, 9060.0] | [2316.0, 693.0] | [139, 217] |
p02983 | u824988704 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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//2019:\n print(l*(l+1)%2019)\n \nelse:\n print(0)\n ', 'l, r = [int(i) for i in input().split()]\n\nif l//2019 == r//2019:\n min_mod = 2017*2018\n for i in range(l, r):\n for j in range(l+1, r+1):\n temp = (i*j)%2019\n if temp < min_mod:\n ... | ['Runtime Error', 'Accepted'] | ['s614976384', 's256126303'] | [2940.0, 3060.0] | [17.0, 931.0] | [107, 249] |
p02983 | u826322976 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = input().split()\na = [int(i) for i in a]\n\na[0] = a[0] % 2019\na[1] = a[1] % 2019\n\nprint((a[0] * a[1]) % 2019)', 'a = input().split()\na = [int(i) for i in a]\nif (a[0] < 2019 and a[1] >= 2019) or (a[0] <= 2019 and a[1] >= 2019):\n print(0)\nelse:\n print((a[0] % 2019) * (a[1] % 2019) % 2019)', 'a = inpu... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s132064650', 's530345566', 's900358198', 's080617205'] | [2940.0, 3060.0, 2940.0, 3188.0] | [17.0, 19.0, 17.0, 617.0] | [111, 180, 111, 387] |
p02983 | u830616191 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['L,R = map(int,input().split())\nmin = L*(L+1)%2019\na = L\nb = L +1\nif(R > L + 2019):\n R = L + 2019\nfor i in range(L,R+1):\n for j in range(i+1,R+1):\n if(i<j):\n if(min > (i*j)%2019):\n min = (i*j)%2019\n a = i\n b = j\n if(min == 0):\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s347596810', 's627532407', 's885868596'] | [3064.0, 2940.0, 3064.0] | [49.0, 17.0, 49.0] | [364, 271, 360] |
p02983 | u831752983 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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=[]\nfor i in range(L,R+1):\n for j in range(i,R+1):\n A.append(i*j%2019)\nprint(min(A))', 'L,R=map(int,input().split())\nA=[]\nfor i in range(L,R+1):\n for j in range(i,R+1):\n A.append(i*j)\nprint(min(A))', 'L,R=map(int,input().split())\nA=[]\nR=min(R,L+2019)\nfor i in range(L... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s025430746', 's654724850', 's082191311'] | [365592.0, 520984.0, 75436.0] | [2126.0, 2136.0, 620.0] | [118, 113, 138] |
p02983 | u835924161 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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()\n\nans=int(10000000)\nfor i in range(l,r):\n for j in range(j+1,r+1):\n if ans>i*j:\n ans=i*j\n\nprint(ans)', 'l,r=map(int,input().split())\nif r-l>2019:\n print(0)\n exit()\n\nans=int(10000000)\nfor i in range(l,r):\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s188199160', 's315276107', 's071565077'] | [2940.0, 3060.0, 3060.0] | [17.0, 274.0, 712.0] | [186, 186, 214] |
p02983 | u837342248 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nl, r = l%m, l%m+(r-l)\nif r-l >= m-1:\n print(0)\n\nmi = 2018\nelse:\n for i in range(l, r):\n for j in range(i+1, r+1):\n m = (i*j)%2019\n mi = min(m, mi)\n print(mi)\n', 'l, r = map(int, input().split())\nm = 2019\nl, r = l%m, l%m+(r-... | ['Runtime Error', 'Accepted'] | ['s917307093', 's725393919'] | [2940.0, 3060.0] | [17.0, 700.0] | [238, 242] |
p02983 | u840988663 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\n\nhasamu=R-L\nkotae=10000\nif hasamu>2017:\n kotae=0\n\nfor i in range(L,R):\n for j in range(i+1,R+1):\n seki=i*j\n amari=seki%2019\n if amari<kotae:\n kotae=amari\nprint(kotae)\n \n', 'L2, R2= map(int, input().split())\n\nL=L2%2019\nR=R2%2019\n\nhasamu=R2-L2\nkotae=10000\ni... | ['Runtime Error', 'Accepted'] | ['s757082874', 's635990741'] | [3188.0, 3064.0] | [18.0, 473.0] | [210, 278] |
p02983 | u842043169 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 atexit\n# import io\nimport sys\n#\n _INPUT_LINES = sys.stdin.read().splitlines()\n input = iter(_INPUT_LINES).__next__\n _OUTPUT_BUFFER = io.StringIO()\n sys.stdout = _OUTPUT_BUFFER\n#\n\n @atexit.register\n def write():\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\n\nimport math\nR = lambda : map(... | ['Runtime Error', 'Accepted'] | ['s377726098', 's867537484'] | [2940.0, 3060.0] | [17.0, 58.0] | [518, 511] |
p02983 | u842651507 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\ni%=2019;j%=2019\n\nj+=2019\n \nans=2019\n\nfor x in range (i,j+1):\n for y in range (x+1,j+1):\n ans=min(ans,x*y%2019)\n \nprint(int(ans))\n', 'i,j=map(int,input().split())\n\ni%=2019;j%=2019\n\nif(i>j):j+=2019\n \nans=2019\n\nfor x in range (i,j+1):\n for y in range (x,j+1):\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s230257840', 's977446522', 's812694256'] | [2940.0, 3060.0, 75392.0] | [2104.0, 689.0, 400.0] | [165, 170, 121] |
p02983 | u843318346 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nnum2019 = r//2019 - l//2019\nans = 9999999999\nif num2019>=1 or l == 0 or l%2019 ==0:\n ans = 0\nelse:\n modr = r%2019\n modl = l%2019\n for i in range(l,r):\n tmp = (i*(i+1))%2019\n ans = min(ans,tmp)\nprint(ans)', 'l,r = map(int,input().split())\nnum2019 = r//20... | ['Wrong Answer', 'Accepted'] | ['s529703571', 's373454401'] | [3060.0, 3060.0] | [17.0, 856.0] | [256, 299] |
p02983 | u844005364 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nmod = 2019\n\nleft %= mod\n\nif right >= mod:\n right = (right % mod) + mod\nelse:\n right %= mod\n\nmin_mod = float("inf")\nfor i in range(left, right):\n for j in range(i + 1, right + 1):\n curr_mod = i * j % mod\n min_mod = min(min_mod, curr_mod)\n ... | ['Wrong Answer', 'Accepted'] | ['s650224506', 's895300585'] | [3060.0, 3060.0] | [21.0, 62.0] | [359, 308] |
p02983 | u844789719 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 R-L>2018:\n print(2018*2018)\nelse:\n ans=0\n for i in range(L,R+1):\n ans=max([ans,i])\n print(ans*ans)', 'import itertools\nL, R = [int(_) for _ in input().split()]\nif R - L > 2017 or L % 2019 > R % 2019:\n print(0)\n exit()\n\nL %= 2019\nR %= 2019... | ['Wrong Answer', 'Accepted'] | ['s752926214', 's084074525'] | [2940.0, 3060.0] | [18.0, 323.0] | [158, 233] |
p02983 | u847497464 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['l, r = [ int(_) for _ in input().split() ]\n\nif l > 2018:\n l = l%2019\nif r > 2018:\n l = l%2019 \n\nls = [2018]\n\nfor i in range(l,r):\n for j in range(i+1,r+1):\n if (i*j) % 2019 < min(x%2019 for x in ls):\n ls.append(i*j)\n \nprint(min([ x%2019 for x in ls]))', '#ABC 133 Rem... | ['Wrong Answer', 'Accepted'] | ['s536271024', 's499470699'] | [3060.0, 3060.0] | [2104.0, 143.0] | [288, 328] |
p02983 | u852367841 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = L // 2019\nM = R // 2019 \nprint(m, M)\n\nif m == M:\n ans = ((L - (2019 * m)) * (L- (2019 * m) + 1)) % 2019\n print(ans)\nelse: \n print(0)\n', 'L, R = map(int, input().split())\n\nmod_list = []\nmul_list = []\nif R >= L + 2019:\n print(0)\nelse: \n for i in ran... | ['Wrong Answer', 'Accepted'] | ['s402429490', 's819738482'] | [2940.0, 147688.0] | [17.0, 1803.0] | [225, 658] |
p02983 | u855781168 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['inp = input().split()\nl = int(inp[0])\nr = int(inp[1])\n\nint_list_pre = list(range(l,r+1))\nint_list = [s%2019 for s in int_list_pre]\nprint(int_list)\nl = len(int_list)\nmin_mod = 2018\n\nfor i in range(l):\n for j in range(l):\n if j > i:\n compare = (int_list[i] * int_list[j])%2019\n ... | ['Runtime Error', 'Accepted'] | ['s540043418', 's999201452'] | [93612.0, 3064.0] | [2284.0, 920.0] | [381, 452] |
p02983 | u857330600 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nif j-i>=2019:\n print(0)\nelif j%2019<i%2019:\n print(0)\nelse:\n min=2018\n for p in range(i,j):\n for q in range(p,j+1):\n if ((p%2019)*(q%2019))%2019<min:\n min=((p%2019)*(q%2019))%2019\n print(min)', 'i,j=map(int,input().split())\nif j-i>=2019:\n print(0)\nelif j... | ['Wrong Answer', 'Accepted'] | ['s259676213', 's377318862'] | [3064.0, 3064.0] | [605.0, 611.0] | [240, 242] |
p02983 | u857408368 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nI = 0\nJ = 0\nnow = 0\nmod = 2019\nfor i in range(R-L):\n if(i % 2019 == 0):\n mod = 0\n break\n for j in range(R-L-i):\n if (j % 2019 == 0):\n mod = 0\n break\n I = L + i\n J = L + i + j + 1\n now = (I * J) % 20... | ['Wrong Answer', 'Accepted'] | ['s602674765', 's503350596'] | [3060.0, 3064.0] | [17.0, 88.0] | [364, 460] |
p02983 | u860002137 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nans = []\n\ndef calc_mod(x, y):\n return x * y % 2019\n\nleft = L % 2019\nright = R % 2019\n\nif left==0 or right==0:\n print(0)\n sys.exit(0)\n\nelif left > right:\n right += 2019\n\nfor i in range(left, right):\n for j in range(1, right+1):\n ans.a... | ['Wrong Answer', 'Accepted'] | ['s907848348', 's796124585'] | [147608.0, 6808.0] | [1401.0, 58.0] | [337, 473] |
p02983 | u863370423 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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=int(input())\nb=int(input())\nc=((a)*(a+1))%2019\nprint(c', 'l, r = map(int, input().split())\nnums_of_2019 = r//2019 - (l-1)//2019\nif nums_of_2019 >= 2:\n print(0)\nelse:\n min_num = 2020\n for i in range(l,r):\n for j in range(i+1,r+1):\n min_num = min(min_num, (i*j)%2019)\n \n p... | ['Runtime Error', 'Accepted'] | ['s275843781', 's255769728'] | [2940.0, 3060.0] | [17.0, 785.0] | [56, 278] |
p02983 | u863397945 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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,C,D = map(int,input().split())\n\ncount = 0\n\nfor i in range(A,B+1):\n if not i % C == 0:\n if not i % D ==0:\n count += 1\n\nprint(count)', '#! python3\n# solve_133C.py\n\nL,R = map(int,input().split())\n\nans = 3000\n\nfor i in range(L,min(R,L+2019)):\n for j in range(i+1,min(R+1,L+201... | ['Runtime Error', 'Accepted'] | ['s796476281', 's433206157'] | [9156.0, 9152.0] | [32.0, 681.0] | [155, 198] |
p02983 | u863442865 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 import sys\n input = sys.stdin.readline\n sys.setrecursionlimit(10**7)\n from collections import Counter, deque\n #from collections import defaultdict\n from itertools import combinations, permutations, accumulate, groupby\n #from itertools import product\n from bisect import bis... | ['Wrong Answer', 'Accepted'] | ['s814197003', 's904791521'] | [3316.0, 3316.0] | [683.0, 668.0] | [789, 791] |
p02983 | u867848444 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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=0\nif r-l+1>=2019 or r%mod<l%mod:\n ans=0\nelse:\n for i in range(l%mod,r%mod):\n for j in range(i+1,r%mod+1):\n temp=(i*j)%mod\n ans=max(ans,temp)\nprint(ans)', 'l,r=map(int,input().split())\nmod=2019\nans=2018\nif r-l+1>=2019 or r%mod<l%... | ['Wrong Answer', 'Accepted'] | ['s671801614', 's212998833'] | [3060.0, 3060.0] | [816.0, 729.0] | [228, 233] |
p02983 | u868418093 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 cand = []\n ans = float("inf")\n for i in range(l,r+1):\n cand.append(i%2019)\n cand = sorted(cand)\n for i in range(len(cand)):\n for j in range(i,len(cand)):\n ans = min(ans,cand[i]*cand[j]%2019)\n pr... | ['Wrong Answer', 'Accepted'] | ['s098529313', 's285956661'] | [3060.0, 3064.0] | [832.0, 860.0] | [314, 316] |
p02983 | u872538555 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\ndic = {}\nfor i in range(l, r + 1):\n remainder = i % 2019\n if remainder in dic.keys():\n break\n else:\n dic[remainder] = 1\n\nl = list(dic.keys())\nl.sort()\n\nprint(l)\nprint((l[0] * l[1]) % 2019)', 'import sys\n\nl, r = map(int, input().split())\n\nif 20... | ['Wrong Answer', 'Accepted'] | ['s237997600', 's536280441'] | [3188.0, 3060.0] | [18.0, 1070.0] | [245, 246] |
p02983 | u874333466 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two integers i and j such that L \leq i < j \leq R. Find the minimum possible value of (i \times j) \mbox{ mod } 2019. | ['#include <bits/stdc++.h>\n#include <math.h>\nusing namespace std;\n\n\n \nint main() {\n int L, R;\n cin >> L >> R;\n \n int range = R - L;\n vector<int> mod;\n \n if (range >= 2019) {\n cout << 0 << endl;\n } else {\n for (int i = 0; i < (range + 1); i++) {\n f... | ['Runtime Error', 'Accepted'] | ['s872800983', 's727967542'] | [2940.0, 83632.0] | [17.0, 1097.0] | [608, 355] |
p02983 | u883203948 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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\nl = l % 2019\nr = r % 2019\nl = min(l,r)\nr = max(l,r)\nif r == l:\n print((r*l) %2019)\n exit()\nfor i in range(l,r+1):\n for j in range(i,r+1):\n if i != j:\n ans += [(i * j) %2019]\n \nprint(min(ans))\n', 'l,r = list(map(int,input().split()))\nif r-l >= 2019:... | ['Runtime Error', 'Accepted'] | ['s787460208', 's312412517'] | [3064.0, 75416.0] | [17.0, 745.0] | [246, 280] |
p02983 | u884982181 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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())\nr2 = r+0\nl%=2019\nr%=2019\nans = 20000\nif r2 >= r+2019:\n r += 2019\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n ans = min(i*j%2019,ans)\nprint(ans)', 'l,r = map(int,input().split())\nr2 = r+0\nl2 = l+0\nl%=2019\nr%=2019\nans = 20000\nif r2-l2 >= 2019 or r<=l:\n r += 20... | ['Wrong Answer', 'Accepted'] | ['s617543601', 's451437207'] | [3060.0, 3064.0] | [2103.0, 1307.0] | [185, 231] |
p02983 | u887207211 | 2,000 | 1,048,576 | You are given two non-negative integers L and R. We will choose two 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 = 2019\nfor i in range(1000):\n if L <= 3**i%(1e9+7) <= R or L <= 673**i%(1e9+7) <= R or L <= 3*673*i%(1e9+7) <= R or L <= 3*i%(1e9+7) <= R or L <= 673*i%(1e9+7) <= R or L <= 3*673**i%(1e9+7) <= R:\n print(0)\n exit()\nelse:\n print(min((L*(L+1))%mod, R*(R-1)%mod, R*L%mo... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s267239127', 's272043609', 's281907096', 's367822947', 's696923672', 's964520393', 's974910964', 's393459685'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3060.0, 3064.0, 3060.0] | [18.0, 19.0, 17.0, 17.0, 27.0, 19.0, 18.0, 104.0] | [313, 312, 292, 231, 236, 190, 326, 153] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.