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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02946 | u739843002 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, X = list(map(lambda n: int(n), input().split(" ")))\nprint(" ".join(list(range(K - X + 1, K + X - 1))))', 'K, X = list(map(lambda n: int(n), input().split(" ")))\nprint(" ".join(list(map(lambda s: str(s), list(range(X - K + 1, X + K))))))'] | ['Runtime Error', 'Accepted'] | ['s710718236', 's186303482'] | [9068.0, 8956.0] | [26.0, 26.0] | [105, 130] |
p02946 | u740047492 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["1 K, X = map(int, input().split())\n2 print(' '.join(map(str, range(X - K + 1, X + K))))", "K, X = map(int, input().split())\nprint(' '.join(map(str, range(X - K + 1, X + K))))\n"] | ['Runtime Error', 'Accepted'] | ['s556370752', 's813916165'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 84] |
p02946 | u740767776 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['n, x = map(int,input().split())\na = []\nif n - 1 == 0:\n print(x)\nelse:\n for i in range(2 * n -1):\n \ta.append(i - n + 1)\n print(*a)', 'k, x = map(int,input().split())\na = []\nif k - 1 == 0:\n print(x)\nelse:\n for i in range(0,2 * k - 1):\n \ta.append(x - k + 1 + i)\n print(*a)'] | ['Wrong Answer', 'Accepted'] | ['s811527320', 's905569879'] | [3060.0, 3060.0] | [18.0, 18.0] | [133, 140] |
p02946 | u746849814 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k = int(input())\nx = int(input())\n\nprint(*list(range(x-k+1, x)) + list(range(x, x+k)))', 'k, x = map(int, input().split())\n\nprint(*list(range(x-k+1, x)) + list(range(x, x+k)))'] | ['Runtime Error', 'Accepted'] | ['s550326406', 's145508593'] | [2940.0, 3060.0] | [17.0, 17.0] | [86, 85] |
p02946 | u751843916 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['a,b=map(int,input().split())\nl=[]\nfor x in range(a):\n l.append(b-x)\n l.append(b+x)\nl.remove(b)\nprint(sorted(l))', 'a,b=map(int,input().split())\nl=[]\nfor x in range(a):\n l.append(b-x)\n l.append(b+x)\nl.remove(b)\nprint(" ".join(map(str,sorted(l))))'] | ['Wrong Answer', 'Accepted'] | ['s608501799', 's579507912'] | [2940.0, 2940.0] | [17.0, 17.0] | [117, 136] |
p02946 | u752522099 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int,input().split())\n\nlis = [x]\nx_1 = x\nx_2 = x\n\nfor i in range(k-1):\n x_1 += 1\n x_2 -= 1\n lis.append(x_1)\n lis.append(x_2)\nnew_list = sorted(lis)\n\nprint(" ".join(new_list))', 'k,x = map(int,input().split())\n\nlis = [x]\n\nfor i in range(1,k):\n lis.append(x-1)\n lis.append(x... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s353046793', 's512053068', 's618663857', 's672734658', 's936707567', 's018400912'] | [3060.0, 3060.0, 2940.0, 3060.0, 3064.0, 2940.0] | [17.0, 17.0, 18.0, 17.0, 18.0, 17.0] | [195, 153, 162, 144, 183, 117] |
p02946 | u755313517 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=map(int,input().split())\ns=[0]*((2*(k-1))+1)\nfor i in range((2*(k-1))+1):\n s[i]=x-(k-1)+i\n \nprint(s)', 'k,x=map(int,input().split())\ns=[0]*((2*(k-1))+1)\nfor i in range((2*(k-1))+1):\n s[i]=x-(k-1)+i\n \nprint(" ".join(map(str,s)))'] | ['Wrong Answer', 'Accepted'] | ['s973696979', 's012683460'] | [2940.0, 2940.0] | [17.0, 17.0] | [106, 129] |
p02946 | u756518089 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['lines = input().split(" ")\nK = int(lines[0])\nX = int(lines[1])\narr = []\n \nif K == 1:\n print(X)\nelse:\n for i in range(X , X + K):\n arr.append(i)\n \n for j in range(X - K + 1 , X):\n arr.append(j)\n \narr.sort()\nprint(arr)', 'lines = input().split(" ")\nK = int(lines[0])\nX = int(lines[1])\nar... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s061257699', 's903578472', 's235799955'] | [3064.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [231, 240, 290] |
p02946 | u756693875 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k,x = map( int,input().split())\na = x-(k-1)\nb = x+(k+1)\nc = []\n\nfor i in range(a,b+1):\n if -1000000 <= i <= 1000000:\n c.append(i)\n\nprint(' '.join(map(str, c)))", "k,x = map(int,input().split())\na = x-(k-1)\nb = x+(k-1)\nc = []\n\nfor i in range(a,b+1):\n if -1000000 <= i <= 1000000:\n c.... | ['Wrong Answer', 'Accepted'] | ['s604530565', 's730931488'] | [3060.0, 3060.0] | [17.0, 17.0] | [169, 168] |
p02946 | u757117214 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int, input().split())\nlst=[]\nfor i in list(range(x-(k-1),x+(k-1))):\n lst.append(str(i))\nprint(" ".join(lst)) ', 'k,x = map(int, input().split())\nlst = list(range(x-(k-1),x+(k-1)))\nfor i in lst:\n print(i,end=" ")', 'k,x = map(int, input().split())\nprint(" ".join([str(i) for i in range(x-(k-1),x+k)... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s244229924', 's763132184', 's226414695'] | [3060.0, 3060.0, 3316.0] | [17.0, 17.0, 21.0] | [121, 99, 85] |
p02946 | u757274384 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int, input().split())\n\na = min(-1000000,x - (k-1))\nb = max(1000000,x+(k-1))\n\nL = [str(i) for i in range(a,b+1)]\nprint(" ".join(L))\n', 'k,x = map(int, input())\n\na = min(-1000000,x - (k-1))\nb = max(1000000,x+(k-1))\n\nL = [i for i in range(a,b+1)]\nprint(" ".join(L))', 'k,x = map(int, input().split(... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s227101642', 's300201453', 's884286685', 's692625261'] | [173080.0, 3060.0, 82200.0, 3060.0] | [639.0, 17.0, 141.0, 17.0] | [141, 127, 136, 94] |
p02946 | u761087127 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, X = [int(n) for n in input().split()]\nprint(" ".join([n for n in range(X-(K-1), X+(K-1)]))', 'K, X = [int(n) for n in input().split()]\nprint(" ".join([n for n in range(X-(K-1), X+(K-1))]))', 'K, X = [int(n) for n in input().split()]\nprint(" ".join([str(n) for n in range(X-(K-1), X+(K))]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s330451844', 's641974934', 's228031617'] | [2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0] | [93, 94, 97] |
p02946 | u761105230 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | [" K, X = map(int, input().split())\n for i in range(X - K + 1, X + K):\n if i < X + K - 1:\n print(i, end=' ')\n else:\n print(i)\n", "K, X = map(int, input().split())\nfor i in range(X - K + 1, X + K):\nif i < X + K - 1:\nprint(i, end=' ')\nelse:\nprint(i)\n", "K, X = map(int, input().split())\nfor i in range(X - K +... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s047558324', 's410808833', 's273514876'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [124, 118, 129] |
p02946 | u766349820 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, N = map(int, input().split())\nL = [v for v in range(N - K, N, 1)]\nR = [v for v in range(N, N+K, 1)]\nL.extend(R)\nprint(sorted(L))\n', 'K, N = map(int, input().split())\nL = [v for v in range(N - K, N, 1)]\nR = [v for v in range(N, N+K, 1)]\nL.extend(R)\nset(L)\nprint(sorted(list(L)))\n', 'K, N = map(int, input(... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s067630270', 's212140836', 's405386134'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [132, 145, 185] |
p02946 | u771167374 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k, x = map(int, input().split())\na = x-k+1\nb = x+k-1\nprint(i for i in range(a, b+1))', "k, x = map(int, input().split())\na = x-k+1\nb = x+k-1\nprint(' '.join(list(map(str, range(a, b+1)))))"] | ['Wrong Answer', 'Accepted'] | ['s828078100', 's530597960'] | [9136.0, 9164.0] | [20.0, 22.0] | [84, 99] |
p02946 | u772311880 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | [" K, X = map(int, input().split(' '))\n print(*(range((X + 1) - K, (X + K))))", '# B - One Clue\ndef main():\n K, X = map(int, input().split(\' \'))\n print(*(range((X + 1) - K, (X + K))))\n\nif __name__ == "__main__":\n main()\n '] | ['Runtime Error', 'Accepted'] | ['s904817239', 's542525867'] | [3064.0, 3060.0] | [17.0, 17.0] | [77, 145] |
p02946 | u773265208 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['import sys\n\nk,x = map(int,input().split())\n\nmin_x = k - x + 1\nif(min_x < -1000000):\n\tmin_x = -1000000\n\nmax_x = k + x - 1\nif(max_x > 1000000):\n\tmax_x = 1000000\n\nfor i in range(min_x,max_x+1):\n\tsys.stdout.write(str(i))\n\tif i != max_x:\n\t\tsys.stdout.write(" ")\n\n', 'k,x = map(int,input().split())\n\... | ['Wrong Answer', 'Accepted'] | ['s805904210', 's422083374'] | [3060.0, 2940.0] | [17.0, 17.0] | [258, 91] |
p02946 | u782138812 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["K, X = map(int,input().split())\nfor i in range(X - K + 1,K + X):\n if i < X + K - 1:\n print(i,end = '')\n else:\n print(i)\n", "K, X = map(int,input().split())\nfor i in range(X - K + 1,K + X):\n if i < X + K - 1:\n print(i,end = ' ')\n else:\n print(i)\n"] | ['Wrong Answer', 'Accepted'] | ['s332884914', 's411931397'] | [3060.0, 3060.0] | [18.0, 18.0] | [140, 141] |
p02946 | u783459736 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, X = map(int, input().split())\n\noutput = []\nfor i in range(X-K+1,X+K):\n output.append(i)\n\nprint(output)\n', 'K, X = map(int, input().split())\n\noutput = []\nfor i in range(X-K+1,X+K-1):\n print(i, end="")\n print(" ", end="")\n\nprint(X+K-1)\n'] | ['Wrong Answer', 'Accepted'] | ['s427679524', 's138246121'] | [2940.0, 3060.0] | [18.0, 17.0] | [109, 133] |
p02946 | u791527495 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int,input().split())\ni = X - K + 1\nlis = []\nwhile i <= n + K - 1:\n lis.append(i)\n i += 1\nprint(lis)', 'K,X = map(int,input().split())\ni = X - K + 1\nlis = []\nwhile i <= X + K - 1:\n lis.append(i)\n i += 1\nprint(lis)', "K,X = map(int,input().split())\ni = X - K + 1\nlis = []\nwhile i <= X + K - ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s374046111', 's898576080', 's311655902'] | [2940.0, 2940.0, 2940.0] | [18.0, 18.0, 17.0] | [111, 111, 133] |
p02946 | u794652722 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int,input().split())\n\nlist = []\n\nfor i in range(X-K+1,X+K):\n list.append(i)\n\nprint(" ".join(map(int,list))\n', 'K,X = map(int,input().split())\n\nlist = []\n\nfor i in range(X-K+1,X+K):\n list.append(i)\n\nprint(" ".join(map(str,list)))\n'] | ['Runtime Error', 'Accepted'] | ['s547343972', 's236026357'] | [2940.0, 2940.0] | [17.0, 17.0] | [120, 121] |
p02946 | u798818115 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['# coding: utf-8\n# Your code here!\nk,x=map(int,input().split())\n\nprint(list(range(x-k+1,x+k)))\n\n', '# coding: utf-8\n# Your code here!\nk,x=map(int,input().split())\n\nprint(*list(range(x-k+1,x+k)))\n\n'] | ['Wrong Answer', 'Accepted'] | ['s565134098', 's022557739'] | [2940.0, 3064.0] | [17.0, 17.0] | [117, 96] |
p02946 | u800058906 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k,x=map(int,input().split())\n\nl=0\nr=0\n\nif x-(k-1)<-1000000:\n l=-1000000\n\nif x-(k-1)>=-1000000:\n l=x-(k-1)\n\nif x+(k-1)>1000000:\n r=1000000\n\nif x+(k-1)<=1000000:\n r=x+(k-1)\n\nprint(l)\nprint(r)\n\nans=list(range(l,r+1))\ns=' '.join([str(n) for n in ans])\nprint(s)", "k,x=map(int,input().split())\n\n... | ['Wrong Answer', 'Accepted'] | ['s755204014', 's542695012'] | [9100.0, 9196.0] | [26.0, 27.0] | [260, 241] |
p02946 | u804358525 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['# -*- coding: utf-8 -*-\n\ndef main():\n nyuuryoku = list(map(int, input().split()))\n k = nyuuryoku[0]\n x = nyuuryoku[1]\n num_list = []\n\n num_list.append(x)\n\n for i in range(k):\n if(x+i < 100000):\n num_list.append(x+i)\n\n for i in range(k):\n if(x-i > -100000):\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s560759829', 's894353811', 's416948692'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [447, 449, 450] |
p02946 | u805552010 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int,input().split())\nprint(list(range(x-k+1,x+k)))\n', 'k,x = map(int,input().split())\nprint(*list(range(x-k+1,x+k)))'] | ['Wrong Answer', 'Accepted'] | ['s369639370', 's408493705'] | [2940.0, 3060.0] | [17.0, 17.0] | [61, 61] |
p02946 | u806976856 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=map(int,input().split())\ns=list(range(x-k+1,x+k))\n\nprint(s)\n', '\nk,x=map(int,input().split())\ns=[str(a)for a in range(x-k+1,x+k)]\ns=" ".join(s)\nprint(s)'] | ['Wrong Answer', 'Accepted'] | ['s549780136', 's054855995'] | [2940.0, 2940.0] | [17.0, 17.0] | [64, 88] |
p02946 | u809819902 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int,input().split())\nres = [i for i in range(x-k+1,x+k)]\nprint(res)', 'k,x = map(int,input().split())\nres = [str(i) for i in range(x-k+1,x+k)]\nprint(" ".join(res))\n'] | ['Wrong Answer', 'Accepted'] | ['s379867724', 's434987744'] | [9156.0, 9148.0] | [29.0, 28.0] | [77, 93] |
p02946 | u813102292 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, X = map(int, input().split())\nl, r = 0, 2000001\nl = max(X - K + 1, l)\nr = min(X + K - 1, r)\nlr = range(l, r)\nprint(*lr)', 'K, X = map(int, input().split())\nl = max(X - K + 1, -1000000)\nr = min(X + K - 1, 1000000)\nlr = range(l, r+1)\nprint(*lr)'] | ['Wrong Answer', 'Accepted'] | ['s411783300', 's337152118'] | [3060.0, 3060.0] | [17.0, 17.0] | [122, 119] |
p02946 | u820052258 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['t = list(map(int, input().split()))\n\n\nminnum = t[1] - t[0] + 1\nlength = t[0]*2 - 1\n\noutput=[]\nfor i in range(length):\n output.append(minnum+i)\n\nprint(output)', 't = list(map(int, input().split()))\n\n\nminnum = t[1] - t[0] + 1\nlength = t[0]*2 - 1\n\noutput=[]\nfor i in range(length):\n output.append(... | ['Wrong Answer', 'Accepted'] | ['s864132325', 's363359954'] | [2940.0, 3060.0] | [17.0, 17.0] | [160, 161] |
p02946 | u823112986 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k, x = list(map(int, input().split()))\nprint(' '.join([i for i in range(x-k+1, x+k)]))", "k, x = list(map(int, input().split()))\nprint(' '.join([str(i) for i in range(x-k+1, x+k)]))\n"] | ['Runtime Error', 'Accepted'] | ['s907126879', 's223038516'] | [2940.0, 2940.0] | [17.0, 17.0] | [86, 92] |
p02946 | u823609854 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["K, X = map(int, input().split(' '))\nprint(' '.join([ for i in range(X - (K + 1), (X + K + 1))]))", "K, X = map(int, input().split(' '))\nprint(' '.join([str(i) for i in range(X - (K - 1), (X + K))]))"] | ['Runtime Error', 'Accepted'] | ['s730137385', 's674400915'] | [2940.0, 2940.0] | [17.0, 17.0] | [96, 98] |
p02946 | u823885866 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["import sys\nimport math\nimport itertools\nimport collections\nimport heapq\nimport re\nimport numpy as np\n\nrr = lambda: sys.stdin.readline().rstrip()\nrs = lambda: sys.stdin.readline().split()\nri = lambda: int(sys.stdin.readline())\nrm = lambda: map(int, sys.stdin.readline().split())\nrl = lambda: list(map(int, s... | ['Runtime Error', 'Accepted'] | ['s759870300', 's509008782'] | [8988.0, 27180.0] | [26.0, 118.0] | [425, 425] |
p02946 | u828261239 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int,input().split())\nli = []\nfor i in range(k):\n if i == 0:\n li.append(x)\n else: \n li.append(x+i)\n li.append(x-i)\nprint(sorted(li))', 'k,x = map(int,input().split())\nli = []\nfor i in range(k):\n if i == 0:\n li.append(x)\n else:\n li.appe... | ['Wrong Answer', 'Accepted'] | ['s159497307', 's684667628'] | [2940.0, 3060.0] | [17.0, 18.0] | [180, 172] |
p02946 | u831752983 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['KX=input().split()\nK,X=int(KX[0]),int(KX[1])\n\nlis = list(range(X-K+1,X+K)\nprint(*lis)', 'n,x=map(int,input().split())\nlis=list(range(x-n+1,x+n))\nprint(*lis)'] | ['Runtime Error', 'Accepted'] | ['s638633376', 's583641633'] | [2940.0, 3060.0] | [17.0, 17.0] | [85, 67] |
p02946 | u834157170 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k, x = map(int, input().split())\n\ntmp = [y for y in range(x-k+1, x+k)]\ny = ' '.join(tmp)\nprint(y)", "k, x = map(int, input().split())\ntmp = [str(y) for y in range(x-k+1, x+k)]\nprint(' '.join(tmp))"] | ['Runtime Error', 'Accepted'] | ['s027387672', 's651312388'] | [2940.0, 2940.0] | [17.0, 17.0] | [97, 95] |
p02946 | u840988663 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int, input().split())\nhajime=X-(K-1)\nowari=X+(K-1)\nif hajime<-1000000:\n hajime=-1000000\nif owari>1000000:\n owari=1000000\n\nkotae=list(range(hajime,owari+1))\n\nprint(kotae)', 'K,X = map(int, input().split())\nhajime=X-(K-1)\nowari=X+(K-1)\nif hajime<-1000000:\n hajime=-1000000\nif owari>1000... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s288881138', 's548491666', 's292943055'] | [3060.0, 3060.0, 3060.0] | [17.0, 17.0, 17.0] | [185, 186, 231] |
p02946 | u842388336 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int,input().split())\nif k==1:\n print(x)\nelse:\n list_ = list(range(max(-1000000,x-(k-1)),min(1000000,x+(k-1))))\n list_=[str(i) for i in list_]\n answer = " ".join(list_)\n print(answer)', 'k,x = map(int,input().split())\nif k==1:\n print(x)\nelse:\n list_ = list(range(max(-1000000,x-(k-1)),min(10... | ['Wrong Answer', 'Accepted'] | ['s907118436', 's797907187'] | [3060.0, 3060.0] | [17.0, 17.0] | [197, 199] |
p02946 | u844123804 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["num = input().split()\na, b = int(num[0]), int(num[1])\ntmp = []\nfor i in range(b-a+1,b+a):\n tmp.append(i)\nprint(' '.join(tmp))", "num = input().split()\na, b = int(num[0]), int(num[1])\ntmp = []\nfor i in range(b-a+1,b+a):\n tmp.append(str(i))\nprint(' '.join(tmp))"] | ['Runtime Error', 'Accepted'] | ['s585344124', 's398610047'] | [3060.0, 2940.0] | [17.0, 18.0] | [126, 131] |
p02946 | u847165882 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['num=input()\nK,X=[int(s) for s in num.split(" ")]\n\nmax=X+(K-1)\nmin=X-(K-1)\n\nlist=[]\nfor i in range(min,max+1,1):\n list.append(i)\n\nprint(list)\n', 'num=input()\nK,X=[int(s) for s in num.split(" ")]\n\nmax=X+(K-1)\nmin=X-(K-1)\n\nlist=[]\nfor i in range(min,max+1,1):\n list.append(i)\n\nans=" ".join(map(... | ['Wrong Answer', 'Accepted'] | ['s784542460', 's293340720'] | [3060.0, 3060.0] | [18.0, 17.0] | [144, 171] |
p02946 | u862569952 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = (int(i) for i in input().split()) \nstart = x-k+1\nend = x+k-1\nprint(start,end="")\nfor i in range(start+1,end):\n print(" "+str(i),end="")\nprint()', 'k,x = (int(i) for i in input().split()) \nstart = x-k+1\nend = x+k-1\nprint(start,end="")\nfor i in range(start+1,end+1):\n print(" "+str(i),end="")\np... | ['Wrong Answer', 'Accepted'] | ['s914671243', 's652009291'] | [3060.0, 3060.0] | [17.0, 17.0] | [153, 155] |
p02946 | u865723786 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['input_num=input().split()\ninput_num=[int(num) for num in input_num]\n\nK=input_num[0]\nX=input_num[1]\n\nmin_cons=-10**6\nmax_cons=10**6\n\nmax_num=X+K-1\nmin_num=X-(K-1)\n\nif min_num<min_cons:\n min_num=min_cons\n\nif max_num>max_cons:\n max_num=max_cons\n\nnum_list=[i for i in range(min_num,max_num+1)]\n\np... | ['Wrong Answer', 'Accepted'] | ['s162286233', 's735878693'] | [3060.0, 3060.0] | [18.0, 17.0] | [382, 381] |
p02946 | u866124363 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, X = map(int, input().split())\nMIN = -1000000\nMAX = 1000000\n\nprint(*list(range(max(MIN, X - K + 1), min(MAX, K + X +1))))\n', 'K, X = map(int, input().split())\nMIN = -1000000\nMAX = 1000000+1\n\nprint(*list(range(max(MIN, X - K + 1), min(MAX, K + X))))\n'] | ['Wrong Answer', 'Accepted'] | ['s573075309', 's731461181'] | [3060.0, 3060.0] | [17.0, 17.0] | [124, 123] |
p02946 | u867604473 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k, x = map(int, input().split())\nLIM = 1000000\nans = [x for x in range(x-k, x+k+1) if x <= LIM and x >= -LIM]\nprint(' '.join(map(str,ans)))", "k, x = map(int, input().split())\nLIM = 1000000\nans = [x for x in range(x-(k-1), x+(k-1)+1) if x <= LIM and x >= -LIM]\nprint(' '.join(map(str,ans)))"] | ['Wrong Answer', 'Accepted'] | ['s277842209', 's398920492'] | [2940.0, 2940.0] | [18.0, 18.0] | [139, 147] |
p02946 | u873134970 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=map(int,input().split())\nt=[i for i in range(x-k+1,x+k-1)]\nprint(" ".join(t))', 'k,x=map(int,input().split())\nt=[str(i) for i in range(x-k+1,x+k)]\nprint(" ".join(t))\n'] | ['Runtime Error', 'Accepted'] | ['s047268567', 's300248395'] | [2940.0, 2940.0] | [20.0, 18.0] | [81, 85] |
p02946 | u876751914 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['def main():\n l = input().split()\n k, x = int(l[0]), int(l[1])\n min_x = x - k + 1\n max_x = k + x - 1\n print(list(range(min_x, max_x+1)))\n \nif __name__=="__main__":\n main()\n', 'def main():\n l = input().split()\n k, x = int(l[0]), int(l[1])\n min_x = x - (k - 1)\n max_x = x + (... | ['Wrong Answer', 'Accepted'] | ['s556926972', 's290629693'] | [2940.0, 3060.0] | [18.0, 17.0] | [192, 253] |
p02946 | u879266613 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int, input().split())\n\ns = ""\nfirst = X - K + 1\nfor i in range(K*2 - 1):\n s += str(first + i)\nprint(s)', 'K,X = map(int, input().split())\n\ns = ""\nfirst = X - K + 1\nfor i in range(K*2 - 1):\n s += " " + str(first + i)\nprint(s[1:])'] | ['Wrong Answer', 'Accepted'] | ['s582451616', 's607327846'] | [2940.0, 2940.0] | [17.0, 17.0] | [115, 125] |
p02946 | u891548080 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["while True:\n L=lambda:list(map(int,input().split()))\n k,x=L()\n if x>=0 and x<=100 and k>=1 and k<=100:\n break\nc =[]\nfor i in range(x-k+1,x+k,1):\n c.append(i)\nc = [str(int) for int in c]\n' '.join(c)", "while True:\n L=lambda:list(map(int,input().split()))\n k,x=L()\n if x>=0 and x<... | ['Wrong Answer', 'Accepted'] | ['s862633039', 's971355787'] | [3060.0, 3064.0] | [17.0, 17.0] | [216, 223] |
p02946 | u896741788 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['ko,x=map(int,input().split())\ns=max(x-ko+1,-1000000)\nwhile True:\n print(s,end==" ")\n s+=1\n if s>min(ko+k-1,1000000):break\n', 'k,x=map(int,input().split())\nfor i in range(k):\n\tprint(x+i-k+1,end="")\nif k != 1:\n\tprint(" ",end="")\n\tfor s in range(k)[1:]:\n\t\tprint(x+s,end="")', 'k,x=map(int,input().spli... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s000195000', 's003688687', 's008029464', 's198244958', 's257936894', 's315068311', 's553212781', 's834348869'] | [2940.0, 3060.0, 2940.0, 2940.0, 2940.0, 2940.0, 2940.0, 3060.0] | [18.0, 19.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0] | [125, 144, 152, 150, 148, 124, 148, 93] |
p02946 | u901447859 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['x,k=map(int,input().split())\nprint(*[i for i in range(x-k+1, x+k)])', 'k,x=map(int,input().split())\nprint(*[i for i in range(x-k+1, x+k)])'] | ['Wrong Answer', 'Accepted'] | ['s812360341', 's707916464'] | [3060.0, 3064.0] | [17.0, 18.0] | [67, 67] |
p02946 | u911562010 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=[int(s) for s in input().split()]\n\nr=[]\nfor i in range(k-1):\n r.append(x-k+i+1)\n\nfor j in range(k):\n r.append(x+j)\n \nprint(r)', 'k,x=[int(s) for s in input().split()]\n\nr=[]\nfor i in range(k-1):\n r.append(x-k+i+1)\n\nfor j in range(k):\n r.append(x+j)\n \nprint(*r)'] | ['Wrong Answer', 'Accepted'] | ['s331258930', 's405498695'] | [9140.0, 9168.0] | [27.0, 31.0] | [132, 133] |
p02946 | u917558625 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['s=list(map(int,input().split()))\ni=0\nlist=[]\nfor i in range(s[1]-s[0]+1,s[1]+s[0]):\n list.append(i)\nprint(list)', 's=list(map(int,input().split()))\ni=0\nlist=[]\nfor i in range(s[1]-s[0]+1,s[1]+s[0]):\n list.append(i)\nprint(" ".join(map(str, list)))'] | ['Wrong Answer', 'Accepted'] | ['s905340190', 's217552342'] | [2940.0, 2940.0] | [17.0, 17.0] | [112, 132] |
p02946 | u919463386 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['# -*- coding: utf-8 -*-\n\nK, X = map(int, input().split())\nK = K - 1\nans = [i for i in range(X-K,X+K+1)]\nprint(ans)\n', '# -*- coding: utf-8 -*-\n\nK, X = map(int, input().split())\nK = K - 1\nans = map(str,[i for i in range(X-K,X+K+1)])\nprint(" ".join(ans))\n'] | ['Wrong Answer', 'Accepted'] | ['s428008175', 's799363547'] | [2940.0, 2940.0] | [20.0, 17.0] | [115, 134] |
p02946 | u921027074 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K, X = map(int, input().split())\nfor num in range(X-K+1, X+K-1):\n print(num)', "K, X = map(int, input().split())\n for i in range(X - K + 1, X + K):\n if i < X + K - 1:\n print(i, end=' ')\n else:\n print(i)\n", "K, X = map(int, input().split())\nfor i in range(X - K + 1, X + K):\n i... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s534845100', 's541661697', 's404517150'] | [3060.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [79, 149, 139] |
p02946 | u923583900 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["re,x=map(int,input().split())\nprint(' '.join(map(str,(list(range(x-re+1,x+re)))))", "re,x=int(input().split())\nprint(' '.join(list(range(x-re+1,x+re))))", "re,x=map(int,input().split())\nprint(' '.join(list(range(x-re+1,x+re))))", 're,x=map(int,input().split())\nprint(*list(range(x-re+1,x+re)))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s620236486', 's636121829', 's892796798', 's645436102'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [81, 67, 71, 62] |
p02946 | u932868243 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k,x=map(int,input().split())\nlist=[]\nfor i in range(k):\n list.append(x+i)\n list.append(x-i)\nlist.remove(x)\nlist.sort()\nprint(*list sep='')", 'k,x=map(int,input().split())\nl=list(range(x-k+1,x+k))\n print(*l)\n', "k,x=map(int,input().split())\nlist=[]\nfor i in range(k):\n list.append(k+i)\n list.append(k... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s154038812', 's638410875', 's996725246', 's130043489'] | [2940.0, 2940.0, 2940.0, 3060.0] | [17.0, 17.0, 18.0, 17.0] | [140, 66, 140, 63] |
p02946 | u933341648 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k, x = map(int, input().split())\nprint(list(range(max(-1000000, x-k+1), min(x+k, 1000001))))\n', 'k, x = map(int, input().split())\nprint(*list(range(max(-1000000, x-k+1), min(x+k, 1000001))))\n'] | ['Wrong Answer', 'Accepted'] | ['s504219975', 's435323608'] | [2940.0, 3060.0] | [17.0, 17.0] | [93, 94] |
p02946 | u934052933 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['def main():\n k, x = map(int, input().split())\n res = [i for i in range(x-k+1, x+k)]\n print(res)\n\nif __name__ == "__main__":\n main()', 'def main():\n k, x = map(int, input().split())\n res = [str(i) for i in range(x-k+1, x+k)]\n print(" ".join(res))\n\nif __name__ == "__main__":\n main()'... | ['Wrong Answer', 'Accepted'] | ['s382554535', 's155367164'] | [2940.0, 2940.0] | [18.0, 18.0] | [143, 158] |
p02946 | u934693611 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['a,b=map(int,input().split())\nA=list()\nfor n in range(b-a+1,b+a):\n A.append(n)\nprint(A)', "a,b=map(int,input().split())\nA=list()\nfor n in range(b-a+1,b+a):\n A.append(n)\nprint(' '.join(map(str,A)))"] | ['Wrong Answer', 'Accepted'] | ['s539269020', 's790142668'] | [2940.0, 2940.0] | [17.0, 17.0] | [87, 106] |
p02946 | u935522051 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k = int(input())\nx = int(input())\nli = [str(2*k-1+i) for i in range(2*k-1)]\nl = ' '.join(li)\nprint(l)", "k = int(input())\nx = int(input())\nli = [str(x-k+1+i) for i in range(2*k-1)]\nl = ' '.join(li)\nprint(l)", "k = int(input())\nx = int(input())\nli = [str(x-k+1+i) for i in range(2*k-1)]\nl = ' '.join(li)\npri... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s204055769', 's222117126', 's756081004', 's792608512', 's030896679'] | [2940.0, 3064.0, 2940.0, 2940.0, 2940.0] | [17.0, 17.0, 17.0, 17.0, 17.0] | [101, 101, 106, 101, 99] |
p02946 | u935585974 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['\nK, X = map(int, input().split())\nlist_ans = []\n\nfor i in range(K):\n list_ans.append(X-(K-(i+1)))\n \nfor j in range(K-1):\n list_ans.append(X+j+1) \n\nprint(list_ans)', 'K, X = map(int, input().split())\nlist_ans = []\n\nfor i in range(K):\n list_ans.append(X-(K-(i+1)))\n \nfor j in range(K-1):\n li... | ['Wrong Answer', 'Accepted'] | ['s553889837', 's685376820'] | [2940.0, 3060.0] | [18.0, 17.0] | [168, 168] |
p02946 | u935719571 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['a = 2000001\nb = 1000000\nk, x = map(int, input().split())\n\nif(k == 1):\n print(x)\nelse:\n ans = [i for i in range(x-k+1, x+k-1)]\n print(" ".join(ans))\n', 'k, x = map(int, input().split())\n\nif(k == 1):\n print(x)\nelse:\n ans = [i for i in range(x-k+1, x+k)]\n print(" ".join(map(str, ans)))\n... | ['Runtime Error', 'Accepted'] | ['s120667224', 's538568623'] | [2940.0, 2940.0] | [17.0, 17.0] | [157, 141] |
p02946 | u946424121 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int, input().split())\nl = [str(i) for i in range(x+1-k,x-1+k)]\nprint(" ".join(l))', 'k,x = map(int, input().split())\nl = [str(i) for i in range(x+1-k,x+1+k)]\nprint(" ".join(l))', 'k,x = map(int, input().split())\nl = [str(i) for i in range(x+1-k,x+k)]\nprint(" ".join(l))'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s428256530', 's448123524', 's071827549'] | [2940.0, 2940.0, 2940.0] | [17.0, 18.0, 18.0] | [91, 91, 89] |
p02946 | u953868469 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['n = list(map(int,input().split()))\nk = n[0]\nx = n[1]\nans = []\n\nk_1 = k - 1\n\nfor n in range(x-k_1,x+k_1+1):\n ans.append(n)\n \nprint(ans)\n \n', 'n = list(map(int,input().split()))\nk = n[0]\nx = n[1]\nans = []\n\nk_1 = k - 1\n\nfor n in range(x-k_1,x+k_1+1):\n n = str(n)\n ans.append(n)\n\naa = " ".j... | ['Wrong Answer', 'Accepted'] | ['s675767564', 's255824936'] | [2940.0, 3060.0] | [17.0, 17.0] | [140, 173] |
p02946 | u957198490 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int,input().split())\nmi = X-K+1\nMa = X+K-1\nfor i in range(mi,Ma+1):\n A.append(i)\nprint(*ans)', 'K,X = map(int,input().split())\nmi = X-K+1\nMa = X+K-1\nA = []\nfor i in range(mi,Ma+1):\n A.append(i)\nprint(*A)'] | ['Runtime Error', 'Accepted'] | ['s410265219', 's966995836'] | [2940.0, 3060.0] | [17.0, 18.0] | [105, 110] |
p02946 | u958612488 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=list(map(int,input().split( )))\nlist_=[x+i for i in range(-k+1,k)]\nprint(list_)\n', 'k,x=list(map(int,input().split( )))\nlist_=[x+i for i in range(-k+1,k)]\nprint(*list_)'] | ['Wrong Answer', 'Accepted'] | ['s104292266', 's533337334'] | [2940.0, 3060.0] | [17.0, 18.0] | [84, 84] |
p02946 | u959149013 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k, x = map(int, input().split())\n\nans = [i for i in range(x - (k-1), x + (k-1))]\nprint(*ans)', 'k, x = map(int, input().split())\n\nans = [i for i in range(x - (k-1), x + (k))]\nprint(*ans)'] | ['Wrong Answer', 'Accepted'] | ['s893031225', 's408186319'] | [3060.0, 3060.0] | [17.0, 17.0] | [92, 90] |
p02946 | u960171798 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=map(int, input().split())\nmin_ans=x-k+1\nmax_ans=x+k-1\nans_list=list(range(min_ans,max_ans+1))\nprint(" ".join(ans_list))', 'k,x=map(int, input().split())\nmin_ans=x-k+1\nmax_ans=x+k-1\nans_list=list(range(min_ans,max_ans+1))\nfor i in range(len(ans_list)):\n ans_list[i]=str(ans_list[i])\nans=" ".join(ans_list... | ['Runtime Error', 'Accepted'] | ['s472523089', 's617675717'] | [2940.0, 3060.0] | [17.0, 18.0] | [123, 194] |
p02946 | u966546644 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k, x = map(int, input().split())\noutput_num = (k*2)-1\nstart_num = x-(k-1)\nprint(*range(start_num, output_num, 1))', 'k, x = map(int, input().split())\noutput_num = (k*2)-1\nstart_num = x-(k-1)\nprint(list(range(start_num, output_num, 1)))', 'k, x = map(int, input().split())\noutput_num = (k*2)-1\nstart_num = x-(k-... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s251823700', 's268815207', 's290589859', 's352860478', 's742434701', 's813254329', 's554005627'] | [3060.0, 2940.0, 3060.0, 2940.0, 3064.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 18.0] | [113, 118, 110, 113, 106, 106, 107] |
p02946 | u966667387 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k,x = list(map(int, input().split()))\nposi = [p for p in range(x-k+1, x+k-1)]\nprint(' '.join(posi))\n", "k,x = list(map(int, input().split()))\nposi = [str(p) for p in range(x-k+1, x+k)]\nprint(' '.join(posi))"] | ['Runtime Error', 'Accepted'] | ['s046524732', 's380109916'] | [2940.0, 2940.0] | [17.0, 17.0] | [100, 102] |
p02946 | u968638278 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k, x = map(int, input().split())\n\na = list(range(x-(k-1), x+k)\nprint(*a)\n', 'k, x = map(int, input().split())\n\na = list(range(x-(k-1), x+k))\nprint(*a)\n'] | ['Runtime Error', 'Accepted'] | ['s272217995', 's464325654'] | [2940.0, 3060.0] | [17.0, 17.0] | [73, 74] |
p02946 | u969848070 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k, x = map(int,input().split())\na = []\nfor i in range(-k+x+1, k+x):\n a.append(i)\nprint(' '.join(a))", "k, x = map(int,input().split())\na = []\nfor i in range(-k+x+1, k+x):\n a.append(str(i))\nprint(' '.join(a))"] | ['Runtime Error', 'Accepted'] | ['s476237636', 's328608715'] | [2940.0, 2940.0] | [18.0, 17.0] | [100, 105] |
p02946 | u974935538 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int,input().split())\n\na=[]\nfor i in range(X-K+1,X):\n a.append(i)\nfor i in range(X,X+K):\n a.append(i)\nset(list(a))\n\nprint(a)', 'K,X = map(int,input().split())\n\na=[]\nfor i in range(X-K+1,X):\n a.append(i)\nfor i in range(X,X+K):\n a.append(i)\nset(list(a))\n\nprint(*a)'] | ['Wrong Answer', 'Accepted'] | ['s110060155', 's276212650'] | [2940.0, 3060.0] | [17.0, 17.0] | [139, 140] |
p02946 | u978962055 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=map(int,input().split())\nif x>k:\n print(*range(x-k,x+k))\nelif x<k:\n print(*range(x-k+1, x+k))\nelse:\n print(x)', 'k,x=map(int,input().split())\nif x>k:\n print(*range(x-k,x+k))\nelif x<k:\n print(*range(x-k+1, x+k))\nelif k==1:\n print(x)', 'k,x=map(int,input().split())\nif x>k:\n print(*range(x-k,x+k... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s105753943', 's238894214', 's276459393', 's380885584', 's424107064', 's226094468'] | [3060.0, 3060.0, 3060.0, 2940.0, 3060.0, 3060.0] | [20.0, 18.0, 17.0, 17.0, 17.0, 17.0] | [116, 121, 121, 52, 78, 54] |
p02946 | u981304949 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["K,X = map(int,input().split())\nfor i in range (K-X+1,K+X):\n if i < X + K -1:\n print(i,end=' ')\n else:\n print(i)", 'K,X = map(int,input().split())\nfor i in range (K-X+1,K+X-1):\n print(i)', "X,K = map(int,input().split())\nfor i in range (K-X+1,K+X):\n if i < X + K -1:\n print(i,... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s380883743', 's529114025', 's054320936'] | [3060.0, 3060.0, 3060.0] | [21.0, 17.0, 17.0] | [131, 73, 131] |
p02946 | u982438430 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['K,X = map(int,input().split())\n\n\nXmin = X-K+1\nXmax = X+K-1\n\nif Xmin < -1000000:\n Xmin = -1000000\n\nif Xmax>1000000:\n Xmax=1000000\n \nXrange = list(range(Xmin,Xmax,1))\n\nprint(" ".join( repr(e) for e in Xrange ) )', 'K,X = map(int,input().split())\n\n\nXmin = X-K+1\nXmax = X+K-1\n\nif Xmin < -1000000:\n ... | ['Wrong Answer', 'Accepted'] | ['s340506590', 's156831376'] | [3060.0, 3060.0] | [17.0, 17.0] | [212, 214] |
p02946 | u982653403 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(input().split())\nstart=max(-1000000,x-k+1)\nend=min(1000000,x+k-1)\nprint(" ".join(range(start,end+1)))\n', 'k, x = map(int, input().split())\nstart = max(-1000000, x-k+1)\nend = min(1000000, x+k-1)\nprint(" ".join(map(str, range(start, end+1))))\n'] | ['Runtime Error', 'Accepted'] | ['s883810634', 's427040234'] | [3060.0, 2940.0] | [19.0, 17.0] | [112, 135] |
p02946 | u982749462 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k, x= map(int, input().split())\nl=[x]\nfor i in range(1, k):\n l.append(x-i)\n l.append(x+i)\nl.sort()\nl = list(map(str, l))', "k, x= map(int, input().split())\nl=[x]\nfor i in range(1, k):\n l.append(x-i)\n l.append(x+i)\nl.sort()\nl = list(map(str, l))\nprint(' '.join(l))"] | ['Wrong Answer', 'Accepted'] | ['s315928751', 's075898142'] | [2940.0, 2940.0] | [17.0, 17.0] | [122, 141] |
p02946 | u991148747 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x = map(int,input().split())\n\nlst = []\nfor i in range(0,k):\n lst.append(x+i)\n lst.append(x-i)\n\nlst = list(set(lst))\n\nprint([i for i in lst if i <= 1000000 and i >= -1000000])\n', "k,x = map(int,input().split())\n\nlst = []\nfor i in range(0,k):\n lst.append(x+i)\n lst.append(x-i)\n\nlst = list(set(lst... | ['Wrong Answer', 'Accepted'] | ['s349577796', 's275854259'] | [2940.0, 3060.0] | [17.0, 19.0] | [180, 219] |
p02946 | u992335470 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['# -*- coding: utf-8 -*-\n\nk, x = map(int, input().split())\n\n\nans = list(range(x-k+1,x+k,1)) \n\n\nprint(ans)', '# -*- coding: utf-8 -*-\n\nk, x = map(int, input().split())\n\n\nans = list(range(x-k+1,x+k,1)) \n\n\nprint(*ans)'] | ['Wrong Answer', 'Accepted'] | ['s639503369', 's031140377'] | [2940.0, 3060.0] | [17.0, 17.0] | [173, 174] |
p02946 | u994521204 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ['k,x=map(int,input().split())\nprint([i for i in range(x-(k-1), x+(k-1)+1)])', 'k,x=map(int,input().split())\nprint([i for i in range(k-(x-1), k+(x-1)+1)])', "k,x=map(int,input().split())\nans=[i for i in range(x-(k-1), x+(k-1)+1)]\nprint(*ans,sep=' ')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s011242718', 's634770354', 's447596909'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [74, 74, 91] |
p02946 | u996434204 | 2,000 | 1,048,576 | There are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \ldots, 999999, 1000000. Among them, some K consecutive stones are painted black, and the others are painted white. Additionally, we know that the stone at coordinate X is painted black. Print all coordi... | ["k,x=map(int, input().split())\n\nlist=[]\n\nfor i in range(x-k+1,x+k):\n list.append(i)\n\nlist=str(list)\n\nprint(''.join(list))", "k,x=map(int, input().split())\n\nlist=[]\n\nfor i in range(x-k+1,x+k):\n if i!=x+k-1:\n print(i,end=' ')\n elif i==x+k-1:\n print(i)"] | ['Wrong Answer', 'Accepted'] | ['s216963336', 's718818370'] | [2940.0, 3060.0] | [18.0, 17.0] | [123, 144] |
p02947 | u000212387 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ["from collections import Counter\nimport math\nn=int(input())\ns=[['']*10]*n\n\ndef com(n, r):\n if n>=r:\n return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))\n else:\n return 0\nfor i in range(n):\n s[i]=list(input())\n s[i].sort()\ns=map(tuple,s)\nc=dict(Counter(s))\npr... | ['Wrong Answer', 'Accepted'] | ['s802364571', 's611555058'] | [45184.0, 45064.0] | [781.0, 772.0] | [359, 350] |
p02947 | u002459665 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['from collections import defaultdict\nfrom math import factorial\n\nN = int(input())\nst = set()\nd = defaultdict(int)\nfor _ in range(N):\n s = input()\n s_sorted = "".join(sorted(s))\n if s_sorted in st:\n d[s_sorted] += 1\n else:\n st.add(s_sorted)\n\nans = 0\n# for _, v in d.items():\n# ... | ['Wrong Answer', 'Accepted'] | ['s646338117', 's689764800'] | [15212.0, 17888.0] | [383.0, 420.0] | [375, 319] |
p02947 | u003652013 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['import collections\nN = int(input())\ns = []\nfor i in range(N):\n word = input()\n s.append(word)\n\nc = collections.Counter(s)\n\nsum = 0\nfor value in c.values():\n sum += (value * (value-1) / 2)\n\nprint(int(sum))', "import collections\nN = int(input())\ns = []\nfor i in range(N):\n word = input()\n chars = ... | ['Wrong Answer', 'Accepted'] | ['s244277341', 's386072519'] | [19820.0, 19824.0] | [188.0, 959.0] | [207, 403] |
p02947 | u011062360 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ["n = map(int, input())\na = []\nnew_a = []\n\nfor k in n:\n a[k] = map(str, input())\n\nfor k in n:\n new_a[k] = ''.join(list(reversed(a[k])))\n\nsorted(new_a)\n\nb = 0\n\nfor k in n:\n if(new_a[k] == new_a[k+1]):\n b = b +1\n \nprint(b)\n", "import math\nn = int(input())\nlist_voc = [str(input(... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s588183208', 's617779471', 's621667844', 's855338036', 's910080450', 's968653936', 's986155992', 's957025426'] | [3060.0, 23656.0, 18516.0, 3060.0, 24040.0, 24272.0, 24096.0, 24060.0] | [17.0, 2105.0, 310.0, 17.0, 440.0, 2105.0, 440.0, 234.0] | [242, 591, 249, 261, 277, 374, 277, 473] |
p02947 | u013513417 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['N=int(input())\n\n\nS = [[0 for j in range(10)] for i in range(N)]\n\nfor i in range(N):\n R=input()\n for j in range(10):\n S[i][j]=R[j]\n S[i].sort()\n \n L=[str(a) for a in S[i]]\n L="".join(L)\n S[i]=L\n\n\n', 'N=int(input())\n\n\nS = [[0 for j in range(10)] for i in range(N)]\n\nfor i... | ['Wrong Answer', 'Accepted'] | ['s835782695', 's492448092'] | [26228.0, 24180.0] | [872.0, 932.0] | [289, 544] |
p02947 | u014250021 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['from collections import defaultdict\nn = int(input())\nseen = defaultdict(int)\nfor _ in range(n):\n s = sorted(input())\n seen[s]+=1\n\nans = 0\nfor i in seen:\n ans+= seen[i]*(seen[i]-1)//2\nprint(ans)', 'from collections import defaultdict\nn = int(input())\nseen = defaultdict(int)\nfor _ in range(n):\n s = ""... | ['Runtime Error', 'Accepted'] | ['s509040486', 's935187659'] | [3316.0, 18236.0] | [20.0, 427.0] | [196, 206] |
p02947 | u014690850 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['amap = {}\ncnt = 0\nn = int(input())\nfor i in range(n):\n s = "".join(sorted(input()))\n if s in amap:\n cnt += amap[s]\n amap[s] += 1\n\nprint(cnt)', 'amap = {}\ncnt = 0\nn = int(input())\nfor i in range(n):\n s = "".join(sorted(input()))\n if s in amap:\n cnt += amap[s]\n amap[s] += 1\n else:\n a... | ['Runtime Error', 'Accepted'] | ['s791067187', 's332513202'] | [3060.0, 17852.0] | [17.0, 384.0] | [146, 172] |
p02947 | u021217230 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['d={}\ns=0\nfor _ in range(int(input())):\n l=input()\n l=sorted(l)\n f=d.keys()\n if l not in f:\n d[l]=0\n else:\n d[j]+=1\n s+=d[j]\nprint(s)\n \n \n ', 'def areAnagram(str1, str2): \n # Get lengths of both strings \n n1 = len(str1) \n n2 = len(str2) \n \n \n if n1 != n2... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s527769765', 's709687027', 's962215875'] | [3060.0, 10268.0, 21988.0] | [18.0, 2104.0, 543.0] | [159, 478, 156] |
p02947 | u021548497 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['N = int(input())\ns = [0]*N\np = [0]*N\nfor i in range(N):\n s[i] = "".join(sorted(input()))\n print(s)\n for j in range(i-1,-1,-1):\n if s[i] == s[j]:\n p[i] = p[j] + 1\n break\n\nprint(sum(p))', 'n = int(input)\nans = {}\nfor i in range(n):\n s = input()\n t = []\n for... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s449442076', 's679395446', 's069694496'] | [107136.0, 3064.0, 17888.0] | [2104.0, 17.0, 584.0] | [221, 303, 305] |
p02947 | u022979415 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['def main():\n list = []\n result = 0\n N = int(input())\n for i in range(0, N):\n ss = input()\n s = "".join(sorted(ss))\n if i == 0:\n list.append(s)\n else:\n for j in list:\n if j == s:\n result += 1\n ... | ['Wrong Answer', 'Accepted'] | ['s105756335', 's034107891'] | [206744.0, 17852.0] | [2114.0, 357.0] | [401, 335] |
p02947 | u025287757 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ["N = int(input())\nS =[[] for _ in range(N)]\nfor i in range(N):\n s = list(str(input()))\n s.sort()\n s = ''.join(s)\n S[i].append(s)\nfrom collections import Counter\nl = Counter(S)\ncount = []\nfor i in l.values:\n count.append(i*(i-1)/2)\nprint(sum(count))\n \n\n", "N = int(input())\nS =[]\nfor i in range(N)... | ['Runtime Error', 'Accepted'] | ['s050369313', 's417823676'] | [21456.0, 19756.0] | [401.0, 414.0] | [257, 237] |
p02947 | u028014940 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['\nimport sys\nread = sys.stdin.buffer.read \nreadline = sys.stdin.buffer.readline \nreadlines = sys.stdin.buffer.readlines \nsys.setrecursionlimit(10**7) \n\nn=int(input())\ns_lis=["".join(sorted(readline().rstrip().decode())) for _ in range(n)]\n\nfrom collections import Counter\ncounter = Counter(s_lis) \n \nanswer... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s627086523', 's940141467', 's431585717'] | [19784.0, 19788.0, 19764.0] | [222.0, 228.0, 366.0] | [524, 524, 512] |
p02947 | u028042029 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['import numpy as np\nN = input()\nN = int(N)\nSdict = {}\nn_anagram = 0\nD = {"a":2, "b":3, "c":5, "d":7, "e":11, "f":13,"g":17, "h":19, "i":23, "j":29, "k":31, "l":37, "m":41, "n":43,\n"o":47, "p":53, "q":57, "r":59, "s":61, "t":67, "u":71, "v":73, "w":79, "x":83, "y":87, "z":1}\n\nS = [input() for _ in range(N)]\n\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s337822945', 's677951374', 's801738287'] | [24280.0, 28960.0, 31164.0] | [840.0, 2109.0, 1786.0] | [473, 534, 506] |
p02947 | u035453792 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['n=int(input())\ns = [input() for i in range(n)]\nr=[]\nc=0\na=0\nfor i in range(n):\n r.append((sorted([s[i][j] for j in range(10)])))\n\nfor i in range(n-1):\n for j in range(i+1,n):\n for k in range(10):\n if r[i][k]==r[j][k]:\n c+=1\n if c==10:\n c=0\n ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s354717838', 's443119353', 's482007010', 's496401628', 's537691015', 's555648771', 's719428321', 's827396057', 's883785927', 's792995260'] | [31260.0, 11036.0, 11036.0, 14360.0, 10272.0, 9180.0, 11036.0, 10268.0, 10272.0, 21852.0] | [2105.0, 147.0, 137.0, 154.0, 139.0, 25.0, 142.0, 141.0, 146.0, 308.0] | [341, 235, 234, 244, 209, 201, 246, 209, 239, 277] |
p02947 | u037221289 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ["N = int(input())\ncount = 0\nDIC = {}\nfor i in range(n):\n j = ''.join(sorted(input()))\n if j in DIC:\n count += DIC[j]\n DIC[j] += 1\n else:\n DIC[j] = 1\nprint(count)\n", "N = int(input())\nS = {}\nnum = 0\nfor i in range(N):\n s = ''.join(sorted(list(input())))\n if s in S:\n n... | ['Runtime Error', 'Accepted'] | ['s082723327', 's199169467'] | [3060.0, 17808.0] | [17.0, 425.0] | [191, 165] |
p02947 | u039189422 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['P=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101]\nn=int(input())\nA=[1]*n\n\nfor i in range(n):\n\ts=input()\n\tfor j in range(10):\n\t\tA[i] *= P[ord(s[j])]\n\nres=0\nfor i in range(n):\n\tfor j in range(i+1,n):\n\t\tif A[i]==A[j]:\n\t\t\tres += 1\nprint(res)', 'import collections\nn=in... | ['Runtime Error', 'Accepted'] | ['s982711975', 's911409968'] | [3828.0, 19760.0] | [18.0, 335.0] | [266, 179] |
p02947 | u039332718 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ['# -*- coding: UTF-8 -*-\n\nn = int(input())\nl = []\n\nfor i in range(n):\n l.append("".join(sorted(str(input()))))\n\nl.sort()\nprint(l)\n\np = 0\ns = 1\nf = 0\n\nfor i in range(n-1):\n if l[i] == l[i+1] and i != n-2:\n s += 1\n f = 1\n\n elif l[i] != l[i+1] and f == 1:\n f = 0\n ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s258505109', 's357342702', 's630103886', 's175966867'] | [14596.0, 10636.0, 14596.0, 10640.0] | [467.0, 437.0, 454.0, 465.0] | [446, 359, 441, 437] |
p02947 | u042385277 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ["N = int(input())\ns = [''.join(sorted(input())) for _ in range(N)]\nk = 0\nfor i in range(N - 1) :\n for k in range(i + 1, N) :\n if s[i] == s[k] :\n k += 1\nprint(k)\n", "N = int(input())\ns = [''.join(sorted(input())) for _ in range(N)]\ns_dict = {}\nsum = 0\nfor i in range(N):\n if s[i] in ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s259325547', 's264822592', 's536810351', 's549524823', 's699822943', 's934127562', 's977557907', 's272291946'] | [10208.0, 3064.0, 10208.0, 3064.0, 3056.0, 3060.0, 24208.0, 19404.0] | [2104.0, 17.0, 2104.0, 17.0, 17.0, 17.0, 316.0, 400.0] | [181, 234, 181, 233, 224, 237, 224, 233] |
p02947 | u042716570 | 2,000 | 1,048,576 | We will call a string obtained by arranging the characters contained in a string a in some order, an _anagram_ of a. For example, `greenbin` is an anagram of `beginner`. As seen here, when the same character occurs multiple times, that character must be used that number of times. Given are N strings s_1, s_2, \ldots,... | ["def anagram(n,s):\n count = 0\n dic = {}\n for s in S:\n if s in dic:\n count += dic[s]\n dic[s] += 1\n else:\n dic[s] = 1\n return count\n\nN = int(input())\nS = []\nfor i in range(N):\n li = sorted(input())\n li = ''.join(li)\n S.append(li)\nanagra... | ['Wrong Answer', 'Accepted'] | ['s168412113', 's538778318'] | [19400.0, 19504.0] | [373.0, 356.0] | [307, 314] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.