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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02790 | u478452067 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['import numpy as np\n\na, b = input().split()\n\ns = []\ns.append(a*int(b))\ns.append(b*int(a))\n\ns = np.sort(s)\n\nprint(s)', 'import numpy as np\n \na, b = input().split()\n \ns = []\ns.append(a*int(b))\ns.append(b*int(a))\n \ns = np.sort(s)\n \nprint(s[0])'] | ['Wrong Answer', 'Accepted'] | ['s706289469', 's489475257'] | [12400.0, 13456.0] | [155.0, 182.0] | [114, 121] |
p02790 | u479462609 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=(int(x) for x in input().split())\nA=max(a,b)\nB=min(a,b)\nl=[]\nfor i in range(B):\n l.append(str(A))\no="".join(l)\nprint(o)', 'a,b=(int(x) for x in input().split())\nla=[]\nfor i in range(b):\n la.append(str(a))\nao="".join(la)\nlb=[]\nfor i in range(a):\n lb.append(str(b))\nbo="".join(lb)\nl=[]\nl.append(ao)\nl.append(bo)\nl.sort()\nprint(l[0])'] | ['Wrong Answer', 'Accepted'] | ['s704200222', 's799622356'] | [2940.0, 3316.0] | [17.0, 19.0] | [124, 209] |
p02790 | u488934106 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int, input().split())\n\nfor i in range(max(a,b)):\n print(min(a,b))', 'a,b = map(int, input().split())\nans = ""\n\nfor i in range(max(a,b)):\n ans += (str(min(a,b)))\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s195155397', 's283694004'] | [2940.0, 2940.0] | [17.0, 20.0] | [78, 105] |
p02790 | u492447501 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int, input().split())\n\n\na_s = ""\nb_s = ""\n\nfor _ in range(a):\n a_s = a_s + str(a)\n\nfor _ in range(b):\n b_s = b_s + str(b)\n\nif a_s <= b_s:\n print(a_s)\nelse:\n print(b_s)\n', 'a,b = map(int, input().split())\n\n\na_s = ""\nb_s = ""\n\nfor _ in range(b):\n a_s = a_s + str(a)\n\nfor _ in range(a):\n b_s = b_s + str(b)\n\nif a_s <= b_s:\n print(a_s)\nelse:\n print(b_s)\n'] | ['Wrong Answer', 'Accepted'] | ['s342829541', 's532392459'] | [2940.0, 2940.0] | [17.0, 18.0] | [190, 190] |
p02790 | u502200133 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nA = int(str(a) * b)\nB = int(str(b) * a)\nnlist = (A, B)\nsorted(nlist)\nif A != B:\n print(nlist[0])\nelse:\n print(A)\n', 'a, b = map(int, input().split())\nA = int(str(a) * b)\nB = int(str(b) * a)\nnlist = (A, B)\nnewlist = sorted(nlist)\nif A != B:\n print(newlist[0])\nelse:\n print(A)\n', 'a, b = map(int, input().split())\nA = list(str(a) * b)\nB = list(str(b) * a)\nif a >= b:\n print(str(a)*b)\nelse:\n print(str(b)*a)', 'a, b = map(int, input().split())\nA = list(str(a) * b)\nB = list(str(b) * a)\nif A[0] >= b[0]:\n print(str(a)*b)\nelse:\n print(str(b)*a)', 'a, b = map(int, input().split())\nA = int(str(a) * b)\nB = int(str(b) * a)\nnlist = (A, B)\nsorted(nlist)\nprint(nlist[0])', "a, b = map(int, input().split())\n\nl = ['{}'.format(a)*b, '{}'.format(b)*a]\nl.sort()\nprint(l[0])"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s151450694', 's322777355', 's378886500', 's852680959', 's892587148', 's888686886'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [18.0, 17.0, 17.0, 17.0, 18.0, 17.0] | [152, 164, 127, 137, 117, 95] |
p02790 | u503111914 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['S = [input().split()]\nS.sort()\nprint(S[0])', 'a,b = map(int,input().split())\nprint(str(min(a,b))*int(max(a,b)))'] | ['Wrong Answer', 'Accepted'] | ['s710148146', 's488545850'] | [2940.0, 2940.0] | [17.0, 17.0] | [42, 65] |
p02790 | u507113442 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\nprint(b**a if b>=a else a**b)\n', 'a,b=input().split()\n\nprint(min(a*int(b),b*(int(a)))', 'a,b=input().split()\nprint( min(a*int(b), b*(int(a) ) ) ', 'a,b=input().split()\nprint(min(a*int(b),b*(int(a))) \n', 'a,b=input().split()\n \nprint(min(a＊int(b),b＊(int(a) ) )\n \n', 'a,b\u3000=\u3000input().split()\n \nprint(min(a*int(b),b*(int(a) ) )', 'a, b=input().split()\n \nprint(min(a＊(int(b)),b＊(int(a) ) )\n', 'a,b=input().split()\nprint(min(a*(int(b),b*(int(a)))))\n', 'a,b=map(int,input().split())\nprint(b**a if b>=a else a**b)\n', 'a,b=input().split()\n \nprint(min(a*int(b),b*(int(a) ) )\n \n', 'a,b=map(int.input().split())\nprint(b**a if b>=a else a**b)', 'a,b=map(int,input().split())\nprint(b**a if a>=b else a**b)\n', 'a, b=input().split()\n \nprint(min(a*(int(b)),b*(int(a) ) )\n', 'a,b=input().split()\n \nprint(min(a＊int(b),b＊(int(a) ) )', 'a,b=input().split()\nprint( min (a*(int(b), b*(int(a) ) ) \n', 'a,b=map(int,input().split())\nprint(b**a if a>=b else a**b)', 'a,b = input().split()\n \nprint(min(a*int(b),b*int(a) ) )\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s158152039', 's168737679', 's194907855', 's222416802', 's395676110', 's413894455', 's565584950', 's656363075', 's678633032', 's709187301', 's740508614', 's756785997', 's847077062', 's878240779', 's882885392', 's980794396', 's045124371'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [59, 51, 55, 52, 66, 60, 62, 54, 59, 62, 58, 59, 58, 58, 58, 58, 56] |
p02790 | u508273185 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a , b =map(int,input().split())\n#print(a,b)\n\nif a < b :\n print(a*b)\nelse :\n print(b*a)', 'a , b =map(int,input().split())\n#print(a,b)\n\nif a < b :\n print(a*str(b))\nelse :\n print(b*str(a))', 'a , b =map(int,input().split())\n#print(a,b)\n\nif a < b :\n print(str(a)*b)\nelse :\n print(str(b)*a)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s683017344', 's870247315', 's193195743'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [92, 102, 103] |
p02790 | u508934152 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = input().split()\n\nA = int(a * int(b))\nB = int(b + int(a))\n\nif A > B:\n print(A)\nelse:\n print(B)', 'T = input().split()\n\na = T[0]\nb = T[1]\n\nA = int(a * int(b))\nB = int(b + int(a))\n\nif A > B:\n print(A)\nelse:\n print(B)\n \nprint(B)', 'a, b = map(str, input().split())\n\nA = int(a * int(b))\nB = int(b + int(a))\n\nif A > B:\n print(A)\nelse:\n print(B)', 'T = input().split()\n\na = T[0]\nb = T[1]\n\nA = int(a * int(b))\nB = int(b * int(a))\n\nif A > B:\n print(A)\nelse:\n print(B)\n \nprint(B)', '\na, b = map(str, input().split())\n\nA = int(a * int(b))\nB = int(b * int(a))\n\nif A > B:\n print(A)\nelse:\n print(B)\n \nprint(B)', 'a, b = map(str, input().split())\n\nA = int(a*(int(b)))\nB = int(b*(int(a)))\n\nif A <= B:\n print(B)\nelse:\n print(A)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s206165910', 's481285601', 's601925032', 's669447832', 's680465035', 's716350152'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 9028.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 29.0] | [102, 130, 112, 130, 125, 113] |
p02790 | u509392332 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int,input().split())\na_b = len(str(a))*b\nb_a = len(str(b))*a\nif a_b <= b_a:\n print(a_b)\nelse:\n print(b_a)', 'a, b = map(int,input().split())\na_b = str(a)*b\nb_a = str(b)*a\nab_list = [a_b,b_a]\nab_list.sort()\nprint(ab_list[0])'] | ['Wrong Answer', 'Accepted'] | ['s478685331', 's063912720'] | [2940.0, 2940.0] | [17.0, 18.0] | [122, 114] |
p02790 | u514118270 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = list(map(int,input().split()))\nif a <= b:\n print(a)*b\nelse:\n print(b)*a', 'a,b = list(map(int,input().split()))\nif a <= b:\n c = str(a)*b\n print(c)\nelse:\n d = str(b)*a\n print(d)\n'] | ['Runtime Error', 'Accepted'] | ['s869267507', 's468585845'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 106] |
p02790 | u528793636 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = input().split()\na_int = int(a)\nb_int = int(b)\nab = int(a*b_int)\nba = int(b*a_int)\nif ab >= ba:\n print(ba)\nelif ab <= ba:\n print(ab)', 'a,b = input().split()\na_int = int(a)\nb_int = int(b)\nab = a*b_int\nba = b*a_int\nif ab >= ba:\n print(ba)\nelif ab <= ba:\n print(ab)'] | ['Wrong Answer', 'Accepted'] | ['s809867895', 's398064044'] | [2940.0, 2940.0] | [17.0, 17.0] | [143, 133] |
p02790 | u529500825 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["M = input().split()\ni = 0\nalfa = ''\nif M[0] > M[1]:\n for i in range(int(M[1])):\n alfa += str(M[0])\n print(alfa)\nelif M[0] < M[1]: \n for i in range(int(M[0])):\n alfa += str(M[1])\n print(alfa)\nelif M[0] == M[1]: \n for i in range(int(M[0])):\n alfa += str(M[1])\n print(alfa)\nelse:\n print('')", 'M = input().split()\ni = 0\na = None\nb = None\nfor i in range(int(M[0])):\n a += str(M[1])\nalfa = int(a)\nfor i in range(M[1]):\n b += str(M[0])\nbeta = int(b)\ndelta = min(a,b)\nprint(delta)', "M = input().split()\ni = 0\na = ''\nb = ''\nc = ''\nif M[0] > M[1]:\n for i in range(int(M[1])):\n a += str(M[0])\n print(a)\nelif M[0] < M[1]: \n for i in range(int(M[0])):\n b += str(M[1])\n print(b)\nelif M[0] == M[1]: \n for i in range(int(M[0])):\n c += str(M[1])\n print(c)", "M = input().split()\ni = 0\na = ''\nb = ''\nfor i in range(int(M[0])):\n a += str(M[1])\nalfa = int(a)\nfor i in range(int(M[1])):\n b += str(M[0])\nbeta = int(b)\ndelta = str(min(alfa,beta))\nprint(delta)", "M = input().split()\ni = 0\na = ''\nb = ''\nc = [0,0]\nfor i in range(int(M[0])):\n a += str(M[1])\nfor i in range(int(M[1])):\n b += str(M[0])\nc[0] = int(a)\nc[1] = int(b) \nc.sort()\nprint(str(c[0]))", "M = input().split()\ni = 0\na = ''\nb = ''\nc = [0,0]\nfor i in range(int(M[0])):\n a += str(M[1])\nfor i in range(int(M[1])):\n b += str(M[0])\nc[0] = int(a)\nc[1] = int(b) \nc.sort()\nprint(c[0])", "M = input().split()\ni = 0\na = ''\nb = ''\nc = [0,0]\nfor i in range(int(M[0])):\n a += str(M[1])\nfor i in range(int(M[1])):\n b += str(M[0])\nc[0] = int(a)\nc[1] = int(b) \nc.sort()\nprint(str(c[1]))"] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s229351345', 's411927217', 's422300982', 's443918831', 's621928523', 's737423402', 's485202094'] | [3064.0, 3060.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 17.0, 17.0] | [332, 188, 308, 200, 197, 192, 197] |
p02790 | u534504780 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['num=[int(e) for e in input().split()]\nif num[0]>=num[1]:\n print(num[1]*(10**num[0]))\nelse:\n print(num[0]*(10**num[1]))', 'num=[int(e) for e in input().split()]\nA=str(num[0])\nB=str(num[1])\nif num[0]>=num[1]:\n for i in range(num[0]-1):\n B+=str(num[1])\n print(B)\nelse:\n for i in range(num[1]-1):\n\tA+=str(num[0])\n print(A)', 'num=[int(e) for e in input().split()]\nA=str(num[0])\nB = str(num[1])\n\nif num[0]>=num[1]:\n for i in range(num[0]-1):\n B+=str(num[1])\n print(B)\nelse:\n for i in range(num[1]-1):\n A+=str(num[0])\n print(A)\n'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s314702185', 's690928375', 's641029796'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [120, 203, 212] |
p02790 | u539123425 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\nA = ""\nB = ""\nfor i in range(0,b):\n A += str(b)\nfor j in range(0,a):\n B += str(a)\nprint(sorted([A,B])[0])', 'a,b = map(int,input().split())\nA = ""\nB = ""\nfor i in range(0,b):\n A += str(a)\nfor j in range(0,a):\n B += str(b)\nprint(sorted([A,B])[0])'] | ['Wrong Answer', 'Accepted'] | ['s405904026', 's445039555'] | [9048.0, 9032.0] | [24.0, 22.0] | [142, 142] |
p02790 | u539367121 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nprint(str(a)*b if a>=b else str(b)*a)', 'a, b = map(int, input().split())\nprint(str(a)*b if a<=b else str(b)*a)\n'] | ['Wrong Answer', 'Accepted'] | ['s774840253', 's843076437'] | [9088.0, 9148.0] | [28.0, 23.0] | [70, 71] |
p02790 | u541318412 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\n\nif a>=b:\n print(str(a)*b)\n\nelse:\n print(str(b)*a)', 'a,b = map(int,input().split())\n\nif a>=b:\n print(str(b)*a)\n\nelse:\n print(str(a)*b)'] | ['Wrong Answer', 'Accepted'] | ['s934068813', 's158389460'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 87] |
p02790 | u542774596 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int,input().split())\nmin_a=str(a)*b\nmin_b=str(b)*a\nprint(min(min_a, min_b)', 'a,b = map(int,input().split())\nmin_a=str(a)*b\nmin_b=str(b)*a\nprint(min(min_a, min_b))'] | ['Runtime Error', 'Accepted'] | ['s821125518', 's865490621'] | [8952.0, 9008.0] | [27.0, 23.0] | [85, 85] |
p02790 | u545221414 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a,b = list(map(int, input().split()))\nprint(a,b)\n\nif a > b:\n ans = ''\n for target_list in range(a):\n ans = ans + str(b)\n\n print(ans)\n\nif b > a:\n ans = ''\n for target_list in range(b):\n ans = ans + str(a)\n\n print(ans)\n \n\nif b == a:\nans = ''\n for target_list in range(b):\n ans = ans + str(a)\n\n print(ans)\n", "a,b = list(map(int, input().split()))\n\nif a > b:\n ans = ''\n for target_list in range(a):\n ans = ans + str(b)\n\n print(ans)\n\nif b > a:\n ans = ''\n for target_list in range(b):\n ans = ans + str(a)\n\n print(ans)\n \n\nif b == a:\nans = ''\n for target_list in range(b):\n ans = ans + str(a)\n\n print(ans)\n", "a,b = list(map(int, input().split()))\n\nif a > b:\n ans = ''\n for target_list in range(a):\n ans = ans + str(b)\n\n print(ans)\n\nif b > a:\n ans = ''\n for target_list in range(b):\n ans = ans + str(a)\n\n print(ans)\n \n\nif b == a:\n ans = ''\n for target_list in range(b):\n ans = ans + str(a)\n\n print(ans)\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s507820001', 's538710399', 's105503199'] | [2940.0, 2940.0, 3060.0] | [18.0, 17.0, 17.0] | [351, 340, 344] |
p02790 | u549278479 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = input().split()\nlist = [a, b]\nlist.sort()\nprint(int(list[0]))', "A,B = input().split()\na = int(A)\nb = int(B)\nout = ''\nif a > b:\n for i in range(a):\n out += B\nelse:\n for i in range(b):\n out += A\nprint(out)"] | ['Wrong Answer', 'Accepted'] | ['s682614318', 's047577685'] | [2940.0, 2940.0] | [17.0, 18.0] | [67, 159] |
p02790 | u554784585 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=input().split()\n\n\nA=a*int(b)\nB=b*int(a)\n\nla=len(A)\nlb=len(B)\n\nif la<lb:\n l=la\nelse:\n l=lb\n\nfor i in range(l):\n if int(A[i])-int(B[i])>0:\n print(B)\n break\n elif A[i]==B[i]:\n pass\n else:\n print(A)\n break\n\nprint(A)\n', 'a,b=input().split()\n\nli=[a*int(b),b*int(a)]\nli.sort()\n\nprint(li[0])\n'] | ['Wrong Answer', 'Accepted'] | ['s938947318', 's475437376'] | [3060.0, 2940.0] | [17.0, 17.0] | [266, 68] |
p02790 | u556589653 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\na_l = str(a)*a\nb_l = str(b)*b\nif a_l>b_l:\n print(b_l)\nelif b_l>a_l:\n print(a_l)\nelse:\n print(a_l)\n', 'a,b = map(int,input().split())\na_l = str(a)*a\nb_l = str(b)*b\nif a>b:\n print(b_l)\nelif b<a:\n print(a_l)\nelse:\n print(a_l)\n', 'a,b = map(int,input().split())\nk = str(a)\nl = str(b)\nX = k*b\nY = l*a\nif (X < Y):\n print(X)\nelse:\n print(Y)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s473374970', 's825270640', 's067663337'] | [2940.0, 2940.0, 9064.0] | [17.0, 17.0, 29.0] | [132, 124, 108] |
p02790 | u560988566 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int, input().split())\n\nif a < b:\n ans = str(a)*b\nelse:\n ans = str(a)*b\nprint(ans)', 'a,b = map(int, input().split())\n\nif a < b:\n ans = str(a)*b\nelse:\n ans = str(b)*a\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s581851017', 's849124312'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 97] |
p02790 | u562015767 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['A,B = map(int,input().split())\nAB = str(A) * B\nBA = str(B) * A\n\nif A > B:\n print(AB)\nelif A < B:\n print(BA)\nelse:\n print(AB)', 'A,B = map(str,input().split())\nAB = A * int(B)\nBA = B * int(A)\n\nif A >= B:\n print(AB)\nelif A < B:\n print(BA)', 'A,B = map(str,input().split())\nAB = A * int(B)\nBA = B * int(A)\n\nif A > B:\n print(AB)\nelif A < B:\n print(BA)\nelse:\n print(AB)', 'A,B = map(str,input().split())\nAB = A * int(B)\nBA = B * int(A)\n\nif A >= B:\n print(AB)\nelse:\n print(BA)', 'A,B = map(str,input().split())\nAB = A * int(B)\nBA = B * int(A)\n\nif A <= B:\n print(AB)\nelif A > B:\n print(BA)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s360252831', 's481039976', 's486454394', 's765847312', 's058483743'] | [3060.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [133, 114, 133, 108, 115] |
p02790 | u563595438 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\nl=[[1,1],[2,11],[3,111],[4,1111],[5,11111],[6,111111],[7,1111111],[8,11111111],[9,111111111]]\n\nc=0\nd=0\n\nfor i in range(9):\n if l[i][0]==a:\n c=b*l[i][1]\n if l[i][0]==b:\n d=a*l[i][1]\nprint(min(c,d))\n', 'a,b=map(int,input().split())\nl=[[1,1],[2,11],[3,111],[4,1111],[5,11111],[6,111111],[7,1111111],[8,11111111],[9,111111111]]\n\nc=0\nd=0\n\nfor i in range(9):\n if l[i][0]==a:\n c=b*l[i][1]\n if l[i][0]==b:\n d=a*l[i][1]\nif a>b:\n print(c)\nelse:\n print(d)'] | ['Wrong Answer', 'Accepted'] | ['s540332483', 's899816826'] | [3064.0, 3064.0] | [17.0, 17.0] | [246, 269] |
p02790 | u564770050 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a,b = map(int,input().split())\nans = ''\nif a <= b:\n for _ in range(b):\n ans.join(a)\nelse: \n for _ in range(a):\n ans.join(b)\nprint(ans)\n", "a,b = map(int,input().split())\nans = ''\nif a <= b:\n for _ in range(b):\n ans+=str(a)\nelse: \n for _ in range(a):\n ans+=str(b)\nprint(ans)\n"] | ['Runtime Error', 'Accepted'] | ['s841554968', 's920855650'] | [2940.0, 2940.0] | [17.0, 17.0] | [155, 155] |
p02790 | u566571310 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['import numpy as np\na = input()\nb = input()\na_int =int(a)\nb_int = int(b)\n# print(a)\n# print(b)\nc = ""\nif(a<b):\n for i in range(b_int):\n c += str(a)\n print(c)\n\nelse:\n for i in range(a_int):\n c += str(b)\n print(c)', 'import numpy as np\na,b=input().split()\n# print(a)\n# print(b)\na_int =int(a)\nb_int = int(b)\n# print(a)\n# print(b)\nc = ""\nif(a<b):\n for i in range(b_int):\n c += str(a)\n print(c)\n\nelse:\n for i in range(a_int):\n c += str(b)\n print(c)'] | ['Runtime Error', 'Accepted'] | ['s135378051', 's683288201'] | [12488.0, 12468.0] | [149.0, 150.0] | [236, 254] |
p02790 | u567406270 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a, b = map(int, input().split())\n\ns1 = ''\ns2 = ''\n\nfor i in range(a):\n s1 += str(a)\n\nfor i in range(b):\n s2 += str(b)\n \nif a < b:\n print(s1)\nelse:\n print(s2)", "a = int(input())\nb = int(input())\n\ns1 = ''\ns2 = ''\n\nfor i in range(a):\n s1 += str(a)\n\nfor i in range(b):\n s2 += str(b)\n \nif a < b:\n print(s1)\nelse:\n print(s2)", "a, b = map(int, input().split())\n\ns1 = ''\ns2 = ''\n\nfor i in range(b):\n s1 += str(a)\n\nfor i in range(a):\n s2 += str(b)\n \nif a < b:\n print(s1)\nelse:\n print(s2)"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s157899804', 's271335559', 's975203829'] | [2940.0, 3060.0, 3060.0] | [17.0, 17.0, 19.0] | [162, 163, 162] |
p02790 | u568559987 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a, b = map(int, input().split())\nprint('min(a, b)')\n", "a, b = map(int, input().split())\nprint('min(a, b)' * max(a, b))\n", 'a, b = map(int, input().split())\nprint(str(min(a, b)) * max(a, b))\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s272338336', 's496851771', 's252356434'] | [2940.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0] | [52, 64, 67] |
p02790 | u571832343 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a,b = input().split()\nab=''\nba=''\nfor i in range(int(b)):\n ab += a\nfor i in range(int(a)):\n ba += b\nl = [ab,ba]\nsorted(l)\nprint(l[0])", "a,b = input().split()\nab=''\nba=''\nfor i in range(int(b)):\n ab += a\nfor i in range(int(a)):\n ba += b\nl = [ab,ba]\nll = sorted(l)\nprint(ll[0])"] | ['Wrong Answer', 'Accepted'] | ['s681767360', 's228026250'] | [3060.0, 3060.0] | [17.0, 17.0] | [135, 141] |
p02790 | u572012241 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b= map(str, input().split())\na = a*int(b)\nb = b*int(a)\n\nif a < b:\n print(a)\nelse:\n print(b)\n# p = list(map(int,input().split()))\n\n# count = 0\n# val = sum(p[0:k])\n# val_lis = [val]\n# mx_val = val\n# index = 0\n# mx_index = 0\n# for i,j in enumerate(p[k:]):\n# val = val - p[index] + j\n# val_lis.append(val)\n# index +=1\n# if val > mx_val:\n# mx_index = index\n# mx_val = val \n \n# ans = 0\n\n# ans += ((p[mx_index + i]+1.0)*(p[mx_index+i]))/ (p[mx_index+i] *2.0)\n# print(ans) \n\n\n\n\n\n# print(sum(h[k:]))\n\n# s,t= map(str, input().split())\n# a,b= map(int, input().split())\n\n# print("x"*len(u))\n\n# if(u == s):\n# print(a-1,b)\n# else:\n# print(a,b-1)\n', 'a,b= map(str, input().split())\na = int(a*b)\nb = int(b*a)\n\nif a < b:\n print(a)\nelse:\n print(b)\n# p = list(map(int,input().split()))\n\n# count = 0\n# val = sum(p[0:k])\n# val_lis = [val]\n# mx_val = val\n# index = 0\n# mx_index = 0\n# for i,j in enumerate(p[k:]):\n# val = val - p[index] + j\n# val_lis.append(val)\n# index +=1\n# if val > mx_val:\n# mx_index = index\n# mx_val = val \n \n# ans = 0\n\n# ans += ((p[mx_index + i]+1.0)*(p[mx_index+i]))/ (p[mx_index+i] *2.0)\n# print(ans) \n\n\n\n\n\n# print(sum(h[k:]))\n\n# s,t= map(str, input().split())\n# a,b= map(int, input().split())\n\n# print("x"*len(u))\n\n# if(u == s):\n# print(a-1,b)\n# else:\n# print(a,b-1)\n', 'a,b= map(str, input().split())\na = int(a*int(b))\nb = int(b*int(a))\n\nif a < b:\n print(a)\nelse:\n print(b)\n# p = list(map(int,input().split()))\n\n# count = 0\n# val = sum(p[0:k])\n# val_lis = [val]\n# mx_val = val\n# index = 0\n# mx_index = 0\n# for i,j in enumerate(p[k:]):\n# val = val - p[index] + j\n# val_lis.append(val)\n# index +=1\n# if val > mx_val:\n# mx_index = index\n# mx_val = val \n \n# ans = 0\n\n# ans += ((p[mx_index + i]+1.0)*(p[mx_index+i]))/ (p[mx_index+i] *2.0)\n# print(ans) \n\n\n\n\n\n# print(sum(h[k:]))\n\n# s,t= map(str, input().split())\n# a,b= map(int, input().split())\n\n# print("x"*len(u))\n\n# if(u == s):\n# print(a-1,b)\n# else:\n# print(a,b-1)\n', 'a,b= map(str, input().split())\nab = a*int(b)\nba = b*int(a)\nif ab < ba:\n print(ab)\nelse:\n print(ba)\n# p = list(map(int,input().split()))\n\n# count = 0\n# val = sum(p[0:k])\n# val_lis = [val]\n# mx_val = val\n# index = 0\n# mx_index = 0\n# for i,j in enumerate(p[k:]):\n# val = val - p[index] + j\n# val_lis.append(val)\n# index +=1\n# if val > mx_val:\n# mx_index = index\n# mx_val = val \n \n# ans = 0\n\n# ans += ((p[mx_index + i]+1.0)*(p[mx_index+i]))/ (p[mx_index+i] *2.0)\n# print(ans) \n\n\n\n\n\n# print(sum(h[k:]))\n\n# s,t= map(str, input().split())\n# a,b= map(int, input().split())\n\n# print("x"*len(u))\n\n# if(u == s):\n# print(a-1,b)\n# else:\n# print(a,b-1)\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s306702620', 's465215044', 's986062222', 's422562133'] | [68084.0, 2940.0, 70260.0, 2940.0] | [34.0, 17.0, 2104.0, 17.0] | [751, 751, 761, 756] |
p02790 | u573234244 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = input().split()\n\na_ = a * int(a)\nb_ = b * int(b)\n\nmoji = sorted([a_ ,b_])\n\nprint(mojj[0])', 'a,b = input().split()\n \na_ = a * int(a)\nb_ = b * int(b)\n \nmoji = sorted([a_ ,b_])\n \nprint(moji[0])', 'a,b = input().split()\n \na_ = a * int(b)\nb_ = b * int(a)\n \nmoji = sorted([a_ ,b_])\n \nprint(moji[0])'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s536670610', 's788318997', 's918884518'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [95, 98, 98] |
p02790 | u584083761 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = list(map(int, input().split()))\nc = [a,b]\nc.sort()\nans = "".join(str(c[0])*c[0])\nprint(ans)', 'a,b = list(map(int, input().split()))\nc = [a,b]\nc.sort()\nans = "".join(str(c[0])*c[1])\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s472122363', 's224190493'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 97] |
p02790 | u597443755 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['#AtCorder\ndef main():\n\ta,b=map(int, input().split())\n\tif a*10**b <=b*10**a:\n\t\tprint(str(a)*b)\n\telse:\n\t\tprint(str(b)*a)\nmain()', '#AtCorder\ndef main():\n\ta,b=map(int, input().split())\n\tfor i in range(a)\n\tif a*10**b <=b*10**a:\n\t\tprint(str(a)*b)\n\telse:\n\t\tprint(str(b)*a)\nmain()', '#AtCorder\ndef main():\n\ta,b=map(int, input().split())\n\tif a <=b:\n\t\tprint(str(a)*b)\n\telse:\n\t\tprint(str(b)*a)\nmain()'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s194914724', 's360563819', 's743634037'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [125, 144, 113] |
p02790 | u599547273 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['A, B = map(int, input().split())\n\nprint(min(int(str(A)*B), int(str(B)*A)))', 'A, B = map(int, input())\n\nprint(min(int(str(A)*B), int(str(B)*A)))', 'A, B = map(int, input().split())\n\nprint(min(str(A)*B, str(B)*A))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s101339580', 's377737568', 's594248222'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [74, 66, 64] |
p02790 | u600261652 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nprint(a*int(b) if a*int(b) <= b*int(a) else b*int(a))', 'A, B = input()\nprint(min(A*int(B), B*int(A)))', 'a, b = map(int, input().split())\nprint(a*int(b) if a<=b else b*int(a))\n', 'A, B = input().split()\nprint(min(A*int(B), B*int(A)))'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s304019041', 's716456293', 's881320525', 's872865283'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 18.0, 16.0] | [86, 45, 71, 53] |
p02790 | u601321817 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = [int(x) for x in input().split()]\nif a <= b:\n return str(a) * b\nelse:\n return str(b) * a', 'a, b = [int(x) for x in input().split()]\nif a <= b:\n print(str(a) * b)\nelse:\n print(str(b) * a)'] | ['Runtime Error', 'Accepted'] | ['s209509244', 's516503935'] | [2940.0, 3064.0] | [17.0, 17.0] | [97, 97] |
p02790 | u606043821 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\n\n\nA = str(a)\nB = str(b)\n\nc =A\nd=B\n\nfor i in range(b):\n c = c+A;\n\nfor i in range(a):\n d = d+B\n \nif int(c) > int(d):\n print(d)\nelse:\n print(c)', 'a,b = map(int,input().split())\n\n\nA = str(a)\nB = str(b)\n\nc =""\nd=""\n\nfor i in range(b):\n c = c+A;\n\nfor i in range(a):\n d = d+B\n \nif c > d:\n print(d)\nelse:\n print(c)'] | ['Wrong Answer', 'Accepted'] | ['s201424005', 's559673121'] | [3060.0, 3060.0] | [17.0, 17.0] | [186, 178] |
p02790 | u607729897 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=input().split()\nprint(str(min(a,b))*max(a,b))', 'a,b=map(int,input().split())\nprint(str(min(a,b))*max(a,b))\n'] | ['Runtime Error', 'Accepted'] | ['s203123116', 's495230008'] | [2940.0, 3060.0] | [17.0, 18.0] | [49, 59] |
p02790 | u609502714 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['n, m = input().strip().split()\nif(n<m):\n for i in range(int(m)-1):\n print(n)\nelse:\n for i in range(int(n)-1):\n print(m)', 'n, m = input().strip().split()\nif(n<m):\n for i in range(int(m)):\n print(n)\nelse:\n for i in range(int(n)):\n print(m)', 'n, m = input().strip().split()\na = ""\nif(n<m):\n for i in range(int(m)):\n a += n\nelse:\n for i in range(int(n)):\n a += m\nprint(a)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s047362252', 's332702427', 's724104513'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [127, 123, 135] |
p02790 | u611090896 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = input().split()\nif int(a*int(b)) < int(b*int(a)):\n print(int(a*int(b)))\nelse:\n print(int(b*int(a)))', 'a,b = input().split()\nprint(a*int(b) if a>b else b*int(a))', 'a,b = input().split()\nprint(min(a*int(b),b*int(a)))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s276788926', 's553950518', 's353743328'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [107, 58, 51] |
p02790 | u620846115 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=input().split()\nc = a**b\nd = b**a\nif a<b:\n print(c)\nelse:\n print(d)', 'a,b=input().split()\nc = str(a)**b\nd = str(b)**a\nif a<b:\n print(c)\nelse:\n print(d)', 'a,b=map(int,input().split())\nc = ("a")**b\nd = ("b")**a\nif a<b:\n print(c)\nelse:\n print(d)', 'a,b=input().split()\nc = str(a)*int(b)\nd = str(b)*int(a)\nif a<b:\n print(c)\nelse:\n print(d)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s031674672', 's328012030', 's455490644', 's017880944'] | [9040.0, 8916.0, 9096.0, 9044.0] | [29.0, 25.0, 22.0, 25.0] | [73, 83, 90, 91] |
p02790 | u622847899 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a,b=map(int,input().split())\n\nm=min(a,b)\nans=''\nfor i in range(m):\n ans+=str(m)\nprint(ans)\n", "a,b=map(int,input().split())\n\nm=max(a,b)\nans=''\nfor i in range(m):\n ans+=str(m)\nprint(ans)\n", "a,b=map(int,input().split())\n\nmi=min(a,b)\nma=max(a,b)\nans=''\nfor i in range(ma):\n ans+=str(mi)\nprint(ans)\n"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s412207498', 's852728688', 's485289160'] | [2940.0, 2940.0, 2940.0] | [20.0, 17.0, 17.0] | [94, 94, 109] |
p02790 | u624613992 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\nif a>b:\n print(str(b)*a)a,b = map(int,input().split())\nif a>b:\n print(str(b)*a)\nelse:\n print(str(a)*b)', 'a,b = map(int,input().split())\nif a>b:\n print(str(b)*a)\nelse:\n print(str(a)*b)'] | ['Runtime Error', 'Accepted'] | ['s336744320', 's332624906'] | [2940.0, 2940.0] | [17.0, 17.0] | [136, 80] |
p02790 | u626228246 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\nif a >= b:\n print(b*int(a))\nelse:\n print(a*int(b))', 'a,b = map(str,input().split())\nif a >= b:\n print(b*int(a))\nelse:\n print(a*int(b))\n'] | ['Wrong Answer', 'Accepted'] | ['s349025232', 's096654001'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 84] |
p02790 | u629540524 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int, input().split())\nprint(min(a * int(b), b * int(a)))', 'a,b = input().split()\nprint(min(a * int(b), b * int(a)))'] | ['Wrong Answer', 'Accepted'] | ['s141754247', 's691322516'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 56] |
p02790 | u629607744 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\na_string=a*int(b)\nb_string=b*int(a)\nanswer=sorted([a_string,b_string])\nprint(answer[0])', 'def i():\n\treturn int(input())\ndef i2():\n\treturn map(int,input().split())\ndef s():\n\treturn str(input())\ndef l():\n\treturn list(input())\ndef intl():\n\treturn list(int(k) for k in input().split())\n\na,b = i2()\na1 = ""\nb1 = "" \nfor i in range(b):\n\ta1 += str(a)\nfor i in range(a):\n\tb1 += str(b)\n\nif a1 < b1:\n\tprint(a1)\nelse:\n\tprint(b1)'] | ['Wrong Answer', 'Accepted'] | ['s466243868', 's555791256'] | [2940.0, 9116.0] | [17.0, 24.0] | [116, 327] |
p02790 | u634602776 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\nhai1=[]\nhai2=[]\nfor k in range(0,a):\n hai1.append(str(b))\nfor i in range(0,b):\n hai2.append(str(a))\nak="".join(hai1)\nbk="".join(hai2)\nc=[0]*2\nc[0]=int(ak)\nc[1]=int(bk)\nc.sort()\nprint(c[0])', 'a,b=map(int,input().split())\nhai1=[]\nhai2=[]\nfor k in range(0,a):\n hai1.append(str(b))\nfor i in range(0,b):\n hai2.append(str(a))\nak="".join(hai1)\nbk="".join(hai2)\nc=[0]*2\nc[0]=ak\nc[1]=bk\nc.sort()\nprint(int(c[0]))'] | ['Wrong Answer', 'Accepted'] | ['s996560769', 's181461709'] | [3064.0, 3064.0] | [17.0, 17.0] | [219, 214] |
p02790 | u645581835 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['myList = []\na,b=map(int,input().split())\nif(b>a):\n for x in range(b):\n myList.append(a)\n for x in range(len(myList)): \n print(myList[x])\nelse:\n for x in range(a):\n myList.append(b)\n for x in range(len(myList)): \n print(myList[x])', 'a,b=map(int,input().split())\nif(b>a):\n for x in range(a):\n print(b)\nelse:\n for x in range(b):\n print(a)', 'a,b = map(int, input().split())\naList = [b]*a\nbList = [a]*b\ni = 0\nl = min(len(bList),len(aList))\nif a==b:\n pass\nelse:\n while aList[i]==bList[i]:\n i+=1\n if i+1==l:\n break\nif aList[i]>bList[i]:\n print(*bList,sep="")\nelse:\n print(*aList,sep="")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s215291936', 's784001179', 's441505487'] | [3060.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [269, 123, 278] |
p02790 | u646445992 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int, input().split())\nans = ""\nif a>b:\n for i in range(a):\n ans = ans + str(a)\n print(ans)\nelse:\n for i in range(b):\n ans = ans + str(b)\n print(ans)', 'a,b = map(int, input().split())\nans = ""\nif a>b:\n for i in range(a):\n ans = ans + str(a)\n print(int(ans))\nelse:\n for i in range(b):\n ans = ans + str(b)\n print(int(ans))', 'a,b = list(map(int, input().split()))\n\nans = ""\nif a>b:\n for i in range(a):\n ans = ans + str(b)\n print(ans)\nelse:\n for i in range(b):\n ans = ans + str(a)\n print(ans)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s332748190', 's997612728', 's704726132'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [184, 194, 191] |
p02790 | u648257619 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nprint(str(max(a,b))*min(a,b))', 'a, b = map(int, input().split())\nprint(str(min(a,b))*max(a,b))'] | ['Wrong Answer', 'Accepted'] | ['s243446254', 's713404807'] | [2940.0, 2940.0] | [17.0, 17.0] | [62, 62] |
p02790 | u652081898 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['n, m = input().split()\nif n*int(m) > m*int(n):\n print(n*int(m))\nelse:\n print(m*int(n))', 'n, m = input().split()\nif n*int(m) < m*int(n):\n print(n*int(m))\nelse:\n print(m*int(n))\n'] | ['Wrong Answer', 'Accepted'] | ['s816509981', 's297646037'] | [2940.0, 2940.0] | [17.0, 17.0] | [88, 89] |
p02790 | u652656291 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a,b =map(int,input().split())\nif a > b:\n print('b'*a)\nelse:\n print('a'*b)", 'a,b=map(str,input().split())\nc = a*len(a)\nd = b*len(b)\nif str(c) <= str(d):\n print(str(c))\nelse:\n print(str(d))', 'a,b=map(str,input().split())\nc = a*len(b)\nd = b*len(a)\nif str(c) >= str(d):\n print(str(c))\nelse:\n print(str(d))', 'a,b=map(str,input().split())\nc = a*len(b)\nd = b*len(a)\nif str(c) <= str(d):\n print(str(c))\nelse:\n print(str(d))', 'a,b = map(int,input().split())\nA = str(a)*b\nB = str(b)*a\nif A <= B:\n print(A)\nelse:\n print(B)\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s663988097', 's664304242', 's887090645', 's970245014', 's871487032'] | [2940.0, 3060.0, 2940.0, 2940.0, 9048.0] | [17.0, 17.0, 17.0, 17.0, 24.0] | [79, 113, 113, 113, 96] |
p02790 | u656330453 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = input().split()\nif a >= b:\n print(a*int(b))\n break\nelse:\n print(b*int(a))', 'a, b = input().split()\nprint(a*int(b) if a < b else b*int(a))'] | ['Runtime Error', 'Accepted'] | ['s513783030', 's033320566'] | [2940.0, 2940.0] | [17.0, 17.0] | [83, 61] |
p02790 | u656803083 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int,input().split())\na = ("".join(a))*b', 'a, b = map(int,input().split())\na1, b1 = str(a) * b, str(b) * a\nans = min(a1[0],b1[0])\nif int(ans) == b:\n print(b1)\nelse:\n print(a1)'] | ['Runtime Error', 'Accepted'] | ['s421692814', 's535951804'] | [9068.0, 9096.0] | [22.0, 23.0] | [50, 134] |
p02790 | u663093503 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['N,M = map(int, input().split())\n\nprint(str(max(N,M)) * min(N,M))', 'N,M = map(int, input().split())\n\nprint(str(min(N,M)) * max(N,M))'] | ['Wrong Answer', 'Accepted'] | ['s719862773', 's638254031'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 64] |
p02790 | u665598835 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['#!/usr/bin/env python3\na, b = input().split(" ")\nfor i in range(a):\n a += a\nfor i in range(b):\n b += b\nprint(sorted([a, b])[0])', '#!/usr/bin/env python3\na, b = input().split(" ")\nA = a * int(b)\nB = b * int(a)\nprint(sorted([A, B])[0])'] | ['Runtime Error', 'Accepted'] | ['s998224551', 's210354563'] | [2940.0, 2940.0] | [17.0, 17.0] | [133, 103] |
p02790 | u667024514 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b =map(int,input().split())\nif a >= b:\n print(str(a) * b)\nelse:\n print(str(b) * a)', 'a,b =map(int,input().split())\nif a >= b:\n print(str(b) * a)\nelse:\n print(str(a) * b)'] | ['Wrong Answer', 'Accepted'] | ['s186265088', 's031870678'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 87] |
p02790 | u670942818 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['L, R = map(int,input().split())\nl = str(L)\nr = str(R)\nlast_l = ""\nlast_r = ""\nfor i in range(L):\n last_r += r \nfor i in range(R):\n last_l += l \nif L > R:\n print(last_r)\nelse:\n print(last_l', 'L, R = map(str,input().split())\nlist = [L, R]\nsorted(list)\nprint(list[0])\n', 'L, R = map(int,input().split())\nl = str(L)\nr = str(R)\nlast_l = ""\nlast_r = ""\nfor i in range(L):\n last_l += l \nfor i in range(R):\n last_r += r \n \nif L > R:\n print(last_r)\nelse:\n print(last_l) ', 'L, R = map(int,input().split())\nl = str(L)\nr = str(R)\nlast_l = ""\nlast_r = ""\nfor i in range(L):\n last_r += r \nfor i in range(R):\n last_l += l \nif L > R:\n print(last_r)\nelse:\n print(last_l)\n'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s074857735', 's222590793', 's799031561', 's645276497'] | [2940.0, 2940.0, 3060.0, 2940.0] | [18.0, 17.0, 17.0, 18.0] | [204, 74, 207, 206] |
p02790 | u674190122 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['# 7 7\na, b = [xfor x in input().split()]\nprint(sorted([a * b, b * a])[-1])', 'a, b = [x for x in input().split()]\nprint(sorted([a * int(b), b * int(a)])[0])\n'] | ['Runtime Error', 'Accepted'] | ['s769787267', 's592304478'] | [2940.0, 2940.0] | [17.0, 17.0] | [74, 79] |
p02790 | u674588203 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input())\nA=int(str(a)*b)\nB=int(str(b)*a)\nprint(min(A,B))', 'a,b=map(int,input().split())\nA=str(a)*b\nB=str(b)*a\nprint(min(int(A),int(B)))', 'a,b=map(int,input())\nA=str(a)*b\nB=str(b)*a\nprint(min(int(A),int(B)))', 'a,b=map(int,input().split())\nif a<b:\n print(str(a)*b)\nelse:\n print((str(b)*a))'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s213667543', 's603374969', 's914984506', 's208147744'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0, 17.0] | [68, 76, 68, 84] |
p02790 | u676401805 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = input().split()\n\nprint ( str(a)*b if a >= b else str(b)*a) ', 'a, b = input().split()\n\nprint ( a*int(b) if int(a) <= int(b) else b*int(a)) '] | ['Runtime Error', 'Accepted'] | ['s504613075', 's574942176'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 76] |
p02790 | u682721153 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['r=input()\nk=r.split()\n\nt1=t2=0\nfor i in range(k[2]):\n t1 += k[0]\nfor i in range(k[0]):\n t2 += k[2]\n \njj=[t1,t2]\njj.sort(reverse=True)\nprint(jj[0])', "r = input()\nk=r.split()\n\n\n\nt1=t2=''\n\nt1=k[0]*int(k[1])\nt2=k[1]*int(k[0])\n\n\n\nrr = [t1,t2]\n\nrr.sort()\n\nprint(rr[0])"] | ['Runtime Error', 'Accepted'] | ['s347506340', 's484247523'] | [3060.0, 3060.0] | [17.0, 17.0] | [155, 113] |
p02790 | u682860781 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = input().split()\n\nans = min(int(a * int(b)), int(b * int(a)))\nprint(ans)\n', 'a, b = input().split()\n\nans = min(a * int(b), b * int(a))\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s322565788', 's919038232'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 69] |
p02790 | u683956577 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['num = list(map(int, input().split()))\n\nif num[0] == num[1]:\n max = num[0]\n min = num[1]\nelse:\n max = max(num[0],num[1])\n min = min(num[0],num[1])\n \nprint(str(max)*min)', 'num = list(map(int, input().split()))\n\nif num[0] == num[1]:\n max = num[0]\n min = num[1]\nelse:\n max = max(num[0],num[1])\n min = min(num[0],num[1])\n \nprint(str(min)*max)'] | ['Wrong Answer', 'Accepted'] | ['s771515467', 's885430924'] | [3060.0, 3060.0] | [17.0, 17.0] | [172, 172] |
p02790 | u684164049 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a,b = map(int, input.split())\n\nif a < b:\tprint(str(a+'0') * b )\nelse:\tprint(str(b+'0') * a )", 'a,b = map(int, input().split())\n\nif a < b:\tprint(str(a) * b )\nelse:\tprint(str(b) * a )'] | ['Runtime Error', 'Accepted'] | ['s691884092', 's377643115'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 86] |
p02790 | u687574784 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['# -*- coding: utf-8 -*-\na,b = list(map(int, input().split()))\nprint(max(str(a)*b, str(b)*a))', '# -*- coding: utf-8 -*-\na,b = list(map(int, input().split()))\nprint(min(str(a)*b, str(b)*a))'] | ['Wrong Answer', 'Accepted'] | ['s683251623', 's281080006'] | [2940.0, 2940.0] | [17.0, 17.0] | [92, 92] |
p02790 | u692054751 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['def LI():\n return [int(s) for s in input().split()]\na,b = LI()\n\nif a <= b:\n print(str(a)*a) \nelse:\n print(str(b)*b)\n ', 'def LI():\n return [int(s) for s in input().split()]\na,b = LI()\n\nif a <= b:\n print(str(a)*b) \nelse:\n print(str(b)*a)'] | ['Wrong Answer', 'Accepted'] | ['s140735947', 's785562985'] | [2940.0, 2940.0] | [17.0, 17.0] | [123, 120] |
p02790 | u692311686 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\nA=str(a)*b\nB=str(b)*a\nif len(A)>len(B):\n print(B)\nelif len(B)>len(A):\n print(A)\nelse:\n for i in range(len(A)):\n if int(A[i])>int(B[i]):\n print(A)\n elif int(A[i])<int(B[i]):\n print(B)\n print(A)', 'a,b=map(int,input().split())\nA=str(a)*b\nB=str(b)*a\nif len(A)>len(B):\n print(B)\nelif len(B)>len(A):\n print(A)\nelse:\n for i in range(len(A)):\n if int(A[i])>int(B[i]):\n print(B)\n elif int(A[i])<int(B[i]):\n print(A)\n if i==len(A)-1:\n print(A)', 'a,b=map(int,input().split())\nA=str(a)*b\nB=str(b)*a\nfor i in range(min(len(A),len(B))):\n if int(A[i])>int(B[i]):\n print(B)\n break\n elif int(A[i])<int(B[i]):\n print(A)\n break\n if i==min(len(A),len(B))-1:\n print(A)'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s026424151', 's965887120', 's754076780'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 16.0] | [241, 265, 229] |
p02790 | u695655590 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["A,B = map(int, input().split())\nAns = ''\n\nif A <= B:\n for i in range(A):\n Ans = Ans + str(B)\n\nelse:\n for j in range(B):\n Ans = Ans + str(A)\n\nprint(Ans)", "A,B = map(int, input().split())\nAns = ''\n\nif A <= B:\n for i in range(B):\n Ans = Ans + str(A)\n\nelse:\n for j in range(A):\n Ans = Ans + str(B)\n\nprint(Ans)"] | ['Wrong Answer', 'Accepted'] | ['s699698403', 's533648007'] | [2940.0, 2940.0] | [17.0, 17.0] | [159, 159] |
p02790 | u696969901 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = map(int,input().split())\n\na1 = str(a)\nb1 = str(b)\n\nfor i in range(b):\n a1 = a1 + str(a)\nfor i in range(a):\n b1 = b1 + str(b)\n\nif a1 < b1:\n print(a1)\nelse:\n print(b1)', "a,b = map(int,input().split())\n\na1 = ''\nb1 = ''\n\nfor i in range(b):\n a1 = a1 + str(a)\nfor i in range(a):\n b1 = b1 + str(b)\n\nif a1 < b1:\n print(a1)\nelse:\n print(b1)"] | ['Wrong Answer', 'Accepted'] | ['s066346094', 's859816916'] | [3060.0, 3060.0] | [17.0, 17.0] | [183, 175] |
p02790 | u697101155 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a, b = map(int, input().split())\n\nla = ''\nlb = ''\n\nfor i in range(b):\n la += a\n lb += b\n\nif a <= b:\n print(la)\nelse:\n print(lb)\n\n", "a, b = map(int, input().split())\n\nla = ''\nlb = ''\n\nfor i in range(b):\n la += str(a)\n\nfor i in range(a):\n lb += str(b)\n\nif a <= b:\n print(la)\nelse:\n print(lb)\n\n"] | ['Runtime Error', 'Accepted'] | ['s403288713', 's025162008'] | [2940.0, 2940.0] | [17.0, 17.0] | [141, 171] |
p02790 | u697696097 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\n\nif a<b:\n print(str(a)*b)\nelse\n print(str(b)*a)', 'a,b=map(int,input().split())\n\nif a<b:\n print(str(a)*b)\nelse:\n print(str(b)*a)\n'] | ['Runtime Error', 'Accepted'] | ['s377463887', 's088344769'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 80] |
p02790 | u698868214 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = int(input())\nls = [str(a) * b, str(b) * a]\nls.sort()\nprint(ls[0])', 'a,b = map(int,input().split())\nls = [str(a) * b, str(b) * a]\nls.sort()\nprint(ls[0])'] | ['Runtime Error', 'Accepted'] | ['s497134194', 's233418739'] | [9040.0, 9164.0] | [26.0, 30.0] | [71, 83] |
p02790 | u700929101 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['c = input().split(" ")\na = int(c[0])\nb = int(c[1])\n\na_column = []\nif a <= b:\n for i in range(b):\n a_column.append(a)\n print(a_column)\n\nb_column = []\nif b < a:\n for i in range(a):\n b_column.append(b)\n print(b_column)', 'c = input().split(" ")\na = int(c[0])\nb = int(c[1])\n\na_ans = 0\nif a <= b:\n for i in range(b):\n a_ans += a * (10 ** i)\n print(a_ans)\n\nb_ans = 0\nif b < a:\n for i in range(a):\n b_ans += b * (10 ** i)\n print(b_ans)'] | ['Wrong Answer', 'Accepted'] | ['s361958744', 's443694994'] | [3060.0, 3064.0] | [20.0, 17.0] | [241, 235] |
p02790 | u702208001 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = input().split()\nprint(a * int(b) if a * int(b) > b * int(a) else b * int(a))\n', 'a, b = input().split()\nprint(a * int(b) if a * int(b) < b * int(a) else b * int(a))\n'] | ['Wrong Answer', 'Accepted'] | ['s617371602', 's660766593'] | [2940.0, 2940.0] | [17.0, 17.0] | [84, 84] |
p02790 | u706330549 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\n\np = ""\nq = ""\n\nfor i in range(b):\n p = p + str(a)\n\nfor i in range(a):\n q += str(b)\n\nlst = [p, q]\n\nsorted(lst)\nprint(lst[0])\n', 'a, b = map(int, input().split())\n\np = ""\nq = ""\n\nfor i in range(b):\n p = p + str(a)\n\nfor i in range(a):\n q += str(b)\n\nlist = [p, q]\n\nsorted(list)\nprint(list[0])', 'a, b = map(int, input().split())\n\np = ""\nq = ""\n\nfor i in range(b):\n p = p + str(a)\n\nfor i in range(a):\n q += str(b)\n\nlst = [p, q]\n\nlst = sorted(lst)\n\nprint(lst[0])\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s594086730', 's704684429', 's667358908'] | [2940.0, 3060.0, 3060.0] | [24.0, 17.0, 17.0] | [164, 166, 171] |
p02790 | u709686535 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['s_list = list(map(int, input().split()))\nfinal_list = [(int(str(s_list[0]) * s_list[1]))]\nfinal_list.append(int(str(s_list[1]) * s_list[0]))\nfinal_list.sort()\nprint(final_list[0])\n', 's_list = list(map(int, input().split()))\n\nfinal_list = [(str(s_list[0]) * s_list[1])]\nfinal_list.append(str(s_list[1]) * s_list[0])\nfinal_list.sort()\nprint(final_list[0])\n'] | ['Wrong Answer', 'Accepted'] | ['s218682082', 's542621677'] | [2940.0, 2940.0] | [19.0, 17.0] | [180, 171] |
p02790 | u709799578 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["a, b = map(int, input().split())\n\nX = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nY = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(b):\n X[i] = str(a)\nfor j in range(a):\n Y[j] = str(b)\nprint(X)\nprint(Y)\nfor k in range(9):\n if int(X[k]) < int(Y[k]):\n ｎX = [e for e in X if e != 0]\n print(''.join(nX))\n break\n elif int(X[k]) > int(Y[k]):\n ｎY = [e for e in Y if e != 0]\n print(''.join(nY))\n break\n else:\n if k == 8:\n ｎX = [e for e in X if e != 0]\n print(''.join(nX))", "a, b = map(int, input().split())\n\nX = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\nY = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(b):\n X[i] = str(a)\nfor j in range(a):\n Y[j] = str(b)\n\nfor k in range(9):\n if int(X[k]) < int(Y[k]):\n ｎX = [e for e in X if e != 0]\n print(''.join(nX))\n break\n elif int(X[k]) > int(Y[k]):\n ｎY = [e for e in Y if e != 0]\n print(''.join(nY))\n break\n else:\n if k == 8:\n ｎX = [e for e in X if e != 0]\n print(''.join(nX))"] | ['Wrong Answer', 'Accepted'] | ['s116410500', 's234679049'] | [3064.0, 3064.0] | [17.0, 17.0] | [543, 526] |
p02790 | u712253494 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['n, m = (input().split())\nm=int(m)\nif 1 <= int(n) <=9 and 1<=int(m)<=9:\n print(n*m)', 'n, m = (input().split())\nn=int(n)\nm=int(m)\nif n>m:\n m=str(m)\n print(m*n)\nelse:\n n=str(n)\n print(n*m)'] | ['Wrong Answer', 'Accepted'] | ['s403546150', 's919877614'] | [2940.0, 2940.0] | [18.0, 17.0] | [85, 112] |
p02790 | u724563664 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ["#coding:utf-8\n\nn = int(input())\nnums = map(int, input().split(' '))\n\nif a >= b:\n print(''.join([str(b)] * a))\nelse:\n print(''.join([str(a)] * b))", "#coding:utf-8\n\na, b = map(int, input().split(' '))\n\n\nprint(''.join([str(min(a, b))] * max(a, b)))"] | ['Runtime Error', 'Accepted'] | ['s948211732', 's741804960'] | [2940.0, 2940.0] | [17.0, 17.0] | [151, 97] |
p02790 | u729133443 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['_,a,b=sorted(input())[1:];print(a*int(b))', '_,a,b=sorted(input());print(a*int(b))'] | ['Runtime Error', 'Accepted'] | ['s500606993', 's954955187'] | [2940.0, 2940.0] | [18.0, 17.0] | [41, 37] |
p02790 | u731362892 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=input().split()\nw=[a*int(b),b*int(a)]\nsorted(w)\nprint(w[0])', 'a,b= map(int,input().split())\nx=str(a)*b\ny=str(b)*a\nprint(min(x,y))'] | ['Wrong Answer', 'Accepted'] | ['s495776546', 's773883464'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 67] |
p02790 | u744115306 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int,input().split())\nif a >= b:\n a = str(a)a\n print(a*b)\nelse:\n b = str(b)\n print(b*a)', 'a, b = map(int,input().split())\nif b >= a:\n a = str(a)\n print(a*b)\nelse:\n b = str(b)\n print(b*a)'] | ['Runtime Error', 'Accepted'] | ['s013721571', 's113285916'] | [2940.0, 2940.0] | [17.0, 18.0] | [101, 100] |
p02790 | u745687363 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nif a >= b:\n print(b*((10**a -1)/9))\nelse:\n print(a*((10**b -1)/9))\n ', 'a, b = input().split()\nA = a*int(b)\nB = b*int(a)\nprint(min(A, B))'] | ['Wrong Answer', 'Accepted'] | ['s535515989', 's656697462'] | [2940.0, 2940.0] | [17.0, 17.0] | [104, 65] |
p02790 | u746849814 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = input().split()\nx, y = int(a*int(b)), int(b*int(a))\nif x >= y:\n print(y)\nelse:\n print(x)', 'a, b = input().split()\nx, y = a*int(b), b*int(a)\nL = len(y) if len(x) >= len(y) else len(x)\nfor l in range(L):\n if int(x[l]) > int(y[l]):\n print(y)\n break\n elif int(x[l]) < int(y[l]):\n print(x)\n break\nelse:\n if len(x) >= len(y):\n print(y)\n else:\n print(x)'] | ['Wrong Answer', 'Accepted'] | ['s837641373', 's612454507'] | [2940.0, 3064.0] | [17.0, 16.0] | [97, 309] |
p02790 | u747703115 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\na_ = int(str(a)*b)\nb_ = int(str(b)*a)\nif len(str(a_)) > len(str(b_)):\n print(b_)\nelif len(str(a_)) == len(str(b_)):\n print(min(a_, b_))\nelse:\n print(a_)', 'import sys\n\na, b = map(int, input().split())\na_ = int(str(a)*b)\nb_ = int(str(b)*a)\nla = len(str(a_))\nlb = len(str(b_))\nif a_ == b_:\n print(a_)\n sys.exit()\nfor i in range(min(la, lb)):\n ai = str(a_)[i]\n bi = str(b_)[i]\n if ai > bi:\n print(b_)\n sys.exit()\n elif ai < bi:\n print(a_)\n sys.exit()'] | ['Wrong Answer', 'Accepted'] | ['s491705075', 's966172123'] | [3060.0, 3064.0] | [17.0, 17.0] | [194, 337] |
p02790 | u752522099 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b = input().split()\nA = a * int(b)\nB = b * int(a)\n\nlis=[A,B]\ntrue_list = lis.sort(reverse=True)\nprint(true_list[0])', 'a,b = input().split()\nA = int(a * int(b))\nB = int(b * int(a))\n\nlis=[A,B]\ntrue_list = lis.sort()\nprint(str(true_list[0]))', 'a,b = input().split()\nA = a * int(b)\nB = b * int(a)\n\nlis=[A,B]\ntrue_list = lis.sort()\nprint(true_list[0])', 'a,b = input().split()\nA = int(a * int(b))\nB = int(b * int(a))\n\nif A >= B:\n print(str(A))\nelse:\n print(str(B))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s464296096', 's542355730', 's621630674', 's094494551'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [117, 120, 105, 115] |
p02790 | u756919993 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['u = input()\n\na = u[0];\nb = u[2];\nat = int(a)\nbt = int(b)\n\nx = at*b\ny = bt*a\n\nif(x < y)\n{\n print(x)\n}\nelse\n{\n print(y)\n}', 'u = input()\n\na = u[0];\nb = u[2];\nat = int(a)\nbt = int(b)\n\nx = b*at\ny = a*bt\n\nif x <= y:\n print(x)\n\nelse:\n print(y)\n'] | ['Runtime Error', 'Accepted'] | ['s585025557', 's385394396'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 116] |
p02790 | u757420987 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nif a >= b:\n print(str(a) * b)\nelse:\n print(str(b) * a)', 'a, b = map(int, input().split())\nif a >= b:\n print(str(b) * a)\nelse:\n print(str(a) * b)'] | ['Wrong Answer', 'Accepted'] | ['s599018140', 's631607436'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 93] |
p02790 | u766349820 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = list(map(int, input().split()))\n\nab = str(str(a) * b)\nba = str(str(b) * a)\n\nprint(sorted([ab, ba]))\nprint(sorted([ab, ba])[0])\n', 'a, b = list(map(int, input().split()))\n\nab = str(str(a) * b)\nba = str(str(b) * a)\n\nprint(sorted([ab, ba])[0])\n'] | ['Wrong Answer', 'Accepted'] | ['s007410131', 's610123931'] | [2940.0, 2940.0] | [18.0, 17.0] | [134, 110] |
p02790 | u768256617 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\na_=a*b\nb_=b*a\ns=[a_,b_]\ns.sort()\nprint(s[0])', 'a,b=map(int,input().split())\na_=str(a)*b\nb_=str(b)*a\ns=[a_,b_]\ns.sort()\nprint(s[0])'] | ['Wrong Answer', 'Accepted'] | ['s676795857', 's841496890'] | [2940.0, 2940.0] | [16.0, 17.0] | [73, 83] |
p02790 | u771538568 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,input().split())\nif a==b:\n n=str(a)\n for i in range(a-1):\n n+str(a)\n print(n)\nelse:\n if a>b:\n n=str(b)\n for i in range(a-1):\n n+str(b)\n print(n)\n else:\n n=str(a)\n for i in range(b-1):\n n+str(a)\n print(n)\n \n\n', 'a,b=map(int,input().split())\nif a==b:\n n=str(a)\n for i in range(a-1):\n n+=str(a)\n print(n)\nelse:\n if a>b:\n n=str(b)\n for i in range(a-1):\n n+=str(b)\n print(n)\n else:\n n=str(a)\n for i in range(b-1):\n n+=str(a)\n print(n)\n \n\n'] | ['Wrong Answer', 'Accepted'] | ['s592897218', 's947967482'] | [3060.0, 3060.0] | [17.0, 17.0] | [312, 315] |
p02790 | u774985302 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int,input().split())\nA = list(str(a)*b,) B = list(str(b)*a)\nC = max(len(A),len(B))\nfor i in range(C)\n if A[i] > B[i]:\n \u3000\u3000\u3000\u3000print(str(B))\n break\n elif B[i] > A[i]:\n print(str(A))\n break\n ', 'a, b = map(int,input().split())\nA = list(str(a)*b,) B = list(str(b)*a)\nC = max(len(A),len(B))\nfor i in range(C)\n if A[i] > B[i]:\n \u3000\u3000\u3000\u3000print(str(B))\n break\n elif B[i] > A[i]:\n print(str(A))\n break', 'a, b = map(int,input().split())\nA = list(str(a)*b,), B = list(str(b)*a)\nC = max(len(A),len(B))\nfor i in range(C)\n if A[i] > B[i]:\n \u3000\u3000\u3000\u3000print(str(B))\n break\n elif B[i] > A[i]:\n print(str(A))\n break', 'a,b = map(int,input().split())\nC = min(a,b)\nD = max(a,b)\nprint(str(C)*D)'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s150925810', 's317465785', 's475128760', 's165877561'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 16.0, 17.0] | [233, 230, 231, 72] |
p02790 | u777394984 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a,b=map(int,ipnut().split())\nprint(str(min(int(a),int(b)))*max(int(a),int(b)))', 'a,b=map(int,input().split())\nprint(str(min(a,b))*max(a,b))\n'] | ['Runtime Error', 'Accepted'] | ['s890033168', 's954708350'] | [2940.0, 2940.0] | [17.0, 17.0] | [78, 59] |
p02790 | u779073299 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a, b = map(int, input().split())\nc = max(a, b)\nd = min(a, b)\nans = str(c)*d\nprint(ans)', 'a, b = map(int, input().split())\nc = max(a, b)\nd = min(a, b)\nans = str(d)*c\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s497256211', 's485541937'] | [2940.0, 2940.0] | [17.0, 17.0] | [86, 86] |
p02790 | u780698286 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['a = sorted(input().split())\nprint(a[0] * a[1]', 'a, b = map(int, input().split())\nprint(str(min(a, b)) * max(a, b))'] | ['Runtime Error', 'Accepted'] | ['s478282791', 's228864294'] | [2940.0, 9156.0] | [17.0, 25.0] | [45, 66] |
p02790 | u782138812 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['A,B = list(map(int,input().split()))\npara_a = str(B)\npara_b = str(A)\n\nfor i in range(A-1):\n para_a = para_a + str(B)\n\nfor i in range(B-1):\n para_b = para_b + str(A)\n\nN = [para_a,para_b]\nprint(N)\nsorted(N)\n\nprint(N[0])\n', 'A,B = list(map(int,input().split()))\npara_a = str(B)\npara_b = str(A)\n\nfor i in range(A-1):\n para_a = para_a + str(B)\n\nfor i in range(B-1):\n para_b = para_b + str(A)\n\nN = [para_a,para_b]\nprint(N)\nsorted(N)\n\nprint(N[0])\n', 'A,B = list(map(int,input().split()))\npara_a = str(B)\npara_b = str(A)\n\nfor i in range(A-1):\n para_a = para_a + str(B)\n\nfor i in range(B-1):\n para_b = para_b + str(A)\n\nif para_a < para_b:\n print(para_a)\nelse:\n print(para_b)\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s608998517', 's897536623', 's583246096'] | [3060.0, 3060.0, 2940.0] | [18.0, 18.0, 17.0] | [224, 224, 234] |
p02790 | u783676040 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['A,B=map(int,input().split())\nif B < A:\n A,B=B,A\nfor i in range B;\n print(A, end="")\nprint()', 'A,B=map(int,input().split())\nif B < A:\n A,B=B,A\nfor i in range(B):\n print(A, end="")\nprint()'] | ['Runtime Error', 'Accepted'] | ['s143853306', 's287771870'] | [8848.0, 9136.0] | [19.0, 24.0] | [92, 93] |
p02790 | u790970437 | 2,000 | 1,048,576 | Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller? | ['Input = input().split()\nInput[0] = int(Input[0])\nInput[1] + int(Input[1])\n\nif Input[0] >= Input[1]:\n print(str(Input[1])*Input[0])\n\nelse:\n print(str(Input[0])*Input[1])', 'Input = input().spilit()\nInput[0] = int(Input[0])\nInput[1] = int(Input[1])\n\ni = 0\n\nif Input[0] > Input[1]:\n print(str(Input[0])*Input[1])\n\nelif Input[1] > Input[0]:\n print(str(Input[1])*Input[0])\n\nelse:\n print(str(Input[0])*Input[0])\n \n ', 'Input = input().split()\nInput[0] = int(Input[0])\nInput[1] = int(Input[1])\n \nif Input[0] >= Input[1]:\n print(str(Input[1])*Input[0])\n \nelse:\n print(str(Input[0])*Input[1])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s185784780', 's702414577', 's337962724'] | [3060.0, 3060.0, 3060.0] | [19.0, 17.0, 17.0] | [170, 242, 173] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.