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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02939 | u983181637 | 2,000 | 1,048,576 | Given is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition: * There exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \neq S_{i+1} (1 \leq i \leq K-1). Here S_1S_2...S_K represents the concatenation of S_1,S_2,.... | ['# A - Dividing a String\nimport sys\ninput = sys.stdin.readline\n\nS = input()\nans, prev, cur = 0, "", ""\nfor s in S:\n cur += s \n if cur != prev: \n ans += 1\n prev, cur = cur, ""\nprint(ans)', '# A - Dividing a String\nimport sys\ninput = sys.stdin.readline\n\nS = input()\nans, prev, cur = 0,... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s920077449', 's948533850', 's687108956'] | [3316.0, 3316.0, 3500.0] | [74.0, 76.0, 73.0] | [265, 254, 261] |
p02939 | u987164499 | 2,000 | 1,048,576 | Given is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition: * There exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \neq S_{i+1} (1 \leq i \leq K-1). Here S_1S_2...S_K represents the concatenation of S_1,S_2,.... | ['from sys import stdin\n\ns = stdin.readline().rstrip()\nN = len(s)\n\nif N == 1:\n print(1)\n exit()\nelif N == 2:\n if s[0] == s[1]:\n print(1)\n exit()\n else:\n print(2)\n exit()\n\ndp = [0]*N\nif s[0] == s[1]:\n dp[0] = 0\n dp[1] = 1\nelse:\n dp[0] = 1\n dp[1] =... | ['Wrong Answer', 'Accepted'] | ['s142434316', 's459026576'] | [11240.0, 11240.0] | [103.0, 97.0] | [426, 262] |
p02940 | u016128476 | 2,000 | 1,048,576 | We have 3N colored balls with IDs from 1 to 3N. A string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is `R`, green if S_i is `G`, and blue if S_i is `B`. There are N red balls, N green balls, and N blue balls. Takahashi will distribute these 3N balls to N people so that each pe... | ["from operator import mul\nfrom functools import reduce\n\nN = int(input())\nS = input()\nMOD = 998244353\n\n# make A, B, C oredesr\nr, g, b = 0, 0, 0\nT = {'R': 0, 'G': 0, 'B': 0}\nABC = ''\nfor s in S:\n T[s] += 1\n ge = [t >= T[s] for t in T.values()].count(True)\n lt = [t < T[s] for t in T.values()].count... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s711850483', 's716337841', 's304441569'] | [4456.0, 4560.0, 8352.0] | [605.0, 2104.0, 655.0] | [873, 851, 817] |
p02940 | u218843509 | 2,000 | 1,048,576 | We have 3N colored balls with IDs from 1 to 3N. A string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is `R`, green if S_i is `G`, and blue if S_i is `B`. There are N red balls, N green balls, and N blue balls. Takahashi will distribute these 3N balls to N people so that each pe... | ['n = int(input())\ns = input()\nmod = 998244353\nans = 1\nz, o, t = n, 0, 0\nO, T = "", ""\nfor i in range(3*n):\n if s[i] == O or O == "":\n o += 1\n ans *= z\n ans %= mod\n z -= 1\n O = s[i]\n elif s[i] == T or T == "":\n t += 1\n ans *= o\n ans %= mod\n o -= 1\n T = s[i]\n if o ==... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s041046464', 's401736004', 's497167512', 's671743127', 's096234454'] | [3828.0, 3188.0, 3828.0, 3828.0, 3784.0] | [210.0, 19.0, 206.0, 18.0, 245.0] | [407, 460, 412, 419, 458] |
p02940 | u671861352 | 2,000 | 1,048,576 | We have 3N colored balls with IDs from 1 to 3N. A string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is `R`, green if S_i is `G`, and blue if S_i is `B`. There are N red balls, N green balls, and N blue balls. Takahashi will distribute these 3N balls to N people so that each pe... | ['from bisect import bisect_left as bl\nfrom math import factorial\n\nN = int(input())\nS = input()\nmod = 998244353\n \nR, G, B = [], [], []\nfor i, s in enumerate(S):\n if s == "R":\n R.append(i)\n elif s == "G":\n G.append(i)\n else:\n B.append(i)\n\na = [None] * N\nb, c = a[:], a[:]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s532344420', 's960202593', 's328985419'] | [18708.0, 3064.0, 18708.0] | [487.0, 2290.0, 505.0] | [506, 565, 508] |
p02941 | u347640436 | 2,000 | 1,048,576 | There are N positive integers arranged in a circle. Now, the i-th number is A_i. Takahashi wants the i-th number to be B_i. For this objective, he will repeatedly perform the following operation: * Choose an integer i such that 1 \leq i \leq N. * Let a, b, c be the (i-1)-th, i-th, and (i+1)-th numbers, respective... | ['def main():\n import sys\n from heapq import heappush, heappop, heapify\n _int = int\n n = _int(input())\n a = [_int(e) for e in input().split()]\n b = [_int(e) for e in input().split()]\n result = 0\n finished = 0\n hq = [(-b[i], i) for i in range(n)]\n heapify(hq)\n while True:\n _, i = heappop(hq)\n ... | ['Runtime Error', 'Time Limit Exceeded', 'Time Limit Exceeded', 'Wrong Answer', 'Accepted'] | ['s064244523', 's576005681', 's587046953', 's749328128', 's626863567'] | [47444.0, 45132.0, 43468.0, 47444.0, 33752.0] | [204.0, 2106.0, 2106.0, 214.0, 1562.0] | [764, 708, 677, 793, 796] |
p02945 | u006883624 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = [ = [int(v) for v in input().split()]\n\nd = a+b\ne = a-b\nf = a*b\nprint(max(max(d,e),f))\n', 'a,b = [ = [int(v) for v in input().split(" ")]\n\nd = a+b\ne = a-b\nf = a*b\nprint(max(max(d,e),f))\n', "A, B = [int(v) for v in input().split(' ')]\n\nprint(max([A + B, A - B, A * B]))"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s310543460', 's400575559', 's338468793'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [92, 95, 78] |
p02945 | u007698380 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int,input().split();print(max(a+b,a-b,a*b)))', 'a,b=map(int,input().split());print(max(a+b,a*b,a-b))'] | ['Runtime Error', 'Accepted'] | ['s484484578', 's219070379'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 52] |
p02945 | u008357982 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ["k,x=map(int,input().split())\nfor i in range(x-~-k,x+k):\n print(i,end=' ')", 'a,b=map(int,input().split());print(max(a+b,a-b,a*b))'] | ['Wrong Answer', 'Accepted'] | ['s974194710', 's111417833'] | [3060.0, 2940.0] | [17.0, 17.0] | [76, 52] |
p02945 | u015647294 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['n = map(int, input().split())\nprint(max(sum(n), n(0)-n(1), n(0)*n(1)))', 'n = list(int(i) for i in input().split())\nprint(max(sum(n), n[0]-n[1], n[0]*n[1]))'] | ['Runtime Error', 'Accepted'] | ['s457667521', 's427522679'] | [2940.0, 2940.0] | [17.0, 17.0] | [70, 82] |
p02945 | u015993380 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int,input().split())\nprint(max([a+b,a*b,a-b])', 'a,b = map(int,input().split())\nprint(max(a+b,a*b,a-b))'] | ['Runtime Error', 'Accepted'] | ['s891381704', 's484604693'] | [3064.0, 2940.0] | [17.0, 18.0] | [55, 54] |
p02945 | u017624958 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A = int(input())\nB = input()\n\nanswer = max(\n A + B,\n A - B,\n A * B,\n)\n\nprint(answer)\n', "data = input()\ndata = data.split(' ')\n\nA = int(data[0])\nB = int(data[1])\n\nanswer = max(\n A + B,\n A - B,\n A * B,\n)\n\nprint(answer)\n"] | ['Runtime Error', 'Accepted'] | ['s283924824', 's629159375'] | [3064.0, 2940.0] | [19.0, 17.0] | [94, 138] |
p02945 | u018679195 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['if B<=0:\n if A+B<=A*B:\n print(A*B);\n else:\n print(A+B);\nelse:\n if A-B<=A*B:\n print(A*B);\n else:\n print(A-B);', 'A,B=[int(x) for x in input().split(" ")]\nif B<=0:\n if A+B<=A*B:\n print(A*B)\n else:\n print(A+B)\nelse:\n if A-B<=A*B:\n pri... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s563052695', 's594461706', 's000715961'] | [2940.0, 2940.0, 3064.0] | [17.0, 17.0, 17.0] | [148, 185, 184] |
p02945 | u027076164 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = map(int,input().split())\nprint(max(A+B,A-B,A*B)', 'A,B = map(int,input().split())\nprint(max(A+B,A-B,A*B))'] | ['Runtime Error', 'Accepted'] | ['s279641862', 's394735986'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 54] |
p02945 | u028014940 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['\na,b=map(int,input().spllit())\nprint(max(a+b,a-b,a*b))', '\na,b=map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Runtime Error', 'Accepted'] | ['s579218166', 's333878204'] | [2940.0, 2940.0] | [17.0, 17.0] | [54, 53] |
p02945 | u028042029 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['IN = input()\nIN = "40 50"\nA, B = [int(x) for x in IN.split()]\nC = max(A+B, A-B, A*B)\nprint(C)', 'IN = input()\nA, B = [int(x) for x in IN.split()]\nC = max(A+B, A-B, A*B)\nprint(C)'] | ['Wrong Answer', 'Accepted'] | ['s725762408', 's562741422'] | [2940.0, 2940.0] | [17.0, 17.0] | [93, 80] |
p02945 | u034400188 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['data = list(map(int,input().sprit()))\nadd = data[0] + data[1]\nsub = data[0] - data[1]\nmul = data[0] * data[1]\nresult = [add,sub,mul]\nans = add\nif sub > ans:\n ans = sub\nif mul > ans:\n ans = mul\nreturn ans', 'data = list(map(int,input().split()))\nadd = data[0] + data[1]\nsub = data[0] - data[1]\nmul = data... | ['Runtime Error', 'Accepted'] | ['s603139657', 's169374746'] | [3064.0, 3060.0] | [17.0, 17.0] | [205, 206] |
p02945 | u036531287 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = input().strip().split()\nk = max([a+b,a-b,a*b])\nprint(k)\n', 'a, b = input().strip().split()\nprint(max([a+b,a-b,a*b]))', 'a, b = input().strip().split()\nprint(max[a+b,a-b,a*b])', 'a, b = input().strip().split()\nprint(max(a+b,a-b,a*b))', 'a, b = input().strip().split()\na, b = [int(a), int(b)]\nprint(max([a... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s005954473', 's340525484', 's533003189', 's548908392', 's092063771'] | [2940.0, 2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 17.0, 20.0] | [63, 56, 54, 54, 81] |
p02945 | u038132197 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['str = input().split()\nplus = str[0] + str[1]\nminus = str[0] - str[1]\nmul = str[0] * str[1]\nif(plus > minus):\n if(plus > mul):\n max = plus\n else:\n max = mul\nif(minus > plus):\n if(minus > mul):\n max = minus\n else:\n max = mul\nif(plus > minus):\n if(plus > mul):\n max = plus\n else:\n ... | ['Runtime Error', 'Accepted'] | ['s372751447', 's600747989'] | [3064.0, 3060.0] | [18.0, 17.0] | [311, 143] |
p02945 | u038819082 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B=input().split()\nmax(A*B,A+B,A-B)\n', 'A,B=map(int,input().split())\nm=max(A+B,A-B,A*B)\nprint(m)'] | ['Runtime Error', 'Accepted'] | ['s473382057', 's156166152'] | [2940.0, 2940.0] | [18.0, 18.0] | [37, 56] |
p02945 | u039189422 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import collections\nn=int(input())\ns=collections.Counter(["".join(sorted(input())) for _ in range(n)])\nv=list(s.values())\nres=0\nfor u in v:\n\tif u!=1:\n\t\tres += u*(u-1)//2\nprint(res)', 'a, b = map(int,input().split())\nprint(max[a+b,a-b,a*b])', 'P=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s186897566', 's199335139', 's355275406', 's922541672'] | [3316.0, 2940.0, 3064.0, 2940.0] | [20.0, 17.0, 17.0, 17.0] | [179, 55, 269, 52] |
p02945 | u042241263 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['s = input()\nl = [int(x) for x in input().split()]\na, b = l[0], l[1]\nprint(max(a+b, max(a-b, a*b)))', 's = input()\nl = [int(x) for x in s.split()]\na, b = l[0], l[1]\nprint(max(a+b, max(a-b, a*b)))'] | ['Runtime Error', 'Accepted'] | ['s862026367', 's258402071'] | [9068.0, 8880.0] | [27.0, 26.0] | [98, 92] |
p02945 | u046440893 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['# your code goes here\na, b = int(input().split())\nc1 = a+b\nc2 = a-b\nc3 = a*b\nif c1>c2 and c1>c3:\n\tprint(c1)\nelif c2>c3:\n\tprint(c2)\nelse:\n\tprint(c3)', '# your code goes here\na, b = map(int,input().split())\nc1 = a+b\nc2 = a-b\nc3 = a*b\nif c1>c2 and c1>c3:\n\tprint(c1)\nelif c2>c3:\n\tprint(c2)\nelse:\n\... | ['Runtime Error', 'Accepted'] | ['s988696492', 's599098691'] | [3060.0, 3060.0] | [17.0, 17.0] | [147, 151] |
p02945 | u048139195 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import numpy as np\na = int(input())\nb = int(input())\nadd = a+b\nminus = a-b\ncross = a*b\nlis = np.array([add, minus, cross])\nprint(np.max(lis))', 'a = int(input())\nb = int(input())\nadd = a+b\nminus = a-b\ncross = a*b\nlis = [add, minus, cross]\nprint(max(lis))', 'a,b=int(input().split())\nad = a+b\nminus = a-b... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s444830734', 's785545313', 's887227741', 's916066856', 's032488619'] | [12380.0, 3060.0, 2940.0, 3060.0, 3060.0] | [150.0, 17.0, 17.0, 17.0, 17.0] | [141, 109, 98, 107, 115] |
p02945 | u048214692 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int, input().split())\n\nn_list = []\nc = a + b\nd = a - c\ne = a * b\n\nn_list.append(c)\nn_list.append(d)\nn_list.append(e)\n\nsorted_list = sorted(n_list)\n\nif sorted_list[2] > sorted_list[1]:\n print(sorted_list[2])\nelif sorted_list[2] == sorted[1] & sorted_list[1] > sorted_list[0]:\n print(sorted... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s111468968', 's797286865', 's822491406', 's577512313'] | [3064.0, 3064.0, 2940.0, 2940.0] | [17.0, 17.0, 19.0, 17.0] | [391, 29, 145, 145] |
p02945 | u054825571 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['n = int(input())\nsl = []\nfor _ in range(n):\n sl.append(input())\nrl=[]\nll=[]\nrslt=0\nfor i in range(n):\n r=sorted(sl[i])\n if r in rl: ll[rl.index(r)]+=1; rslt+=ll[rl.index(r)]\n else: rl.append(r); ll.append(0)\nprint(rslt)\n', 'a,b = map(int, input().split())\nr=[a+b, a-b, a*b]\nprint(max(r))\n'] | ['Runtime Error', 'Accepted'] | ['s068146133', 's537547145'] | [3060.0, 2940.0] | [17.0, 18.0] | [232, 64] |
p02945 | u064264248 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['# -*- coding: utf-8 -*-\n\nrow = input().split()\nk = int(row[0])\nx = int(row[1])\n\nblacklist = list(range(x-k+1, x+k))\nprint(" ".join(map(str, blacklist)))', 'row = input().split()\na = int(row[0])\nb = int(row[1])\n\nprint(max(a+b, a-b, a*b))'] | ['Wrong Answer', 'Accepted'] | ['s187365538', 's005675939'] | [2940.0, 2940.0] | [17.0, 17.0] | [152, 80] |
p02945 | u067899663 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['k,x=[int(k) for k in input().split(" ")]\n\nprint(" ".join([str(_) for _ in range(max(-1000000,x-k+1),min(1000000,x+k-1))]))\n', 'a,b=[int(k) for k in input().split(" ")]\nprint(max(a+b,a-b,a*b))\n'] | ['Wrong Answer', 'Accepted'] | ['s347748826', 's353734738'] | [2940.0, 2940.0] | [18.0, 17.0] | [123, 65] |
p02945 | u074140654 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int, input().split())\nx = a + b\ny = a - b\nz = a * b\ni[1] = x\ni[2] = y\ni[3] = z\ni.sort\nprint(i[2])', 'a,b = map(int, input().split())\nx = a + b\ny = a - b\nz = a * b\ni = []\ni.append(x)\ni.append(y)\ni.append(z)\ni.sort()\nprint(i[-1])'] | ['Runtime Error', 'Accepted'] | ['s128819312', 's560027802'] | [3060.0, 3060.0] | [17.0, 17.0] | [107, 126] |
p02945 | u075303794 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = input().split()\nA,B = int(A),int(B)\nans = [A+B,A-B,A*B]\nsort(ans)\nprint(ans.pop())\n', 'a,b = map(int, input().split())\nans = [a+b, a-b, a*b]\nprint(max(ans))'] | ['Runtime Error', 'Accepted'] | ['s876153175', 's568536729'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 69] |
p02945 | u080367782 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b =map(int(), input().split())\n\nc= a+b\nd= a-b\ne= a*b\nmax = [c,d,e]\nprint(max)', 'a,b =map(int, input().split())\nprint(max[a+b, a-b, a*b])', 'a,b = map(int, input().split())\nc=a+b\nd=a-b\ne=a*b\nprint(max(c, d, e))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s212683886', 's409635088', 's517213366'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 18.0] | [79, 56, 69] |
p02945 | u080608919 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['k,x = map(int,input().split())\n\nfor i in range(x-k+1,x+k):\n if i < x+k-1:\n print(i, end ="")\n else:\n print(i)', 'A,B = (int(x) for x in input().split())\na = A+B\nb = A-B\nc =A*B\nprint(max(a,b,c))'] | ['Wrong Answer', 'Accepted'] | ['s580488152', 's825448474'] | [3060.0, 2940.0] | [17.0, 18.0] | [129, 80] |
p02945 | u082861480 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int, input().split())\nprint(max(a+b,a*b,a-', 'a,b = map(int, input().split())\nprint(max(a+b,a*b,a-b)', 'a,b = map(int, input().split())\nprint(max(a+b,a*b,a-b))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s605754995', 's771592512', 's138467524'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [52, 54, 55] |
p02945 | u087270713 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int,input())\nprint(max(a+b,a-b,a*b))', 'a,b=map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Runtime Error', 'Accepted'] | ['s431734471', 's934401486'] | [2940.0, 2940.0] | [17.0, 17.0] | [44, 52] |
p02945 | u087474779 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = [int(i) for i in input()]\n\nprint(max([a + b, a - b, a * b]))', 'a, b = [int(i) for i in input().split()]\n\nprint(max([a + b, a - b, a * b]))'] | ['Runtime Error', 'Accepted'] | ['s533610734', 's850457943'] | [2940.0, 2940.0] | [17.0, 17.0] | [66, 75] |
p02945 | u088020258 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = map(int,input().split())\ntest1 = A+B\ntest2 = A-B\ntest3 = A*B\nif test1 >= test2 and test1 >= test3:\n print(test1)\n break\nif test2 >= test1 and test2 >= test3:\n print(test2)\n break\nif test3 >= test1 and test3 >= test2:\n print(test3)\n break\n\t', 'A,B = map(int,input().split())\ntest1 = A+B\ntest... | ['Runtime Error', 'Accepted'] | ['s096619183', 's277292167'] | [2940.0, 2940.0] | [17.0, 17.0] | [251, 232] |
p02945 | u089230684 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B=input().split();\nif B<=0:\n if A+B<=A*B:\n print(A*B);\n else:\n print(A+B);\nelse:\n if A-B<=A*B:\n print(A*B);\n else:\n print(A-B);', 'a, b = map(int, input().split())\n\nprint(max(a+b, a-b, a*b))'] | ['Runtime Error', 'Accepted'] | ['s898936893', 's936075720'] | [2940.0, 8888.0] | [19.0, 30.0] | [169, 59] |
p02945 | u092382030 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['def intersect_list(lst1, lst2):\n arr = []\n lst = lst1.copy()\n for element in lst2:\n try:\n lst.remove(element)\n except ValueError:\n pass\n else:\n arr.append(element)\n return len(arr)\n\nn=int(input())\na=[input() for i in range(n)]\na=list(map(... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s075129740', 's156102687', 's202704705', 's789029379', 's872171151', 's950992333', 's247302456'] | [3064.0, 3060.0, 3064.0, 3060.0, 3060.0, 3064.0, 12416.0] | [17.0, 17.0, 20.0, 18.0, 17.0, 17.0, 149.0] | [476, 222, 251, 227, 196, 470, 78] |
p02945 | u096025032 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = map(int,input().split())\n\np = A+B\nm = A-B\nM = A*B\n\nL = []\n\nL.append(p)\nL.append(m)\nL.append(M)\n\nprint(max(M))', 'A,B = map(int,input().split())\n\np = A+B\nm = A-B\nM = A*B\n\nL = []\n\nL.append(p)\nL.append(m)\nL.append(M)\n\nprint(max(L))\n'] | ['Runtime Error', 'Accepted'] | ['s669946258', 's802978026'] | [9072.0, 9104.0] | [23.0, 28.0] | [115, 116] |
p02945 | u097121858 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\nprint(a + b, a - b, a * b)\n', 'a, b = map(int, input().split())\nprint(max(a + b, a - b, a * b))\n'] | ['Wrong Answer', 'Accepted'] | ['s604542914', 's723455512'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 65] |
p02945 | u098588273 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B=int(input()),int(input())\nprint(max[A+B,A-B,A*B])', 'A,B=list(map(int,input().split()))\nprint(max(A+B,A-B,A*B))'] | ['Runtime Error', 'Accepted'] | ['s888076239', 's990721816'] | [2940.0, 2940.0] | [17.0, 17.0] | [53, 58] |
p02945 | u100800700 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A = int(input())\nB = int(input())\nprint(max(A+B, A-B, A*B))', 'A,B=map(int,input().split());print(max(A+B,A-B,A*B))'] | ['Runtime Error', 'Accepted'] | ['s623030255', 's665662422'] | [2940.0, 2940.0] | [17.0, 17.0] | [59, 52] |
p02945 | u106284621 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\nt = a * b\nh = a - b\nk = a * b\nl = [t, h, k]\nprint(max(l))', 'a, b = map(int, input().split())\nt = a + b\nh = a - b\nk = a * b\nl = [t, h, k]\nprint(max(l))'] | ['Wrong Answer', 'Accepted'] | ['s854280095', 's907206898'] | [3064.0, 2940.0] | [18.0, 17.0] | [90, 90] |
p02945 | u107269063 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ["import collections\nimport math\n \nN = int(input())\nwords = [input() for i in range(N)] \n \nans = 0\nL = []\nfor ix, word in enumerate(words):\n word_list = list(word)\n word_list.sort()\n L.append(''.join(map(str, word_list)))\n \nc = collections.Counter(L)\n \nfor i in c.values(): \n ans += facto... | ['Runtime Error', 'Accepted'] | ['s250845516', 's584328526'] | [3316.0, 2940.0] | [21.0, 18.0] | [761, 79] |
p02945 | u107269931 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a = list(map(int,input().split()))\n\nx = a[0] + a[1]\ny = a[0] - a[1]\nz = a[0] * a[1]\n\naaa = sorted([x,y,z], reverse)\nprint(aaa[0])\n\n', 'A,B = map(int, input().split()\n\nx = max([A + B, A - B, A * B])\n\nprint(x)\n\n', "a = int(input().split())\n\nx = a[0] + a[1]\ny = a[0] - a[1]\nz = a[0] * a[1]\n\nif x > y ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s057443259', 's597268497', 's684302676', 's760303935', 's878273206', 's683661450'] | [2940.0, 2940.0, 3060.0, 3060.0, 2940.0, 2940.0] | [18.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [131, 74, 167, 176, 130, 75] |
p02945 | u108573380 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ["A, B = [int(i) for i input().split(' ')]\nprint(max((A + B), (A - B), (A * B)))", "A, B = [int(i) for i in input().split(' ')]\nprint(max((A + B), (A - B), (A * B)))\n"] | ['Runtime Error', 'Accepted'] | ['s359727607', 's069203581'] | [2940.0, 3188.0] | [17.0, 19.0] | [78, 82] |
p02945 | u111254734 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['k,x=map(int, input().split())\no_min=max(x-(k-1), -1000000)\no_max=min(x+(k-1), 1000000)\no=str(o_min)\nfor i in range(o_min+1, o_max+1, 1):\n o+=" {}".format(i)\nprint(o)', 'k,x=map(int, input().split())\no=str(x-(k-1))\nfor i in range(x-(k-1)+1, x+(k-1)+1, 1):\n o+=" {}".format(i)\nprint(o)', 'a,b=map(int, i... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s585462403', 's661820216', 's371177746'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [169, 117, 82] |
p02945 | u114366889 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = map(int,input().split())\n\ntarget = list()\n\ntarget.append(A+B)\ntarget.append(A-B)\ntarget.append(A*B)\n\nprint(map(target))\n', 'A,B = map(int,input().split())\n\ntarget = list()\n\ntarget.append(A+B)\ntarget.append(A-B)\ntarget.append(A*B)\n\nprint(max(target))\n'] | ['Runtime Error', 'Accepted'] | ['s322156198', 's108829531'] | [2940.0, 2940.0] | [17.0, 17.0] | [126, 126] |
p02945 | u115520109 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['K, X = map(int, input().split())\nl = list(range(X + 1 - K, X + K))\nprint(" ".join(map(str, l)))', 'def calc(a,b):\n return [a+b, a-b, a*b]\n\ns = list(map(int, input().split()))\nres = calc(s[0], s[1])\nprint(max(res))'] | ['Wrong Answer', 'Accepted'] | ['s229584575', 's237387284'] | [2940.0, 2940.0] | [17.0, 17.0] | [95, 115] |
p02945 | u115877451 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int,input().split())\nn=[a+b,a*b,a-b]\nprint(n)\nn.sort()\nprint(n[-1])', 'a,b=map(int,input().split())\nn=[a+b,a*b,a-b]\nn.sorted()\nprint(n[-1])', 'a,b=map(int,input().split())\nn=[a+b,a*b,a-b]\nn.sort()\nprint(n[-1])'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s424148249', 's797485320', 's729720179'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [75, 68, 66] |
p02945 | u116233709 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A, B = map(int, input().split())\na=A*B\nb=A-B\nc=A*B\nif a>=b and a>=c:\n print(a)\nelif b>=a and b>=c:\n print(b)\nelse:\n print(c)', 'K, X=map(int,input().split())\nfor x in range(X-K+1,X+K):\n print(x)\n', 'A, B = map(int, input().split())\na=A+B\nb=A-B\nc=A*B\nif a>=b and a>=c:\n print(a)\nelif b>=a and b>=... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s658774784', 's767386514', 's328635921'] | [3060.0, 3060.0, 2940.0] | [17.0, 17.0, 17.0] | [127, 68, 128] |
p02945 | u117541450 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ["A,B=[int(e) for r in input().split(' ')]\nprint(max([A+B,A-B,A*B]))", "A,B=[int(e) for e in input().split(' ')]\nprint(max([A+B,A-B,A*B]))\n"] | ['Runtime Error', 'Accepted'] | ['s923835564', 's069003839'] | [2940.0, 2940.0] | [19.0, 17.0] | [66, 67] |
p02945 | u119655368 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a= int(input())\nb= int(input())\nc = a+b\nd = a-b\ne = a*b\nprint(max(c,d,e))', 'a= int(input())\nb= int(input())\nprint(max(a+b,a-b,a*b))', 'a, b = map(int, input().split())\nprint(max(a+b, a-b, a*b))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s408917867', 's905093658', 's043799001'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [73, 55, 58] |
p02945 | u119947188 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = list(map(int,input().split()))\nans=[0]*3\na[0]=A+B\na[1]=A-B\na[2]=A*B\nprint(max(a))', 'A,B = list(map(int,input().split()))\na=[0]*3\na[0]=A+B\na[1]=A-B\na[2]=A*B\nprint(max(a))'] | ['Runtime Error', 'Accepted'] | ['s011182282', 's050112670'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 85] |
p02945 | u121192442 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import numpy as np\na,b = map(int,input().split())\nc = np.max([a-b,b-a,a*b])\nprint("{}".format(c))', 'import numpy as np\na,b = map(int,input().split())\nc = np.max([a-b,a+b,a*b])\nprint("{}".format(c))'] | ['Wrong Answer', 'Accepted'] | ['s333888742', 's580940592'] | [12416.0, 12392.0] | [152.0, 161.0] | [97, 97] |
p02945 | u123461552 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B=map(int,input().split())\nlist_plumi=[A+B,A-B,A*B]\nlist_plumi.sort()\nlist_plumi[2]', 'A,B=map(int,input().split())\nx_list=[A+B,A-B,A*B]\nx_list.sort()\nx_list[2]', 'A,B=map(int,input().split())\nlist_plumi=[A+B,A-B,A*B]\nlist_plumi.sort()\nlist_plumi[2]', 'A,B=map(int,input().split())\nx_list=[A+B,A-B,A*B]\nx_... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s012015660', 's141010286', 's870457572', 's398840386'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [85, 73, 85, 80] |
p02945 | u124187388 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import numpy as np\n\nN = int(input())\ns = []\nfor i in range (N):\n word = input()\n word_lst = []\n for j in range (len(word)):\n word_lst.append(word[j])\n word_lst = np.sort(word_lst)\n words = ""\n for j in range (len(word_lst)):\n words += word_lst[j]\n s.append(words)\n#prin... | ['Runtime Error', 'Accepted'] | ['s205547696', 's336400920'] | [12420.0, 12500.0] | [148.0, 150.0] | [478, 105] |
p02945 | u126183307 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['x=input().split()\n\na=x[0]\nb=x[1]\n\np=a + b\nq=a - b\nr=a * b\n\nmax=p\nif q > max:\n max = q\n if r > max:\n max = r\n\nprint(max)', 'int = list(map(int,input().split()))\n\na=int[0]\nb=int[1]\n\nx=a+b\ny=a-b\nz=a*b\n\nmax=x\nif y > max:\n max=y\nif z > max:\n max=z\nprint(max)'] | ['Runtime Error', 'Accepted'] | ['s038281947', 's827744100'] | [3060.0, 3060.0] | [17.0, 18.0] | [132, 136] |
p02945 | u126232616 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int,input().split())\nprint(max(a+b.a-b,a*b))', 'a,b = map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Runtime Error', 'Accepted'] | ['s514307142', 's643658271'] | [2940.0, 3316.0] | [17.0, 21.0] | [54, 54] |
p02945 | u131406572 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import numpy as np\na,b=map(int,input())\ns=np.max([a+b,a-b,a*b])\nprint(s)', 'a,b=map(int,input.split())\ns=max([a+b,a-b,a*b])\nprint(s)', 'a,b=map(int,input().split())\n#s=[]\nfor i in range(b-a+1,b+a):\n print(i,end=" ")', 'import numpy as np\na,b=map(int,input().split())\ns=np.max([a+b,a-b,a*b])\nprint(s)'] | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s279781586', 's355966350', 's812837223', 's623690962'] | [13296.0, 3064.0, 3060.0, 12428.0] | [148.0, 17.0, 18.0, 149.0] | [72, 56, 82, 80] |
p02945 | u135197221 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['def Input():\n return mapt(int, input().split(" "))\n\n \ndef main():\n a, b = Input()\n return max(a*b, a-b, a+b)\n\n\nprint(main())', 'def Input():\n return map(int, input().split(" "))\n\ndef main():\n a, b = Input()\n return max(a*b, a-b, a+b)\n\n\nprint(main())'] | ['Runtime Error', 'Accepted'] | ['s263781982', 's420315969'] | [9012.0, 9124.0] | [24.0, 30.0] | [134, 130] |
p02945 | u138781768 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['n = int(input())\na = []\nd = 0\ne = 0\nfor i in range(n):\n s = sorted(list(input()))\n a.append(s)\na.sort()\nf = []\nfor b in a:\n if b in f:\n d += 1\n f.append(b)\nprint(d)', 'a, b = map(int, input().split())\nc = a + b\nd = a - b\ne = a * b\nif c >= d:\n if c >= e:\n print(c)\n e... | ['Runtime Error', 'Accepted'] | ['s107270412', 's383240583'] | [3060.0, 2940.0] | [17.0, 17.0] | [183, 182] |
p02945 | u143903328 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int,input().split())\nc = A + B\nif c < A - B:\n\tc = A - B\nif c < A * B:\n\tc = A * B:\nprint(c)', 'a, b = map(int,input().split())\nc = A + B\nif c < A - B:\n c = A - B\nif c < A * B:\n c = A * B:\nprint(c)', 'a, b = map(int,input().split())\nc = A + B\nif c < A - B:\n\tc = A - B\nif c < A * B:\n\t... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s315573083', 's477102960', 's637753921', 's908083085'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [102, 104, 101, 102] |
p02945 | u148423304 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\nx = a + b\ny = a * b\nz = a - b\nif x >= b and x >= z:\n print(x)\nelif y >= z:\n print(y)\nelse:\n print(z)', 'a, b = map(int, input().split())\nx = a + b\ny = a * b\nz = a - b\nif x >= y and x >= z:\n print(x)\nelif y >= z:\n print(y)\nelse:\n print(z)\n'] | ['Wrong Answer', 'Accepted'] | ['s436807830', 's740948517'] | [3060.0, 2940.0] | [17.0, 17.0] | [142, 143] |
p02945 | u149091611 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a = int(input())\nb = int(input())\nadd = a + b\nsub = a - b\nmul = a * b\ncallist = [add, sub, mul]\nprint(max(callist))', 'a, b = map(int, input().split())\nadd = a + b\nsub = a - b\nmul = a * b\ncallist = [add, sub, mul]\nprint(max(callist))'] | ['Runtime Error', 'Accepted'] | ['s020778024', 's747046560'] | [3060.0, 2940.0] | [17.0, 17.0] | [115, 114] |
p02945 | u151107315 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import itertools\n\nn = int(input())\ns_li = []\nfor i in range(n):\n s = input()\n s_i = {}\n for j in range(10):\n s_i[s[j]] = 0\n for j in range(10):\n s_i[s[j]] += 1 \n s_li.append(s_i)\n\nans = 0\n\nfor i in range(n):\n for j in range(n):\n if i >= j :\n conti... | ['Runtime Error', 'Accepted'] | ['s683466839', 's243588551'] | [3064.0, 3316.0] | [17.0, 21.0] | [366, 64] |
p02945 | u160861278 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\n\nm = a+b\nif m<a*b:\n m = a*b:\nif m<a-b:\n m=a-b\nprint(m)', 'a, b = map(int, input().split())\n \nm = a+b\nif m<a*b:\n m = a*b\nif m<a-b:\n m=a-b\nprint(m)'] | ['Runtime Error', 'Accepted'] | ['s693166355', 's863274054'] | [2940.0, 2940.0] | [17.0, 17.0] | [89, 93] |
p02945 | u165101727 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['max((a+b),(a-b),(a*b))', 'a=input()\nb=input()\n\ncmax = max((a+b),(a-b),(a*b))\nprint(cmax)', 'a,b = map(int,input().split())\ncmax = max((a+b),(a*b),(a-b))\nprint(cmax)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s110813838', 's476549798', 's766856007'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 19.0] | [22, 62, 72] |
p02945 | u166727624 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a = [int(i) for i in input().split()] \n\nreturn np.array([a[0]+a[1],a[0]^a[1],a[0]*a[1]]).max()\n\n', 'import numpy as np\na = [int(i) for i in input().split()] \n\nprint(np.array([a[0]+a[1],a[0]-a[1],a[0]*a[1]]).max())\n\n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s718500884', 's477849302'] | [2940.0, 21696.0] | [17.0, 309.0] | [96, 118] |
p02945 | u169696482 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\ns = a + b\nt = a - b\nu = a * b\nx = [s, t, u].sort()\nprint(x[-1])', 'a, b = map(int, input().split())\ns = a + b\nt = a - b\nu = a * b\nx = [s, t, u].sort()\nprint(x[-1])', 'a, b = map(int, input().split())\ns = a + b\nt = a - b\nu = a * b\nx = sorted([s, t, u])\nprint(x[-1])'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s352632410', 's613651455', 's148249038'] | [2940.0, 2940.0, 3060.0] | [18.0, 18.0, 17.0] | [96, 96, 97] |
p02945 | u175590965 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int,input().split())\nprint(a+b,a-b,a*b)', 'a,b = map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Wrong Answer', 'Accepted'] | ['s870404628', 's605478165'] | [2940.0, 2940.0] | [17.0, 18.0] | [49, 54] |
p02945 | u177067177 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['k, x = map(int, input().split())\nfor i in range(2*k-1):\n b = abs(x-k+i)\n if b <= 1000000:\n print(x-k+i)\n ', 'a, b = map(int, input().split())\narray = [a+b, a-b, a*b]\nprint(max(array))'] | ['Wrong Answer', 'Accepted'] | ['s665830436', 's624221453'] | [3060.0, 2940.0] | [18.0, 18.0] | [121, 74] |
p02945 | u183200783 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A, B = map(int, input().strip())\n\nprint(max(A+B,A-B,A*B))', 'A, B = map(int, input().split())\n\nprint(max(A+B,A-B,A*B))\n'] | ['Runtime Error', 'Accepted'] | ['s514414577', 's607531515'] | [2940.0, 2940.0] | [17.0, 17.0] | [57, 58] |
p02945 | u184109787 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['from itertools import combinations\n\nN = int(input())\ns = [sorted(input(i)) for i in range(N)]\n\nc = len([i for i in combinations(s, 2) if i[0] == i[1]])\nprint(c)\n', 'A, B = [int(i) for i in input().split()]\n\nprint(max(A+B, A-B, A*B))\n'] | ['Runtime Error', 'Accepted'] | ['s572355286', 's901541872'] | [3060.0, 2940.0] | [17.0, 19.0] | [161, 68] |
p02945 | u184339976 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B = =map(int,input().split())\nx = A+B\ny = A-B\nz = A*B\nprint( max(x,y,z) )\n', 'A,B = map(int,input().split())\nx = A+B\ny = A-B\nz = A*B\nprint( max(x,y,z) )'] | ['Runtime Error', 'Accepted'] | ['s239593421', 's584829182'] | [2940.0, 2940.0] | [17.0, 17.0] | [76, 74] |
p02945 | u185806788 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A,B=map(int,input().split)\nprint(max([A+B,A-B,A*B]))', 'A,B=map(int,input().split)\nx=[A+B,A-B,A*B]\nprint(max(x))', 'A,B=map(int,input().split())\nx=[A+B,A-B,A*B]\nprint(max(x))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s064051228', 's406466070', 's700913028'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [52, 56, 58] |
p02945 | u188721034 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=input().split\nprint(max(a+b,a-b,a*b))', 'a,b = map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Runtime Error', 'Accepted'] | ['s702289514', 's945741268'] | [2940.0, 2940.0] | [19.0, 17.0] | [41, 54] |
p02945 | u196669204 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a = input()\nb = input()\n\nseki = a * b\nsa = a - b\nwa = a + b\n\nif wa >= seki and wa >= sa:\n print(wa)\nelif sa >= wa and sa >= seki:\n print(sa)\nelse:\n print(seki)\n ', "a = input('')\nb = input('')\n\nseki = int(a) * int(b)\nsa = int(a) - int(b)\nwa = int(a) + int(b)\n\nif wa >= seki and wa >= s... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s490497489', 's501994508', 's768733043', 's935252081', 's989854046', 's962111622'] | [2940.0, 3060.0, 3060.0, 3060.0, 2940.0, 3060.0] | [18.0, 18.0, 18.0, 17.0, 17.0, 17.0] | [174, 203, 199, 214, 203, 198] |
p02945 | u197768447 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = input().strip().split()\na, b = [int(a), int(b)]\n\ndef main(a, b):\n s = a + b\n d = a - b\n p = a * b\n num_list = [s, d, p]\n return print(max(num_list))', "import sys\n\ndef main():\n input = sys.stdin.readline\n A, P = map(int, input().split())\n s = A + P\n d = A - P\n f = A * P\n ... | ['Wrong Answer', 'Accepted'] | ['s089930612', 's008146443'] | [2940.0, 3060.0] | [18.0, 17.0] | [160, 234] |
p02945 | u198035503 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\nprint(max(a + b, a - b, a * b)', 'a, b = map(int, input().split())\nprint(max(a + b, a - b, a * b))'] | ['Runtime Error', 'Accepted'] | ['s363302100', 's417128278'] | [2940.0, 2940.0] | [17.0, 17.0] | [63, 64] |
p02945 | u198905553 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import numpy as np\n\nA, B = map(int, input().split())\n\nprint(np.max(A-B, A+B, A*B)', 'A, B = map(int, input().split())\n\nprint(max(A-B, A+B, A*B))'] | ['Runtime Error', 'Accepted'] | ['s069862825', 's695608579'] | [2940.0, 2940.0] | [17.0, 17.0] | [81, 59] |
p02945 | u201660334 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\nprint(max(a + b, a - b. a * b))', 'a, b = map(int, input().split())\nprint(max(a + b, a - b, a * b))\n'] | ['Runtime Error', 'Accepted'] | ['s117166496', 's808290589'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 65] |
p02945 | u205087376 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int,input().split())\nx = int(a+b)\ny = int(a-b)\nz = int(a*b)\nl = []\nl = l.append(x,y,z)\nprint(max(l))', 'a,b = map(int,input().split())\nx = int(a+b)\ny = int(a-b)\nz = int(a*b)\n\nl = []\nl.append(int(x))\nl.append(int(y))\nl.append(int(z))\nprint(max(l))\n'] | ['Runtime Error', 'Accepted'] | ['s824248616', 's792670888'] | [3060.0, 3060.0] | [17.0, 17.0] | [110, 143] |
p02945 | u210221529 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = input().split()\nmax(a + b, a - b, a * b)', 'a, b = [int(x) for x in input().split()]\nmax(a + b, a - b, a * b)', 'a, b = input(), input()\nmax(a + b, a - b, a * b)', 'a, b = [int(x) for x in input().split()]\nprint(max(a + b, a - b, a * b))'] | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s006583647', 's251405743', 's316145052', 's364043365'] | [2940.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0] | [47, 65, 48, 72] |
p02945 | u210755881 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = map(int, input().split())\nprint(max[a+b, a-b, a*b])', 'a, b = map(int, input().split())\ncalcu = [a+b, a-b, a*b]\nprint(max(calcu))'] | ['Runtime Error', 'Accepted'] | ['s572851719', 's997365000'] | [2940.0, 2940.0] | [17.0, 17.0] | [58, 74] |
p02945 | u213868052 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a, b = input().split()\n\nprint(a)\nprint(b)\n', "N = int(input())\nstrings = []\nfor i in range(N):\n strings.append(str(input()))\n\n\nstrings = [''.join(sorted(s)) for s in strings]\nstrings.sort()\n\nfor s in strings:\n print(s)\n\n\nhashMap = {}\nfor string in strings:\n if string not in hashMap:\n ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s225045489', 's870627047', 's926357119', 's810963891'] | [2940.0, 3064.0, 3064.0, 3060.0] | [17.0, 18.0, 17.0, 19.0] | [42, 418, 414, 316] |
p02945 | u215315599 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b = map(int,input().split())\nmax(a+b,a-b,a*b)', 'a,b = map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Wrong Answer', 'Accepted'] | ['s928166265', 's767862276'] | [2940.0, 2940.0] | [17.0, 18.0] | [47, 54] |
p02945 | u220064149 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int,input().split())\nc=[a+b,a-b,a*b]\nc.sort()\nprint(c[3])', 'k,x=map(int,input().split())\nlist=[]\nfor i in range(-k,k):\n list.append(x+i)\nfor i in range(1,2*k):\n print(list[i])', 'a,b=map(int,input().split())\nc=[a+b,a-b,a*b]\nc.sort()\nprint(c[2])\n'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s210409982', 's500050473', 's952556684'] | [2940.0, 3060.0, 2940.0] | [18.0, 17.0, 18.0] | [65, 117, 66] |
p02945 | u221505564 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import time\n\ntime.sleep(3)\na, b = map(int, input().split())\nprint(max(a + b, a - b, a * b))', 'import time\n \ntime.sleep(0.5)\na, b = map(int, input().split())\nprint(max(a + b, a - b, a * b))'] | ['Time Limit Exceeded', 'Accepted'] | ['s192018218', 's573537576'] | [2940.0, 3056.0] | [2104.0, 518.0] | [91, 94] |
p02945 | u223504018 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import math\na,b,c=map(int,input().split())\nprint(max(a+b,a-b,a*b))', 'import math\na,b=map(int,input().split())\nprint(max(a+b,a-b,a*b))\n'] | ['Runtime Error', 'Accepted'] | ['s964844411', 's767181468'] | [2940.0, 2940.0] | [17.0, 18.0] | [66, 65] |
p02945 | u223555291 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int,input().split())\n\nc=a+ba\nd=a-b\ne=a*b\nf=[c,d,e]\nprint(max(f))\n \n', 'a,b=map(int,input().split())\n\nc=a+b\nd=a-b\ne=a*b\nf=[c,d,e]\nprint(max(f))\n \n'] | ['Runtime Error', 'Accepted'] | ['s885343467', 's858517567'] | [3064.0, 2940.0] | [17.0, 17.0] | [76, 75] |
p02945 | u224825657 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['lis_raw=[int(i) for i in input().split()]\nprint(max(lis[0]+lis[1], lis[0]-lis[1], lis[0]*lis[1]))', 'lis_raw=input().split()\nlis = [int(i) for i in lis]\nprint(max(lis[0]+lis[1], lis[0]-lis[1], lis[0]*lis[1]))', 'a, b=map(int, input().split())\nprint(max(a + b, a - b, a*b))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s552587342', 's668895933', 's689288605'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [97, 107, 60] |
p02945 | u225388820 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['import heapq\nn,m=map(int, input().split())\ns = [list(map(int, input().split())) for i in range(n)]\nq = []\nans=0\n\nfor k in range(m-1,-1,-1):\n while True:\n if s!=[]:\n \n p=heapq.heappop(s)\n if p[0]+k<=m:\n \n heapq.heappush(q,-p[1])\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s026616929', 's790411494', 's840171071', 's990780594', 's793115801'] | [3064.0, 3064.0, 3444.0, 3064.0, 3064.0] | [18.0, 18.0, 27.0, 18.0, 18.0] | [655, 630, 691, 613, 53] |
p02945 | u226912938 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A, B = int(input().split())\n\ns = A + B\nd = A - B\nm = A * B\n\nprint(max(s, d, m))', 'A, B = map(int, input().split())\n\ns = A + B\nd = A - B\nm = A * B\n\nprint(max(s, d, m))'] | ['Runtime Error', 'Accepted'] | ['s190613341', 's205316373'] | [2940.0, 2940.0] | [17.0, 17.0] | [79, 84] |
p02945 | u227429529 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a = int(input())\nb = int(input())\n\nprint(max(a+b,a-b,a*b))', 'a = int(input())\nb = int(input())\n\nprint(max(a+b,a-b,a*b))', 'a,b = map(int,input().split())\n\nprint(max(a+b,a-b,a*b))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s426642024', 's449026606', 's792586851'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 17.0] | [58, 58, 55] |
p02945 | u229518917 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['K,X=map(int,input().split())\nk=[]\nfor i in range ((X-K+1),(X+K),1):\n print(i,end=" ")', 'a,b = map(int,input().split())\nprint(max(a+b,a-b,a*b))'] | ['Wrong Answer', 'Accepted'] | ['s434471853', 's972706970'] | [3060.0, 2940.0] | [18.0, 18.0] | [88, 54] |
p02945 | u232462528 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a,b=map(int,input().split()):print(min(a+b,a-b,a*b))', 'a,b=map(int,input().split());print(max(a+b,a-b,a*b))\n'] | ['Runtime Error', 'Accepted'] | ['s473863857', 's416297992'] | [2940.0, 2940.0] | [17.0, 17.0] | [52, 53] |
p02945 | u239756332 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a , b = map(int , input().split())\n\ndef fun(a,b):\n adds = a+b\n subs = a-b\n muls = a*b\n\n if adds > subs:\n if adds > muls:\n return adds\n else:\n return muls\n else:\n if subs > muls:\n return subs\n else:\n return muls\n\n#... | ['Wrong Answer', 'Accepted'] | ['s235702114', 's394010824'] | [2940.0, 3060.0] | [19.0, 18.0] | [321, 332] |
p02945 | u241159583 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['a = int(input())\nb = int(input())\n\nlist = [a + b, a - b, a * b]\n\nif a > 0:\n if b > 0:\n print(list[2])\n else:\n print(list[1])\n\nelse:\n if b > 0:\n print(list[0])\n else:\n print(list[2])', 'a,b = map(int, input().split())\nprint(max(a+b, a-b, a*b))'] | ['Runtime Error', 'Accepted'] | ['s198897292', 's025655979'] | [3060.0, 8996.0] | [17.0, 27.0] | [197, 57] |
p02945 | u241190159 | 2,000 | 1,048,576 | We have two integers: A and B. Print the largest number among A + B, A - B, and A \times B. | ['A, B = map(int, input())\n\nprint(max(max(A+B, A - B), A * B))', 'A, B = map(int, input().split())\n\nprint(max(max(A+B, A - B), A * B))\n'] | ['Runtime Error', 'Accepted'] | ['s262776721', 's652419774'] | [2940.0, 2940.0] | [17.0, 17.0] | [60, 69] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.