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
|
|---|---|---|---|---|---|---|---|---|---|---|
p02687 | u871934301 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S=int(input())\nif S="ABC":\n print("ARC")\nelse:\n print("ABC")\n\n\n\n\n\n', 'S=input()\nif S=="ABC":\n print("ARC")\nelse:\n print("ABC")\n\n\n\n\n\n'] | ['Runtime Error', 'Accepted'] | ['s896343779', 's114365340'] | [9004.0, 8944.0] | [19.0, 21.0] | [72, 68] |
p02687 | u873134970 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['i = input()\nif i = "ABC":\n print("ARC")\nelse:\n print("ABC")', 'i = input()\nif i == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s442693346', 's030224707'] | [8948.0, 8956.0] | [21.0, 23.0] | [61, 62] |
p02687 | u875113233 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['print(input())', 'def main():\n n=input()\n print(n)\n \nif __name__ == "__main__":\n main()', 'def main():\n M=input()\n if M == \'ABC\':\n print(\'ARC\')\n else:\n print(\'ABC\')\n\nif __name__ == "__main__":\n main()\n '] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s231207372', 's441392452', 's793529167'] | [9056.0, 8808.0, 8996.0] | [27.0, 27.0, 29.0] | [14, 72, 124] |
p02687 | u879061031 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s=str(input())\n\nif s==\'ABC\':\n print("ABC")\n\nelif s==\'ARC\':\n print("ARC")\n\nelse:\n pass\n', "s=str(input())\n\nif s=='ABC':\n print('ABC')\n\nelif s=='ARC':\n print('ARC')\n\nelse:\n pass\n", 's=str(input())\n\nif s==\'ABC\':\n print("ABC")\n\nelif s==\'ARC\':\n print("ARC")\n\nelse:\n pass\n', 's=int(input())\nif s==\'ABC\':\n print("ABC")\n \nelif s==\'ARC\':\n print("ARC")\n\nelse:\n pass', "s=str(input())\nif s=='ABC':\n print('ARC')\n \nelif s=='ARC':\n print('ABC')\n \nelse:\n pass"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s082477288', 's525447331', 's682544152', 's882188868', 's538876459'] | [8892.0, 9084.0, 9084.0, 8936.0, 9024.0] | [20.0, 23.0, 22.0, 20.0, 22.0] | [95, 95, 95, 89, 91] |
p02687 | u879921371 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['def factorization(num):\n if num == 1:\n return [1]\n factor = []\n while num > 1:\n for i in range(num - 1):\n k = i + 2\n if num % k == 0:\n factor.append(k)\n num = int(num / k)\n break\n return factor\n \nx=int(input())\na=0\nb=0\na_b=0\ny=factorization(x)\nlen_y=len(y)\nz=set(y)\n\n\nz=list(z)\n#print(z)\nfor j in range(len(z)):\n a_b=z[j]\n for k in range(a_b):\n a=a_b+k\n b=k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n a=a_b-k\n b=0-k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n \nif len_y > 2:\n z=set([])\n for l in range(0,len_y-1):\n for m in range(l,len_y):\n z=z|set([y[l]*y[m]])\n z=list(z)\n for j in range(len(z)):\n a_b=z[j]\n for k in range(a_b):\n a=a_b+k\n b=k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n a=a_b-k\n b=0-k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n \nif len_y > 3:\n z=set([])\n for l in range(0,len_y-2):\n for m in range(l,len_y-1):\n for n in range(m,len_y):\n z=z|set([y[l]*y[m]*y[n]])\n z=list(z)\n for j in range(len(z)):\n a_b=z[j]\n for k in range(a_b):\n a=a_b+k\n b=k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n a=a_b-k\n b=0-k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n\nif len_y > 4:\n z=set([])\n for l in range(0,len_y-3):\n for m in range(l,len_y-2):\n for n in range(m,len_y-1):\n for p in range(n,len_y):\n z=z|set([y[l]*y[m]*y[p]])\n z=list(z)\n for j in range(len(z)):\n a_b=z[j]\n for k in range(a_b):\n a=a_b+k\n b=k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n a=a_b-k\n b=0-k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n\nif len_y > 5:\n z=set([])\n for l in range(0,len_y-4):\n for m in range(l,len_y-3):\n for n in range(m,len_y-2):\n for p in range(n,len_y-1):\n for q in range(p,len_y):\n z=z|set([y[l]*y[m]*y[p]*y[q]])\n z=list(z)\n for j in range(len(z)):\n a_b=z[j]\n for k in range(a_b):\n a=a_b+k\n b=k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()\n a=a_b-k\n b=0-k\n if a**5-b**5== x:\n print("%d %d" % (a,b))\n exit()', 'o={"ABC":"ARC","ARC":"ABC"}\ns = input()\nprint(o[s])'] | ['Runtime Error', 'Accepted'] | ['s958537215', 's556329262'] | [9364.0, 9088.0] | [24.0, 18.0] | [2317, 51] |
p02687 | u880400515 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = input()\n\n\nif (S = "ABC"):\n print("ARC")\nif (S = "ARC"):\n print("ABC")', 'S = input()\n\n\nif (S == "ABC"):\n print("ARC")\nif (S == "ARC"):\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s421955295', 's767145888'] | [9004.0, 9032.0] | [20.0, 26.0] | [79, 81] |
p02687 | u882514852 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = input()\nif S == ABC:\n print("ARC")\nelse:\n print("ABC")', 'S = input()\nif S == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s671617939', 's553755058'] | [8952.0, 8936.0] | [25.0, 25.0] | [60, 62] |
p02687 | u883307604 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["s = input()\nif s == 'ABC':\n\tprint('ARC)\nelse:\n\tprint('ARC')\n", "s = input()\nif s = 'ABC':\n\tprint('ARC)\nelse:\n\tprint('ARC')", "s = input()\nif s == 'ABC':\n\tprint('ARC')\nelse:\n\tprint('ABC')\n"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s205023470', 's441014892', 's137258659'] | [9016.0, 8948.0, 9084.0] | [21.0, 23.0, 22.0] | [60, 58, 61] |
p02687 | u886362575 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['N = int(input())\nA = [int(a) for a in input().split()]\ncnt = 0\nfor i in range(N):\n for j in range(i+1, N):\n d = A[i] + A[j] - (j-i)\n if d == 0:\n cnt += 1\nprint(cnt)', 's = input()\nif s == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s831475432', 's025187611'] | [9100.0, 8840.0] | [20.0, 19.0] | [176, 62] |
p02687 | u888804711 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['N, A, B, C = map(int, input().split(" "))\ncommands = []\ndata = {\n \'A\': A,\n \'B\': B,\n \'C\': C\n}\nans = [] \n\nif A >=1 and B >= 1 and C >= 1 :\n print("Yes")\n for _ in range(N) :\n command = input()\n if data[command[0]] > data[command[1]] :\n data[command[0]] -= 1\n data[command[1]] += 1\n print(command[1])\n else :\n data[command[0]] += 1\n data[command[1]] -= 1\n print(command[0]) \nelse :\n safe = []\n commands = []\n for _ in range(N) :\n commands.append(input())\n\n fail = False\n i = 0 \n ans = []\n \n while i < N : \n if data[commands[i][0]] == 0 and data[commands[i][1]] == 0 :\n if safe == [] :\n fail = True\n break\n else : \n data, i, _ans = safe.pop()\n ans = ans[:i+1]\n ans.append(_ans)\n \n elif data[commands[i][0]] == 1 and data[commands[i][1]] == 1 :\n _data = { \'A\' :data[\'A\'], \'B\' :data[\'B\'], \'C\' :data[\'C\'] }\n _i = i\n \n _data[commands[i][1]] += 1\n _data[commands[i][0]] -= 1\n _ans = commands[i][1] \n safe.append( [_data, _i, _ans] ) \n\n data[commands[i][0]] += 1\n data[commands[i][1]] -= 1\n ans.append( commands[i][0] )\n else :\n if data[commands[i][0]] > data[commands[i][1]] :\n x = commands[i][0] \n y = commands[i][1] \n else :\n x = commands[i][1] \n y = commands[i][0]\n\n data[x] -= 1 \n data[y] += 1\n ans.append(y)\n\n i += 1\n\n if fail :\n print("No")\n else :\n print("Yes")\n for c in ans :\n print(c)', 's = input()\nif s == "ABC" :\n print("ARC")\nelse :\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s415283771', 's822937106'] | [9352.0, 9028.0] | [24.0, 20.0] | [1822, 68] |
p02687 | u891945807 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = input()\n\nif s = "ABC":\n print("ARC")\nelse:\n print("ABC")\n', 's = input()\n\nif s == "ABC":\n print("ARC")\nelse:\n print("ABC")\n'] | ['Runtime Error', 'Accepted'] | ['s448269206', 's886115141'] | [8944.0, 9020.0] | [23.0, 24.0] | [63, 64] |
p02687 | u896941378 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['\nimport numpy as np;\nfrom numba import jit\n\n\n\n\nif __name__ == \'__main__\':\n S = input()\n if S == "ABC":\n print("ARC")\n else:\n print("ABC"', '\nimport numpy as np;\nfrom numba import jit\n\n\n\n\nif __name__ == \'__main__\':\n S = input()\n if S == "ABC":\n print("ARC")\n else:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s118642516', 's064824855'] | [8964.0, 91704.0] | [23.0, 389.0] | [159, 160] |
p02687 | u897328029 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = input()\nans = "ABC" if s == "ARC" else s\nprint(ans)', 's = input()\nans = "ABC" if s == "ARC" else "ARC"\nprint(ans)\n'] | ['Wrong Answer', 'Accepted'] | ['s969092726', 's214716113'] | [9092.0, 9072.0] | [22.0, 21.0] | [55, 60] |
p02687 | u898058223 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s=input()\nif s="ABC":\n print("ARC")\nelse:\n print("ABC")', 's=input()\nif s=="ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s445277700', 's637000574'] | [8944.0, 9092.0] | [21.0, 20.0] | [57, 58] |
p02687 | u899929023 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = input()\nif s=="ABC:\nprint("ARC")\nelse:\n print("ABC")', 's = input()\nif s=="ABC":\nprint("ARC")\nelse:\n print("ABC")\n', 's = input()\nif s=="ABC":\n print("ARC")\nelse:\n print("ABC")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s756621403', 's787122919', 's389209090'] | [9008.0, 9012.0, 9020.0] | [21.0, 24.0, 20.0] | [57, 59, 61] |
p02687 | u904331908 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = input()\n\nif s = "ABC":\n print("ARC")\nelse:\n print("ABC")', 's = input()\n\nif s == "ABC":\n print("ARC")\nelse:\n print("ABC")\n'] | ['Runtime Error', 'Accepted'] | ['s152775269', 's556779539'] | [8840.0, 8872.0] | [25.0, 25.0] | [62, 64] |
p02687 | u909991537 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["S = input()\n\nif S == 'ARC':\n print('ABC')\nelse:\n print('ARC)", "S = input()\n\nif S == 'ARC':\n print('ABC')\nelse:\n print('ARC')"] | ['Runtime Error', 'Accepted'] | ['s998922805', 's055937086'] | [8956.0, 9024.0] | [23.0, 24.0] | [62, 63] |
p02687 | u910536093 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['n, m = list(map(int, input().split()))\n\nheight = [int(i) for i in input().split()]\n\ntele = {}\nfor num, h in enumerate(height, 1):\n tele[num] = [h, "G"]\n\nfor roads in range(m):\n a, b = list(map(int, input().split()))\n if (tele[a][0] > tele[b][0]):\n tele[b][1] = "N"\n elif (tele[a][0] < tele[b][0]):\n tele[a][1] = "N"\n elif (tele[a][0] == tele[b][0]):\n tele[a][1] = "N"\n tele[b][1] = "N"\n\nans_list = tele.values()\nans = 0\nfor a in ans_list:\n if (a[1] == "G"):\n ans += 1\n\nprint(ans)\n\n', 't = input()\n\nif (t=="ABC"):\n print("ARC")\nelse:\n print("ABC")\n'] | ['Runtime Error', 'Accepted'] | ['s696879005', 's804551507'] | [9176.0, 9012.0] | [23.0, 22.0] | [534, 68] |
p02687 | u912650255 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["contest=input()\nif contest == 'ABC':\n print('ARC')\nelif contest == 'ARC':\n print('ABC)\n ", "contest=input()\nif contest == 'ABC':\n print('ARC')\nelif contest == 'ARC':\n print('ABC')\n "] | ['Runtime Error', 'Accepted'] | ['s019345192', 's579574675'] | [9016.0, 9060.0] | [24.0, 23.0] | [97, 98] |
p02687 | u913392095 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['N,M = map(int,input().split())\nH=list(map(int,input().split()))\nABmap=[[0 for i in range(N)] for i in range(N)]\ncount=0\nfor i in range(M):\n A,B=map(lambda x:x-1,map(int,input().split()))\n ABmap[A][B]=H[B]\n ABmap[B][A]=H[A]\n \nfor i in range(N):\n #print(ABmap[i])\n #print(ABmap.count(H[i]))\n if max(ABmap[i])<H[i]:\n count+=1\nprint(count)\n \n ', 'N,M = map(int,input().split())\nH=list(map(int,input().split()))\nABmap=[[] for i in range(N)]\ncount=0\nfor i in range(M):\n A,B=map(lambda x:x-1,map(int,input().split()))\n ABmap[A].append(H[B])\n ABmap[B].append(H[A])\n \nfor i in range(N):\n #print(ABmap[i])\n #print(ABmap.count(H[i]))\n if max(ABmap[i])<H[i]:\n count+=1\nprint(count)\n \n ', 'S=input()\nT=""\nif S=="ARC":\n T="ABC"\nelse: T="ARC"\nprint(T)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s450667863', 's948778393', 's107067001'] | [9212.0, 9048.0, 8940.0] | [24.0, 23.0, 23.0] | [381, 372, 61] |
p02687 | u914802579 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['n,a,b,c = list(map(int,input().split()))\nan=0;d={};l=[];x=y=z=0\nfor i in range(n):\n s=input();l.append(s)\n x+=int(s[0]==\'A\')\n z+=int(s[-1]==\'C\')\n y+=int(s[-1]==\'B\')+int(s[0]==\'B\')\nx=a-x;y=b-y;z=c-z\nif (x<0)+(y<0)+(z<0)>=2:\n print("No");exit()\na=[]\nfor i in range(n):\n if l[i]==\'AC\':\n if x>=0:\n z+=1;a.append(\'C\')\n else:\n x+=1;a.append(\'A\')\n if l[i]==\'AB\':\n if x>=0:\n y+=1;a.append(\'B\')\n else:\n x+=1;a.append(\'A\')\n if l[i]==\'BC\':\n if y>=0:\n z+=1;a.append(\'C\')\n else:\n y+=1;a.append(\'B\')\nprint("Yes")\nfor i in a:\n print(i)', "p=list(input())\np[1]='R' if p[1]=='B' else 'B'\nprint(''.join(p))"] | ['Runtime Error', 'Accepted'] | ['s682044386', 's524162438'] | [9212.0, 9092.0] | [20.0, 23.0] | [577, 64] |
p02687 | u919017918 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["S = input()\n \nif S = 'ABC':\n print('ARC')\nelse:\n print('ABC')", "S = input()\n \nif S == 'ABC':\n print('ARC')\nelse:\n print('ABC')\n"] | ['Runtime Error', 'Accepted'] | ['s885026977', 's853415126'] | [8948.0, 9012.0] | [18.0, 19.0] | [67, 69] |
p02687 | u919235786 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["s=int(input())\nif s=='ABC':\n print('ARC')\nelse: print('ABC')", "s=(input())\nif s=='ABC':\n print('ARC')\nelse: print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s750792381', 's574230626'] | [8968.0, 8912.0] | [21.0, 24.0] | [63, 60] |
p02687 | u921818939 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['x=intput()\nif x==\'ABC\':\n print("ARC")\nelse:\n print("ABC")\n', 'x=input()\nif x==\'ABC\':\n print("ARC")\nelse:\n print("ABC")\n'] | ['Runtime Error', 'Accepted'] | ['s764491392', 's931367140'] | [9076.0, 9016.0] | [21.0, 22.0] | [64, 63] |
p02687 | u927807968 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = char(input())\nif s=="ABC":\n print("ARC")\nelse:\n print("ABC")', 's = input()\nif s=="ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s549946890', 's229885185'] | [8956.0, 9020.0] | [21.0, 20.0] | [70, 64] |
p02687 | u930574673 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = input()\nif S = "ABC":\n print("ARC")\nelse:\n print("ABC")', 'S = input()\nif S == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s322808096', 's198681039'] | [8812.0, 8928.0] | [23.0, 23.0] | [61, 62] |
p02687 | u935016954 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['N = input()\n\nif N =\'ABC\':\n print("ARC")\nelse:\n print("ABC")', 'N = input()\n\nif N == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s763918478', 's647322631'] | [8872.0, 8952.0] | [24.0, 23.0] | [65, 67] |
p02687 | u936985471 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['print(βABCβ if input()==βARCβ else βARCβ)', 'print("ARC" if input()=="ABC" else "ABC")'] | ['Runtime Error', 'Accepted'] | ['s310654363', 's199096618'] | [8880.0, 9080.0] | [25.0, 23.0] | [53, 41] |
p02687 | u941624042 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["\n\n\n# S = 'ABC'\n\nif S == 'ABC':\n print('ARC')\nelse:\n print('ABC')", "\n\n\n# S = 'ABC'\n\nS = input()\n\nif S == 'ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s832449072', 's630802300'] | [8864.0, 9028.0] | [25.0, 27.0] | [288, 301] |
p02687 | u942893435 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["print('ABC' if input()=='ARC' else 'ABC')", "print('ABC' if input()=='ARC' else 'ABC')\n", "print('ABC'if input()=='ABC'else'ARC')\n", "S = input()\nif S == 'ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s686904767', 's753689071', 's822942985', 's462332215'] | [9096.0, 8996.0, 9000.0, 8948.0] | [20.0, 22.0, 20.0, 19.0] | [41, 42, 39, 62] |
p02687 | u944886577 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['n,k=map(int,input().split())\nlist_a=[]\nfor d in range(k):\n d=int(input())\n a=list(map(int,input().split()))\n list_a.extend(a)\nprint(list_a)\nans=0\nfor i in range(1,n): \n if list_a.count(i)==0:\n ans+=1\nprint(ans)\n ', 'n,k=map(int,input().split())\nlist_a=[]\nfor d in range(k):\n d=int(input())\n a=list(map(int,input().split()))\n list_a.extend(a)\nans=0\nfor i in range(1,n): \n if list_a.count(i)==0:\n ans+=1\nprint(ans)', 'n=str(input())\nif str="ABC":\n print("ARC")\nelse:\n print("ABC")', 'n=str(input())\nif n="ABC":\n print("ARC")\nelse:\n print("ABC")', 'n,k=map(int,input().split())\nlist_a=[]\nfor d in range(k):\n d=int(input())\n a=list(map(int,input().split()))\n list_a.extend(a)\nans=0\nfor i in range(1,n): \n if list_a.count(i)==0:\n ans+=1\nprint(ans)\n ', 'n=str(input())\nif n=="ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s331487231', 's608033759', 's669428775', 's774283125', 's789263658', 's019936786'] | [9188.0, 9004.0, 8940.0, 8784.0, 8828.0, 9004.0] | [21.0, 24.0, 20.0, 27.0, 20.0, 25.0] | [226, 204, 64, 62, 212, 63] |
p02687 | u946026022 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['X = int(input())\n\nAA = 0\nBB = 0\n\nfor A in range(200):\n for B in range(200):\n if X == (A ** 5) - (B ** 5):\n AA = A\n BB = B\n\nif AA == 0 and BB == 0:\n for A in range(200):\n if X == (A ** 5) + 1:\n AA = A\n BB = -1\n\nprint(AA,BB)', "N = input()\n\nif N == 'ARC':\n print('ABC')\nelse:\n print('ARC')"] | ['Runtime Error', 'Accepted'] | ['s736961277', 's194476081'] | [9196.0, 9088.0] | [24.0, 22.0] | [286, 67] |
p02687 | u948050032 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["S = stdin.readline().rstrip()\n\nif S == 'ABC':\n print('ARC')\nelse:\n print('ABC')\n", "from sys import stdin\n\nS = stdin.readline().rstrip()\n\nif S == 'ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s833048027', 's890323164'] | [8960.0, 8972.0] | [24.0, 19.0] | [86, 108] |
p02687 | u952968889 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = input();print("ABC"*s==ARC or "ARC")', 's = input()\nif s[1] == "R":\n print("ABC")\nelse:\n print("ARC")'] | ['Runtime Error', 'Accepted'] | ['s369617028', 's274733379'] | [9084.0, 9028.0] | [20.0, 22.0] | [40, 63] |
p02687 | u953655640 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = str(input())\nif S = "ABC":\n print("ARC")\nelif S = "ARC":\n print("ABC")', 'S = str(input())\nif S == "ABC":\n print("ARC")\nelif S == "ARC":\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s038320517', 's938594349'] | [9016.0, 9092.0] | [22.0, 19.0] | [76, 78] |
p02687 | u957098479 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["#import math\nS=input()\n#int(input())\n#map(int,input().split())\n#list(map(int,input().split()))\n#[input() for _ in range()]\n\nif S[1] == B:\n print('ARC')\nelse:\n print('ABC')", "#import math\nS=input()\n#int(input())\n#map(int,input().split())\n#list(map(int,input().split()))\n#[input() for _ in range()]\n\nif S[1] == 'B':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s970590443', 's200782587'] | [9092.0, 9028.0] | [24.0, 23.0] | [177, 179] |
p02687 | u959203777 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = input("Input is given from Standard Input in the following format: ")\nif S == \'ABC\':\n print(\'ARC\')\nelse:\n print(\'ABC\')', 'S = input("")\nif S == \'ABC\':\n print(\'ARC\')\nelse:\n print(\'ABC\')'] | ['Wrong Answer', 'Accepted'] | ['s931502394', 's326422638'] | [8956.0, 9024.0] | [24.0, 19.0] | [128, 68] |
p02687 | u960570220 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = input()\n\nif S == "ABC":\n print("ABC")\n\nif S == "ARC":\n print("ARC")', 'S = input()\n\n\nif S == "ABC":\n print("ABC")\n\nelif S == "ARC":\n print("ARC")', "S = input()\n\nif S == 'ABC':\n print('ARC')\n\nelif S == 'ARC':\n print('ABC')\nelse:\n print('Mistake...')"] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s430502141', 's590489900', 's896570971'] | [8960.0, 9024.0, 8820.0] | [26.0, 29.0, 29.0] | [77, 80, 109] |
p02687 | u962356464 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["s = input()\nif s[1] == 'R':\n print('ARC')\nelif s[1] == 'B':\n print('ABC')", "s = input()\nif s[1] == 'R':\n print('ABC')\nelif s[1] == 'B':\n print('ARC')"] | ['Wrong Answer', 'Accepted'] | ['s007003507', 's322015237'] | [9092.0, 9032.0] | [23.0, 23.0] | [79, 79] |
p02687 | u962803758 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["If input() == 'ABC':\n print('ARC')\nelse:\n print('ABC')", "if input() == 'ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s387687576', 's029195482'] | [8860.0, 8944.0] | [23.0, 25.0] | [56, 56] |
p02687 | u965397031 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["s = input()\nif s = 'ABC':\n print('ARC')\nelse:\n print('ABC')", "s = input()\nif s == 'ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s548488936', 's046923478'] | [8860.0, 9016.0] | [19.0, 29.0] | [65, 66] |
p02687 | u969081133 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["S=int()\na='ABC'\nif S==a:\n print('ARC')\nelse:\n print('ABC')", "S=int()\nif S=='ABC':\n print('ARC')\nelse:\n print('ABC')", "S=str(int())\na='ABC'\nif S==a:\n print('ARC')\nelse:\n print('ABC')", "S=input()\nif S==('ABC'):\n print('ARC')\nelse:\n print('ABC')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s032381227', 's201174555', 's951948218', 's985678776'] | [8940.0, 9064.0, 8952.0, 8992.0] | [24.0, 25.0, 29.0, 24.0] | [60, 56, 65, 60] |
p02687 | u970937288 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | [']\nprint("ABC")if s=="R" else print("ARC")', 's=input()[1]\nprint("ABC")if s=="R" else print("ARC")'] | ['Runtime Error', 'Accepted'] | ['s603853387', 's146593194'] | [8940.0, 9028.0] | [19.0, 22.0] | [41, 52] |
p02687 | u974935538 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['S = input()\nif S is "ABC":\n print("ARC)\nelse:print("ABC")', 'S=input()\nif S == "ABC":print("ARC")\nelse : print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s223009108', 's398801181'] | [8856.0, 8868.0] | [24.0, 25.0] | [58, 56] |
p02687 | u975445930 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['def make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n//i)\n\n \n return divisors\nx = int(input())\ndiv = make_divisors(x)\n\nif x == 1: print("0 -1")\n\nfor i in range(len(div)//2):\n u = div[i*2]\n if len(div)%2 == 1: v = div[i*2]\n else: v = div[i*2+1]\n t = int(v**(1/2))\n for j in range(t):\n a = j\n b = j-u\n if a**4 + (a**3)*b +(a**2)*(b**2) + a*(b**3) + b**4 == v:\n print(a, b)\n break', "s = input()\nif s == 'ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s427210073', 's757820915'] | [9152.0, 8956.0] | [24.0, 24.0] | [598, 62] |
p02687 | u977193988 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\nsys.setrecursionlimit(20000000)\n\n\ndef main():\n S = input()\n if S == "ARC":\n print("ABC")\n else:\n print("ABC")\n\n\nif __name__ == "__main__":\n main()\n', 'import sys\n\n\ndef input():\n return sys.stdin.readline().strip()\n\n\nsys.setrecursionlimit(20000000)\n\n\ndef main():\n S = input()\n if S == "ARC":\n print("ABC")\n else:\n print("ARC")\n\n\nif __name__ == "__main__":\n main()\n'] | ['Wrong Answer', 'Accepted'] | ['s204439765', 's736909977'] | [9092.0, 9028.0] | [20.0, 23.0] | [241, 241] |
p02687 | u977601817 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['if S == "ABC":\n print("ARC")\nelse:\n print("ABC")', '#OutPut\nif S == "ABC":\n print("ARC")\nelse S == "ARC":\n print("ABC")', 'if S == "ABC":\n print("ARC")\nelse S == "ARC":\n print("ABC")', 'S = input()\n\nif S == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s765362653', 's865242363', 's998088513', 's342795356'] | [8900.0, 8944.0, 8936.0, 9028.0] | [22.0, 21.0, 23.0, 20.0] | [54, 73, 65, 67] |
p02687 | u980205854 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["# A - A?C\nS = int(input())\nif S=='ABC':\n print('ARC')\nelse:\n print('ABC')", "# A - A?C\nS = input()\nif S=='ABC':\n print('ARC')\nelse:\n print('ABC')"] | ['Runtime Error', 'Accepted'] | ['s779981413', 's939665640'] | [8940.0, 9024.0] | [26.0, 25.0] | [79, 74] |
p02687 | u981264846 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["input = input()\n\nif input = 'ABC':\n return 'ARC'\nelse:\n return 'ABC'", "inputStr = input()\n\nif inputStr == 'ABC':\n print('ARC')\nelse if inputStr == 'ARC':\n print('ABC')\nelse:\n print('')", "inputStr = input()\n\nif inputStr == 'ABC':\n return 'ARC'\nelse if inputStr == 'ARC':\n return 'ABC'\nelse:\n return null\n", "inputStr = input()\n\nif inputStr == 'ABC':\n\tprint('ARC')\nelse if inputStr == 'ARC':\n print('ABC')\nelse:\n\tprint('')", "inputStr = input()\n\nif inputStr == 'ABC':\n \tprint('ARC')\nelse:\n\tprint('ABC')"] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s034132683', 's265598913', 's483001434', 's521104205', 's327946113'] | [8884.0, 9008.0, 8868.0, 9008.0, 9088.0] | [21.0, 22.0, 22.0, 20.0, 21.0] | [70, 116, 119, 116, 76] |
p02687 | u985963315 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['last = input()\nif input[1] == "B":\n print("ARC")\nelse:\n print("ABC")', 'S = input()\nif S[1] == "B":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s810080135', 's765959368'] | [9036.0, 9004.0] | [24.0, 23.0] | [70, 63] |
p02687 | u989947733 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = input()\nif s == "ABC": print("ARC")\nelse print("ABC")', 's = input()\nif s == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s650157724', 's996219068'] | [8820.0, 9024.0] | [24.0, 25.0] | [57, 62] |
p02687 | u995163736 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['N, K = (int(i) for i in input().split())\nH = list(map(int,input().split()))\nans = [1]*N\nfor m in range(M):\n a, b = (int(i) for i in input().split())\n if H[a-1] <= H[b-1]:\n ans[a-1] = 0\n elif H[a-1] > H[b-1]:\n ans[b-1] = 0\nprint(ans.count(1))', 'N, M = (int(i) for i in input().split())\nH = list(map(int,input().split()))\nans = [1]*N\nfor m in range(M):\n a, b = (int(i) for i in input().split())\n if H[a-1] <= H[b-1]:\n ans[a-1] = 0\n elif H[a-1] > H[b-1]:\n ans[b-1] = 0\nprint(ans.count(1))', 'n = input()\nif n == "ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s078003695', 's102564922', 's621461116'] | [9196.0, 9136.0, 9060.0] | [24.0, 21.0, 22.0] | [250, 250, 62] |
p02687 | u995914787 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s=str(input())\nif s=="ABC":\n print(βARCβ)\nelse:\n print(βABCβ)', 's=str(input())\nif s=="ABC":\n print("ARC")\nelse:\n print("ABC")'] | ['Runtime Error', 'Accepted'] | ['s906433098', 's269231495'] | [8864.0, 9092.0] | [23.0, 20.0] | [71, 63] |
p02687 | u996665352 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['import sys\nimport itertools\nX = int(input())\nN = 120\nABs = []\nfor i in range(N):\n ABs.append(i**5)\n \nfor i in range(N):\n for j in range(N):\n if ABs[i]-ABs[j] == X:\n print(i,j)\n sys.exit()\n elif ABs[i]+ABs[j] == X:\n print(i,-j)\n sys.exit()', 's = input()\nprint("ARC" if input()=="ABC" else "ABC")', 's = input()\nprint("ABC" if s== "ARC" else "ARC")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s814469534', 's899170702', 's606997382'] | [9200.0, 9024.0, 8900.0] | [21.0, 21.0, 22.0] | [305, 53, 48] |
p02687 | u998272944 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ['s = raw_input()\nprint({"ARC":"ABC", "ABC":"ARC"}[s])', 's = input()\nd = {"ABC":"ARC", "ARC":"ABC"}\nprint(d[s])'] | ['Runtime Error', 'Accepted'] | ['s442846831', 's423582972'] | [9004.0, 9020.0] | [21.0, 21.0] | [52, 54] |
p02687 | u998867748 | 2,000 | 1,048,576 | AtCoder Inc. holds a contest every Saturday. There are two types of contests called ABC and ARC, and just one of them is held at a time. The company holds these two types of contests alternately: an ARC follows an ABC and vice versa. Given a string S representing the type of the contest held last week, print the string representing the type of the contest held this week. | ["s = input()\nif s = 'ABC':\n\tprint('ARC')\nelif s = 'ARC':\n\tprint('ABC')", "s = input()\n\nif s = 'ABC':\n print('ARC')\nelif s = 'ARC':\n print('ABC')", "s = input()\nif s == 'ABC':\n print('ARC')\nelif s == 'ARC':\n print('ABC')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s263158998', 's924660329', 's475038005'] | [8880.0, 8944.0, 8924.0] | [21.0, 22.0, 20.0] | [69, 72, 73] |
p02688 | u000085263 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = map(int, input().split())\nlist = [0]*N\nfor _ in range(K):\n d = int(input()) \n l2= list(map(int, input().split()))\n print(l2)\n for val in l2:\n list[val-1] = 1\nprint(N-sum(list))', 'N, K = map(int, input().split())\nl1 = [0]*N\nfor _ in range(K):\n d = int(input()) \n l2= list(map(int, input().split()))\n for val in l2:\n l1[val-1] = 1\nprint(N-sum(l1))\n'] | ['Runtime Error', 'Accepted'] | ['s591008420', 's355885529'] | [9076.0, 9088.0] | [20.0, 26.0] | [202, 183] |
p02688 | u011202375 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N,K=map(int,input().split())\nM=[]\ni=0\nfor a in range(K*2):\n \n M= list(map(int, input().split()))\nfor b in range(1,N+1):\n if b not in M:\n i+=1\nprint(i)', 'N,K=map(int,input().split())\n\ni=0\nA=[]\nfor a in range(K):\n M=[]\n P=input()\n M= list(map(int, input().split()))\n A=A+M\nfor b in range(1,N+1):\n if b not in A:\n i+=1\n\nprint(i)'] | ['Wrong Answer', 'Accepted'] | ['s791304630', 's336496492'] | [9100.0, 9084.0] | [29.0, 27.0] | [165, 194] |
p02688 | u013202780 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k=map(int,input().split())\nans=[None]*n\nwhile k>0:\n d=input()\n a=list(map(int,input().split()))\n #print (d,a)\n for i in a:\n ans[i-1]=d\n k-=1\ncount=0\nfor item in ans:\n if item==None:\n count+=1\nprint (count)a', 'n,k=map(int,input().split())\nans=[None]*n\nwhile k>0:\n d=input()\n a=list(map(int,input().split()))\n #print (d,a)\n for i in a:\n ans[i-1]=d\n k-=1\ncount=0\nfor item in ans:\n if item==None:\n count+=1\nprint (count)'] | ['Runtime Error', 'Accepted'] | ['s494284702', 's839253592'] | [9052.0, 9184.0] | [25.0, 24.0] | [220, 219] |
p02688 | u025879810 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ["import numpy as np\nn, k = input().split(' ')\ndds = []\naas = []\nfor i in range(int(k)):\n dds.append(int(input()))\n aas.append(list(map(lambda x: int(x), input().split(' '))))\n \n\nuni = len(np.unique(np.array(aas).flatten()))\n\nprint(int(n) - uni)", "import numpy as np\nn, k = list(map(lambda x: int(x), input().split(' ')))\nsu = list(range(1, n+1))\nfor i in range(int(k)):\n input()\n tmp = list(map(lambda x: int(x), input().split(' ')))\n for j in tmp:\n if j in su:\n su.remove(j)\n \n\nprint(len(su))"] | ['Wrong Answer', 'Accepted'] | ['s364998742', 's038221080'] | [27248.0, 27152.0] | [113.0, 106.0] | [246, 258] |
p02688 | u029785897 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = map(int, input().split())\n\nsnukes = [0] * N\nfor i in range(K):\n d_i = int(input()) # throw away\n a_i = map(int, input().split())\n for a in a_i:\n snukes[a] += 1\n\ncounter = 0\nfor i in range(N):\n if snukes[i] == 0:\n counter += 1\n\nprint(counter)', 'N, K = map(int, input().split())\n \nsnukes = [0] * N\nfor i in range(K):\n d_i = int(input()) # throw away\n a_i = map(int, input().split())\n for a in a_i:\n snukes[a-1] += 1\n \ncounter = 0\nfor i in range(N):\n if snukes[i] == 0:\n counter += 1\n \nprint(counter)'] | ['Runtime Error', 'Accepted'] | ['s162389126', 's923122705'] | [9004.0, 9168.0] | [21.0, 25.0] | [258, 263] |
p02688 | u037754315 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n, k = map(int, input().split())\na = [x*0 for x in range(n)]\ncount = 0\n\nfor i in range(k):\n d = int(input())\n A = list(map(int, input().split()))\n for j in range(d):\n a[A[j]-1] += 1\n print(a)\n \nfor t in range(n):\n if a[t] == 0:\n count += 1\n\nprint(count)', 'n, k = map(int, input().split())\na = [x*0 for x in range(n)]\ncount = 0\n\nfor i in range(k):\n d = int(input())\n A = list(map(int, input().split()))\n for j in range(d):\n a[A[j]-1] += 1\n \nfor t in range(n):\n if a[t] == 0:\n count += 1\n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s526693016', 's580688061'] | [9204.0, 9180.0] | [31.0, 29.0] | [285, 272] |
p02688 | u042113240 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = int(input().split())\nSunuke = set(range(N))\nfor i in range(K):\n d = int(input())\n X = list(map(int, input().split()))\n for x in X:\n Sunuke.discard(x-1)\nprint(len(Sunuke))', 'N, K = input().split()\nN = int(N)\nK = int(K)\nSunuke = set(range(N))\nfor i in range(K):\n d = int(input())\n X = list(map(int, input().split()))\n for x in X:\n Sunuke.discard(x-1)\nprint(len(Sunuke))'] | ['Runtime Error', 'Accepted'] | ['s996236859', 's974151756'] | [9112.0, 9184.0] | [21.0, 24.0] | [183, 200] |
p02688 | u042209706 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int, input().split())\nflag = [1 for i in range(n)]\nfor _ in range(k):\n d = int(input())\n for _ in range(d):\n for a in map(int, input().split()):\n flag[a-1] = 0\nprint(sum(flag))', 'n,k = map(int, input().split())\nfor k in range(k):\n\td = int(input())\n\tfor d in range(d):\n a.append({int(x) for x in input().split()})\n n = array_diff(n,a)\nprint(len(n))', 'n,k = map(int, input().split())\nfor k in range(k):\n\td = input()\n\tfor d in range(d):\n a = input()\n n = array_diff(n,d)\nprint(n)', 'n,k = map(int, input().split())\nfor k in range(k+1):\n\tfor d in range(n):\n a = list(map(int, input().split()))\n n = array_diff(n,a)\nprint(n)', 'n,k = map(int, input().split())\nfor k in range(k):\n\td = int(input())\n\tfor d in range(d):\n a.append({int(x) for x in input().split()})\n n = array_diff(n,a)\nprint(n)', 'n,k = map(int, input().split())\nfor k in range(k):\n\tfor n in range(n):\n a = list(map(int, input().split()))\n n = array_diff(n,a)\nprint(n)', 'n,k = map(int, input().split())\nflag = [1 for i in range(n)]\nfor _ in range(k):\n d = int(input())\n for a in map(int, input().split()):\n flag[a-1] = 0\nprint(sum(flag))'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s090466490', 's365966979', 's383411735', 's515830652', 's787712263', 's883454779', 's948906747'] | [8988.0, 8936.0, 8916.0, 8932.0, 8944.0, 8928.0, 9064.0] | [22.0, 20.0, 23.0, 21.0, 23.0, 21.0, 24.0] | [196, 174, 134, 149, 169, 147, 173] |
p02688 | u045953894 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = list(map(int,input().strip().split()))\ntemp = []\nans = int(0)\nfor i in range(k+1):\n d = int(input())\n li = list(map(int,input().split()))\n for j in range(d):\n temp += str(li[j])\nfor m in range(n+1):\n b = str(m + 1)\n a = temp.count(b)\n if a == 0:\n ans += 1\nprint(ans)\n', 'n,k = map(int,input().split())\nperson = [0]*n\nfor i in range(k):\n d = int(input())\n A = list(map(int,input().split()))\n for j in range(len(A)):\n person[A[j]-1] = 1\nprint(person.count(0))\n\n'] | ['Runtime Error', 'Accepted'] | ['s720421994', 's085295066'] | [9092.0, 9020.0] | [22.0, 31.0] | [306, 204] |
p02688 | u047719604 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int,input().split())\nlst = []\nfor _ in range(k):\n d = int(input())\n lstx = [int(input()) for _ in range(d)]\n lst += lstx\nsetans = set(lst)\nprint(n - len(setans))', 'n,k = map(int,input().split())\nlst = []\nfor _ in range(k):\n d = int(input())\n lstx = list(map(int,input().split()))\n lst += lstx\nsetans = set(lst)\nprint(n - len(setans))'] | ['Runtime Error', 'Accepted'] | ['s689407331', 's937776090'] | [9080.0, 9172.0] | [23.0, 21.0] | [174, 172] |
p02688 | u050622763 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['\nn,k= list(map(int,input().split()))\n\n\nl = [0 for i in range(n+1)]\n\nfor i in range(k):\n d = int(input())\n m = list(map(int,input().split()))\n for j in range(d):\n l[m[j]] = 1\n\n\nprint(l[1:].count(1))\n', 'n,k= list(map(int,input().split()))\nl = [0 for i in range(n+1)]\n \nfor i in range(k):\n d = int(input())\n m = list(map(int,input().split()))\n for j in range(d):\n l[m[j]] = 1\n \n \nprint(l[1:].count(0))'] | ['Wrong Answer', 'Accepted'] | ['s187408013', 's007034499'] | [9184.0, 9192.0] | [20.0, 21.0] | [214, 213] |
p02688 | u054825571 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N,K=map(int,input().split())\ns={i+1 for i in range(N)}\nt={}\nfor i in range(K):\n input()\n t|=set(map(int,input().split()))\nprint(len(s-t))', 'N,K=map(int,input().split())\ns={i+1 for i in range(N)}\nt=set()\nfor i in range(K):\n input()\n t|=set(map(int,input().split()))\nprint(len(s-t))'] | ['Runtime Error', 'Accepted'] | ['s627016792', 's405675188'] | [9180.0, 9144.0] | [24.0, 28.0] | [139, 142] |
p02688 | u054931633 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int,input().split())\nimport itertools\n\ngrid = []\nfor i in range(2*k):\n array = list(map(int, input().strip().split()))\n grid.append(array)\nprint(grid)\nl = []\nfor j in range (k):\n l.append(grid[0+2*j+1])\nprint(l)\nlis = list(itertools.chain.from_iterable(l))\nprint(lis)\ncount = 0\nfor m in range(n):\n if m+1 in lis:\n count = count +1\nprint(n - count)', 'n,k = map(int,input().split())\nimport itertools\n\ngrid = []\nfor i in range(2*k):\n array = list(map(int, input().strip().split()))\n grid.append(array)\nfor j in range (k):\n l.append(grid[0+2*j+1])\nlis = list(itertools.chain.from_iterable(l))\ncount = 0\nfor m in range(n):\n if m+1 in lis:\n count = count +1\nprint(n - count)', 'n,k = map(int,input().split())\nimport itertools\n\ngrid = []\nfor i in range(2*k):\n array = list(map(int, input().strip().split()))\n grid.append(array)\nprint(grid)\nl = []\nfor j in range (k):\n l.append(grid[0+2*j+1])\nprint(l)\nlis = itertools.chain.from_iterable(l)\nprint(list(itertools.chain.from_iterable(l)))\ncount = 0\nfor m in range(n):\n if m+1 in lis:\n count = count +1\nprint(n - count - 1)', 'n,k = map(int,input().split())\nimport itertools\n\ngrid = []\nfor i in range(2*k):\n array = list(map(int, input().split()))\n grid.append(array)\n\nl = []\nfor j in range (k):\n l.append(grid[0+2*j+1])\n\nlis = list(itertools.chain.from_iterable(l))\n\ncount = 0\nfor m in range(n):\n if m+1 in lis:\n count = count +1\nprint(n - count)'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s052999777', 's070872935', 's330095537', 's666140248'] | [9244.0, 9240.0, 9228.0, 9076.0] | [22.0, 23.0, 24.0, 24.0] | [376, 337, 409, 339] |
p02688 | u055244973 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ["N, K = map(int, input().split())\n\nsunuke_list = []\nfor i in range(K):\n input()\n okashi_sunukes = map(int, input().split())\n for okashi_sunuke in okashi_sunukes:\n sunuke_list.insert(okashi_sunuke, '')\n\nprint(N - len(sunuke_list))", "N, K = map(int, input().split())\n\nsunuke_dict = {}\nfor i in range(K):\n input()\n okashi_sunukes = map(int, input().split())\n for okashi_sunuke in okashi_sunukes:\n sunuke_dict[okashi_sunuke] = ''\n\nprint(N - len(sunuke_dict))"] | ['Wrong Answer', 'Accepted'] | ['s719504892', 's556898001'] | [9140.0, 9148.0] | [39.0, 22.0] | [244, 238] |
p02688 | u058496530 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = input().split()\nd = []\nx2 = []\ncount = 0\nfor i in range(0, int(N)):\n x2.append(0)\nfor i in range(0, int(K)):\n d = int(input())\n x = input().split()\n for j in x:\n if x2[int(j)-1] == 0:\n x2[int(j)-1] = 1\n count += 1\nprint(count)', 'N, K = input().split()\nd = []\nx2 = []\ncount = 0\nfor i in range(0, int(N)):\n x2.append(0)\nfor i in range(0, int(K)):\n d = int(input())\n x = input().split()\n for j in x:\n if x2[int(j)-1] == 0:\n x2[int(j)-1] = 1\n count += 1\nprint(int(N)-count)'] | ['Wrong Answer', 'Accepted'] | ['s491427306', 's881729759'] | [9196.0, 9200.0] | [22.0, 22.0] | [250, 257] |
p02688 | u062808720 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ["n, k = map(int, input().split())\n\nsunuke = [[0] * (n+2)] * (k+2)\nans = 0\nfor j in range(1, k+1) :\n num_have_okashi = int(input())\n oakshi_sunuke = list(map(int,input().split()))\n\n for i in oakshi_sunuke :\n sunuke[i][j] = 1\n print('num_have_okashi = [%d]' % (num_have_okashi))\n print(oakshi_sunuke)\n print('sunuke[%d][%d] = %d' % (i, j, sunuke[i][j]))\n ans = ans + 1\n break\n\nprint(n-ans)\n", 'num_sunuke, num_okashi_kind = map(int, input().split())\nsunuke = [0] * (num_sunuke+1)\n\nans = 0\nfor idx_okashi_kind in range(1, num_okashi_kind+1) :\n num_have_okashi = int(input())\n idx_sunuke_with_okashi = map(int,input().split())\n\n for i in range(1, num_have_okashi+1) :\n for j in idx_sunuke_with_okashi :\n sunuke[j] = 1\n\nfor s in sunuke :\n if s == 1 :\n ans = ans + 1\n\nprint(num_sunuke - ans)\n'] | ['Runtime Error', 'Accepted'] | ['s450948950', 's625746428'] | [9204.0, 9204.0] | [25.0, 23.0] | [438, 431] |
p02688 | u063346608 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['for okashi_number in range(k):\n\tdi = int(input())\n\tD = map(int,input().split())\n\tfor x in range(di)\n\t\tA[[x]-1] = 1\n\nfor i in range(N):\n\tif A[i] == 0:\n\tprint(A[i])\n', 'N,K = map(int,input().split())\n\nokasi = [0] * (N + 1)\nfor i in range(K):\n\td = int(input())\n\tA = list(map(int,input().split()))\n\tfor j in range(d):\n\t\tokasi[A[j]] = 1\nprint(okasi)\n\ncount = 0\nfor i in range(1,N +1,1):\n\tif okasi[i] != 1:\n\t\tcount = count + 1\nprint(count)', 'N,K = map(int,input().split())\n\nokasi = [0] * (N + 1)\nfor i in range(K):\n\td = int(input())\n\tA = list(map(int,input().split()))\n\tfor j in range(d):\n\t\tokasi[A[j]] = 1\n#print(okasi)\n\ncount = 0\nfor i in range(1,N +1,1):\n\tif okasi != 1:\n\t\tcount = count + 1\nprint(count)', 'N,K = map(int,input().split())\n\nokasi = [0] * (N + 1)\nfor i in range(K):\n\td = int(input())\n\tA = list(map(int,input().split()))\n\tfor j in range(d):\n\t\tokasi[A[j]] = 1\n#print(okasi)\n\ncount = 0\nfor i in range(1,N +1,1):\n\tif okasi[i] != 1:\n\t\tcount = count + 1\nprint(count)'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s433261712', 's539756489', 's668367362', 's699071433'] | [8876.0, 9200.0, 9132.0, 9120.0] | [25.0, 27.0, 30.0, 31.0] | [163, 266, 264, 267] |
p02688 | u069273180 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k=map(int,input().split())\nkashi = [0] * n\ncnt = 0\nM = 0\nfor s in range(n):\n\ti=int(input())\n\tli=list(map(int,input().split()))\n\tif i > 0:\n\t\tfor m in li:\n\t\t\tkashi[m-1] +=1\n\nfor i in kashi:\n\tif i == 0:\n\t\tcnt += 1\n\nprint(cnt)\n ', 'n,k=map(int,input().split())\nkashi = [0] * n\ncnt = 0\nM = 0\nfor s in range(n):\n\ti=int(input())\n\tli=list(map(int,input().split()))\n\tfor m in li:\n\t\tkashi[m-1] +=1\n\nfor i in kashi:\n\tif i == 0:\n\t\tcnt += 1\n\nprint(cnt)\n ', 'n,k=map(int,input().split())\nkashi = [0] * n\ncnt = 0\nM = 0\nfor s in range(k):\n\ti=int(input())\n\tli=list(map(int,input().split()))\n\tif i > 0:\n\t\tfor m in li:\n\t\t\tkashi[m-1] +=1\n\nfor i in kashi:\n\tif i == 0:\n\t\tcnt += 1\n\nprint(cnt)\n '] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s109031850', 's630596283', 's023568515'] | [9232.0, 9188.0, 9188.0] | [24.0, 24.0, 22.0] | [229, 216, 229] |
p02688 | u070379349 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = map(int, input().split())\nd = [0] * K\nA = [0] * K\nfor i in range (K):\n\td[i] = map ( int, input() .split())\n\tA[i] = list(map(int, input().strip().split())) \n\nfor j in range (K):\n UKE = list ( set(list(range(N))) - set(A[j]) )\n\nprint ( len(UKE) )', 'N, K = map(int, input().split())\nd = [0] * K\nA = [0] * K\nfor i in range (K):\n\td[i] = map ( int, input() .split())\n\tA[i] = list(map(int, input().strip().split())) \n\nS = [False] * N\n\nfor i in range (K):\n\tfor j in A[i]:\n\t\tS[j-1] = True\n\nprint (S.count(False))\n\t'] | ['Wrong Answer', 'Accepted'] | ['s127242998', 's897313376'] | [9184.0, 9220.0] | [27.0, 24.0] | [254, 258] |
p02688 | u072606168 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int, input().split())\ns = []\nfor i in range(k):\n d = int(input())\n a = list(map(int, input()))\n s += a\nprint(n-len(set(s)))\n ', 'n,k = map(int, input().split())\ns = []\nfor i in range(k):\n d = int(input())\n a = list(map(int, input().split()))\n s += a\nprint(n-len(set(s)))\n '] | ['Runtime Error', 'Accepted'] | ['s436331799', 's621026772'] | [9184.0, 9156.0] | [22.0, 23.0] | [139, 147] |
p02688 | u080017818 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['s = []\nn, k = map(int, input().split())\nfor i in range(n):\n\ts.append(0)\nfor i in range(k):\n\tm = int(input())\n na = list(map(int, input().split())\n for j in na:\n \ts[j - 1] = 1\n \nprint(s.count(0))\n ', 's = []\nn, k = map(int, input().split())\nfor i in range(n):\n s.append(0)\nfor i in range(k):\n\tm = int(input())\n na = list(map(int, input().split())\n for j in na:\n \ts[j - 1] = 1\n \nprint(s.count(0))\n ', 's = []\nn, k = map(int, input().split())\nfor i in range(n):\n s.append(0)\nfor i in range(k):\n m = int(input())\n na = list(map(int, input().split()))\n for j in na:\n s[j - 1] = 1\n \nprint(s.count(0))\n \n '] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s418906984', 's467203100', 's178195974'] | [8996.0, 8924.0, 9132.0] | [22.0, 22.0, 25.0] | [220, 221, 235] |
p02688 | u081365646 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int,input().split())\nList = [list(map(int, input().split())) for i in range(2*k)]\nList_a = []\nfor x in range(1,2*k,2):\n for i in List[x]:\n List_a.append(i)\n\nList_a =set(List_a)\nprint(List_a)\nprint(n-len(List_a))', 'n,k = map(int,input().split())\nList = [list(map(int, input().split())) for i in range(2*k)]\nList_a = []\nfor x in range(1,2*k,2):\n for i in List[x]:\n List_a.append(i)\n\nList_a =set(List_a)\nprint(n-len(List_a))'] | ['Wrong Answer', 'Accepted'] | ['s325619894', 's025253863'] | [9360.0, 9204.0] | [23.0, 21.0] | [231, 217] |
p02688 | u084327817 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n, k = map(int, input().split())\n\n\ntemp_array = []\n\nfor _ in range(k):\n temp = input()\n [temp_array.append(i) for i in list(map(int, input().split()))]\n\nall_member = len(list(set(temp_array)))\nprint(k - all_member)', 'n, k = map(int, input().split())\n\ntemp_array = []\n\nfor _ in range(k):\n temp = input()\n [temp_array.append(i) for i in list(map(int, input().split())) if i != ""]\n\nall_member = len(list(set(temp_array)))\nprint(n - all_member)'] | ['Wrong Answer', 'Accepted'] | ['s478665474', 's848930083'] | [9068.0, 9092.0] | [22.0, 22.0] | [216, 226] |
p02688 | u086127549 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n, k = map(int, input().split())\nsunuke = [1 for _ in range(n)]\nfor _ in range(k):\n d = int(input())\n for x in list(map(int, input().split()):\n sunuke[x-1] = 0\nprint(sum(sunuke))', 'n, k = map(int, input().split())\nsunuke = [1 for _ in range(n)]\nfor _ in range(k):\n d = int(input())\n for x in list(map(int, input().split())):\n sunuke[x-1] = 0\nprint(sum(sunuke))\n'] | ['Runtime Error', 'Accepted'] | ['s629426431', 's115835050'] | [8968.0, 9164.0] | [22.0, 24.0] | [183, 185] |
p02688 | u086624329 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N,K=map(int,input().split())\n\nsunuke_list=[i+1 for i in range(N)]\n\nfor i in range(K):\n d=int(input())\n a=list(map(int,input().split()))\n b=set(sunuke_list)-set(a)\n sunuke_list=list(b)\n print(sunuke_list)\n \nprint(len(sunuke_list))', 'N,K=map(int,input().split())\n\nsunuke_list=[i+1 for i in range(N)]\n\nfor i in range(K):\n d=int(input())\n a=list(map(int,input().split()))\n b=set(sunuke_list)-set(a)\n sunuke_list=list(b)\n \nprint(len(sunuke_list))'] | ['Wrong Answer', 'Accepted'] | ['s596963392', 's324450198'] | [9204.0, 9128.0] | [22.0, 22.0] | [247, 224] |
p02688 | u094999522 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int, input().split())\na = set()\nfor i in [0]*k:\n _ = input()\n a.add(*map(int, input().split()))\n print(a)\nprint(n - len(a))', 'n,k = map(int, input().split())\na = set()\nfor i in [0]*k:\n _ = input()\n a.add(*map(int, input().split()))\nprint(n - len(a))', 'n,k = map(int, input().split())\na = set()\nfor i in [0]*k:\n _ = input()\n a = a | set([*map(int, input().split())])\nprint(n - len(a))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s027571768', 's717204409', 's867744484'] | [9204.0, 9176.0, 9184.0] | [23.0, 23.0, 22.0] | [142, 129, 137] |
p02688 | u095384238 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['import numpy as np\nN, K = map(int, input().split())\n\nA = []\nfor i in range(K):\n d = int(input())\n temp = list(map(int, input().split()))\n A = A + temp\n\nhito = np.ones(N)\nfor i in range(len(A)):\n hito[A[i]] = 0\nprint(int(np.sum(hito)))', 'import numpy as np\n\nN, K = map(int, input().split())\nA = []\nfor i in range(K):\n d = int(input())\n temp = list(map(int, input().split()))\n A = A + temp\nhito = np.ones(N)\nfor i in range(len(A)):\n hito[A[i]] = 0\nprint(int(np.sum(hito)))', 'import numpy as np\n\nN, K = map(int, input().split())\nA = []\nfor i in range(K):\n d = int(input())\n temp = list(map(int, input().split()))\n A = A + temp\nhito = np.ones(N)\nfor i in range(len(A)):\n hito[A[i]-1] = 0\nprint(int(np.sum(hito)))\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s453259844', 's849915712', 's094565447'] | [27028.0, 27160.0, 27188.0] | [103.0, 104.0, 109.0] | [246, 245, 248] |
p02688 | u095766340 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['import itertools^M\nN,K = list(map(int, input().split(" ")))^M\nA = list(itertools.chain.from_iterable([input().split(" ") for i in range(K) if input().split(" ")]))^M\nA = list(map(int, A))\nnone = [a for a in range(1, K + 1) if a not in A]\nprint(len(none))', 'import itertools\n\ninp2intlist = lambda inp:list(map(int,inp))\n\nN,K = list(map(int, input().split(" ")))\nA = list(itertools.chain.from_iterable([inp2intlist(input().split()) for i in range(K) if input().split()]))\n\nprint(N - len(set(A)))'] | ['Runtime Error', 'Accepted'] | ['s776468369', 's077528275'] | [8888.0, 9304.0] | [20.0, 24.0] | [255, 237] |
p02688 | u099814049 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n, k = list(map(int, input().split()))\nd = []\nfor _ in range(k):\n x = int(input())\n y = int(map(int, input().split()))\n for i in y:\n d.append(i)\n\nd = set(d)\nd = list(d)\nprint(n - len(d))\n ', 'n, k = list(map(int, input().split()))\nd = []\nfor _ in range(k):\n x = int(input())\n y = list(map(int, input().split()))\n for i in y:\n d.append(i)\n\nd = set(d)\nd = list(d)\nprint(n - len(d))\n'] | ['Runtime Error', 'Accepted'] | ['s059810673', 's231493179'] | [9176.0, 9192.0] | [19.0, 22.0] | [195, 204] |
p02688 | u100572972 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n,k = map(int,input().split())\n\na_list =[]\nfor i in range(k):\n d = int(input())\n a = list(map(int,input().split()))\n a_list = a_list + a\n\nt = 0\nfor i in range(1,n+1):\n if i in a_list:\n t += 1\nprint(t)', 'n,k = map(int,input().split())\n\na_list =[]\nfor i in range(k):\n d = int(input())\n a = list(map(int,input().split()))\n a_list = a_list + a\n\nt = 0\nfor i in range(1,n+1):\n if i in a_list:\n t += 1\nprint(n-t)'] | ['Wrong Answer', 'Accepted'] | ['s836886278', 's148183036'] | [9172.0, 9188.0] | [22.0, 25.0] | [219, 221] |
p02688 | u106954338 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N , K= map(int, input().split())\nd = int(input())\nA = list(map(int,input().split()))\ndk = [int(input()) for ia in range(K)]\nAk = list(map(int, input().split()))\n\nprint(N - d)\n', 'import collections\nN , K= map(int, input().split())\nc = 0\nA =[]\nfor ia in range(K):\n d = int(input())\n A.extend(list(map(int, input().split())))\n\nsa = collections.Counter(A)\nsss = len(sa)\nprint(N-sss)\n \n\n'] | ['Runtime Error', 'Accepted'] | ['s798745153', 's052166720'] | [9192.0, 9468.0] | [24.0, 25.0] | [175, 213] |
p02688 | u111652094 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N,K=map(int,input().split())\n\nd=0\nA=[]\nfor i in range(K):\n d=int(input())\n A.append(map(int,input().split()))\n\nA=list(set(A))\nans=N\n\nfor k in range(1,N+1):\n if k in A:\n ans=ans-1\nprint(ans) ', 'N,K=map(int,input().split())\n\nN_list=list(range(1,N+1))\nans=N\nfor i in range(K):\n d=int(input())\n A=list(map(int,input().split()))\n for j in A:\n if j in N_list:\n ans=ans-1\n N_list.remove(j)\n \n\nprint(len(N_list))'] | ['Wrong Answer', 'Accepted'] | ['s814028569', 's801507092'] | [9616.0, 9196.0] | [22.0, 23.0] | [209, 252] |
p02688 | u115877451 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['a,b=map(int,input().split())\nc=int(input())\nd=list(map(int,input().split()))\ne=[input() for _ in range(b)]\nf=list(map(int,input().split()))\n\nprint(a-c)', 'import itertools\na,b=map(int,input().split())\nc=[]\nfor i in range(1,b*2+1):\n c.append(list(map(int,input().split())))\nn=c[1::2]\nn=list(itertools.chain.from_iterable(n))\nprint(a-len(set(n)))'] | ['Runtime Error', 'Accepted'] | ['s544724925', 's671010128'] | [9180.0, 9052.0] | [21.0, 23.0] | [151, 192] |
p02688 | u119012830 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n, k = map(int, input().split())\nans = []\nfor _ in range(k):\n d = list(int(input()))\n a = list(map(int, input().split()))\n ans += a\nprint(n-len(set(ans)))', 'n, k = map(int, input().split())\nans = []\nfor _ in range(k):\n d = int(input())\n a = list(map(int, input().split()))\n ans += a\nprint(n-len(set(ans)))\n'] | ['Runtime Error', 'Accepted'] | ['s066203705', 's235401191'] | [9156.0, 9172.0] | [21.0, 21.0] | [163, 158] |
p02688 | u124212130 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = map(int, input().split())\nANSlist = [1]*(N)\nprint(ANSlist)\nfor i in range(1,K):\n I = input() #\n S = list(input())\n for j in range(len(S)):\n if S[j] != " ":\n ANSlist[int(S[j])-1] = 0\n\nANS = 0\n\nfor i in range(N-1):\n if ANSlist[i] != 0:\n ANS += 1\n\nprint(ANS)', 'N, K = map(int, input().split())\nANSlist = [1]*(N)\nprint(ANSlist)\nfor i in range(K):\n I = input() #\n S = list(input())\n for j in range(len(S)):\n if S[j] != " ":\n ANSlist[int(S[j])-1] = 0\n\nANS = 0\n\nfor i in range(N-1):\n if ANSlist[i] != 0:\n ANS += 1\n\nprint(ANS)', 'N, K = map(int, input().split())\nprint("ok")\nD = int(input)\n\nANSlist = [1]*(N -1)\n\nfor i in range(1,K):\n S = map(int, input().split())\n for j in range(S):\n ANSlist[S[j]] = 0\n\nANS = 0\n\nfor i in range(N-1):\n if ANSlist[i] != 0:\n ANS += 1\n\nprint(ANS)', 'N, K = map(int, input().split())\nANSlist = [1]*(N)\nprint(ANSlist)\nfor i in range(K):\n I = input() #\n S = list(input())\n for j in range(len(S)):\n if S[j] != " ":\n ANSlist[int(S[j])-1] = 0\n\nANS = 0\n\nfor i in range(N):\n if ANSlist[i] != 0:\n ANS += 1\n\nprint(ANS)', 'N, K = map(int, input().split())\nD = int(input())\n\nANSlist = []\n\nfor i in range(1,K):\n inportant = int(input())\n trash = input()\n ANSlist.append(inportant)\n\nANS = N - max(ANSlist)\n\nprint(ANS)', 'N, K = map(int, input().split())\nANSlist = [1]*(N)\n\nfor i in range(K):\n I = input() #\n S = list(input())\n for j in range(len(S)):\n if S[j] != " ":\n ANSlist[int(S[j])-1] = 0\n\nANS = 0\n\nfor i in range(len(ANSlist[i])):\n if ANSlist[i] != 0:\n ANS += 1\n\nprint(ANS)', 'N, K = map(int, input().split())\n#ANSlist = [1]*(N)\nANSlist = []\nANS = 0\n\nfor i in range(K):\n I = input() #\n S = input().split()\n print(ANSlist)\n for j in range(len(S)):\n if S[j] != " ":\n #ANSlist[int(S[j])-1] = 0\n if not S[j] in ANSlist:\n ANSlist.append(S[j])\n \n \n\n\n\nANS = N - len(ANSlist)\nprint(ANS)', 'N, K = map(int, input().split())\n#ANSlist = [1]*(N)\nANSlist = []\nANS = 0\n\nfor i in range(K):\n I = input() #\n S = input().split()\n #print(ANSlist)\n for j in range(len(S)):\n if S[j] != " ":\n #ANSlist[int(S[j])-1] = 0\n if not S[j] in ANSlist:\n ANSlist.append(S[j])\n \n \n\n\n\nANS = N - len(ANSlist)\nprint(ANS)'] | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s012702260', 's132461252', 's140926861', 's168298313', 's291402084', 's799786831', 's944596775', 's144028084'] | [9212.0, 9208.0, 9200.0, 9208.0, 9192.0, 9124.0, 9188.0, 9060.0] | [25.0, 29.0, 22.0, 27.0, 22.0, 21.0, 30.0, 28.0] | [299, 297, 270, 295, 200, 295, 459, 460] |
p02688 | u127285813 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = map(int, input().split())\n\ndoes_have = [False]*N\nfor _ in range(K):\n d = int(input())\n A = list(map(int, input().split()))\n for a in A:\n does_have[a-1] = True\n\nprint(sum(does_have))', 'N, K = map(int, input().split())\n\ndoes_have = [False]*N\nfor _ in range(K):\n d = int(input())\n A = list(map(int, input().split()))\n for a in A:\n does_have[a-1] = True\n\nprint(N-sum(does_have))'] | ['Wrong Answer', 'Accepted'] | ['s521324858', 's028936708'] | [9168.0, 9184.0] | [23.0, 24.0] | [194, 196] |
p02688 | u131464432 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['sunuke,var = map(int,input().split())\nloser = [1] * sunuke\nfor i in range(var):\n d = int(input())\n buy = map(int(input().split())\n for t in buy:\n winer[t-1] = 0\nprint(sum(loser))', 'import collections\n\nn,k = map(int,input().split())\nfor i in range (k):\n d = int(input())\n a = map(int,input().split())\nc = collections.Counter(a)\nprint(n-len(c))', 'sunuke,var = map(int,input().split())\nloser = [1] * sunuke\nfor i in range(var):\n d = int(input())\n tmp = map(int,input().split())\n for t in tmp:\n loser[t-1] = 0\nprint(sum(loser))'] | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s446632999', 's758595663', 's412732174'] | [8860.0, 9408.0, 9068.0] | [25.0, 34.0, 33.0] | [184, 163, 184] |
p02688 | u136708502 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['\nN,K = input().split()\nN = int(N)\nK = int(K)\nN_list = list()\n\nfor i in range(1,N+1):\n\tN_list.append(i)\n\nfor i in range(K):\n\td = int(input())\n\ta_list = input().split()\n\t\n\tfor i in N_list:\n\t\tfor j in a_list:\n\t\t\tif i == int(j):\n\t\t\t\tN_list.remove(i)\nanswer = N_list[0]\n\nprint(answer)', '\nN,K = input().split()\nN = int(N)\nK = int(K)\nN_list = list()\n\nfor i in range(1,N+1):\n\tN_list.append(i)\n\nfor i in range(K):\n\td = int(input())\n\ta_list = input().split()\n\tN_list += a_list\n\tN_list = map(N_list)\n\nprint(N_list)\n\n', 'N,K = map(int,input().split())\nN_list = list()\n\nfor i in range(1,N+1):\n\tN_list.append(i)\n\nfor i in range(K):\n\td = int(input())\n\ta_list = map(int,input().split())\n\tfor n in N_list:\n\t\tfor a in a_list:\n\t\t\tif n == a:\n\t\t\t\tN_list.remove(n)\n\nprint(N_list[0])', 'N,K = map(int,input().split())\ncheck = N*[0]\n\nfor i in range(N):\n\td = int(input())\n\ta = map(int,input().split())\n\tfor i in a:\n\t\tcheck[i-1] = 1\n\nprint(check.count(0))\n', 'N,K = map(int,input().split())\ncheck = N*[0]\n\nfor i in range(N):\n\td = int(input())\n\ta = list(map(int,input().split()))\n\tfor i in a:\n\t\tcheck[i-1] = 1\n\nprint(check.count(0))\n', 'N,K = map(int,input().split())\ncheck = N*[0]\n\nfor i in range(K):\n\td = int(input())\n\ta = list(map(int,input().split()))\n\tfor i in a:\n\t\tcheck[i-1] = 1\n\nprint(check.count(0))\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s080771034', 's401852020', 's690655458', 's811285744', 's930255237', 's509446495'] | [9196.0, 9212.0, 9180.0, 9172.0, 9120.0, 9068.0] | [31.0, 23.0, 22.0, 22.0, 23.0, 24.0] | [279, 223, 251, 166, 172, 172] |
p02688 | u141574039 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N,K=map(int,input().split())\nS=[0]*(N+1);cnt=0\nfor i in range(K):\n d=int(input())\n A=list(map(int,input().split()))\n for i in range(d):\n S[A[i]] +=1\nprint(S)\nfor i in range(1,N+1):\n if S[i]==0:\n cnt=cnt+1\nprint(cnt)', 'N,K=map(int,input().split())\nS=[0]*(N+1);cnt=0\nfor i in range(K):\n d=int(input())\n A=list(map(int,input().split()))\n for i in range(d):\n S[A[i]] +=1\n#print(S)\nfor i in range(1,N+1):\n if S[i]==0:\n cnt=cnt+1\nprint(cnt)'] | ['Wrong Answer', 'Accepted'] | ['s388069181', 's084224537'] | [9232.0, 9200.0] | [22.0, 20.0] | [225, 226] |
p02688 | u144072139 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N,K=map(int,input().split())\nd=[]\na=[]\nfor i in range(K):\n d.append(int(input()))\n a.append(list(map(int,input().split())))\n \naa=[0]*N\ncounts=0\n\nfor k in K:\n for j in a[k]:\n aa[j-1]=1\n \nfor x in range(N+1):\n if aa[x-1]==0:\n counts+=1\n\nprint(counts)', 'N,K=map(int,input().split())\nd=[]\na=[]\nfor i in range(k):\n d.append(int(input()))\n a.append(list(map(int,input().split())))\n \naa=[0]*N\ncounts=0\n\nfor k in K:\n for j in a[k]:\n aa[j-1]=1\n \nfor x in range(N+1):\n if aa[x-1]==0:\n counts+=1\n\nprint(counts)', 'N,K=map(int,input().split())\nd=[]\na=[]\nfor i in range(K):\n d.append(int(input()))\n a.append(list(map(int,input().split())))\n \naa=[0]*N\ncounts=0\n\n\nfor k in a:\n for j in k:\n aa[j-1]+=1\n \nfor x in aa:\n if x==0:\n counts+=1\n\nprint(counts)'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s040206982', 's463478204', 's985109667'] | [9128.0, 9124.0, 9140.0] | [26.0, 22.0, 25.0] | [284, 284, 351] |
p02688 | u145145077 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['N, K = map(int, input().split())\nAall = set(range(1, N))\nAk = []\nfor i in range(N):\n d = input().split()\n A = list(map(int, input().split()))\n Ak.extend((A))\nprint(len(Aall - set(Ak)))', 'N, K = map(int, input().split())\nAall = set(range(1, N))\nAk = []\nfor i in range(N*2):\n #d = input()\n A = list(map(int, input().split()))\n if i % 2 == 1:\n Ak.extend((A))\nprint(len(Aall - set(Ak)))', 'N, K = map(int, input().split())\nAall = set(list(range(1, N+1)))\nA = []\nfor i in range(N*2):\n try: \n if i % 2 != 0:\n a = list(map(int, input().split()))\n A.extend(a)\n else:\n d = list(map(int, input().split()))\n except EOFError:\n d = 1\nprint(len(Aall-set(A)))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s265298694', 's727063796', 's198550526'] | [9176.0, 9208.0, 9156.0] | [24.0, 26.0, 23.0] | [187, 201, 284] |
p02688 | u152283104 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['a,b = map(int,input().split())\nans_li = [0 for x in range(a)]\n\nfor i in range(b):\n d = int(input())\n for j in range(d):\n l = list(map(int, input().split()))\n for ll in l:\n ans_li[ll] += 1\nprint(ans_li.count(0))', 'a,b = map(int,input().split())\nans_li = [0 for x in range(a)]\n\nfor i in range(b):\n d = int(input())\n for j in range(d):\n l = list(map(int, input().split()))\n for ll in l:\n ans_li[ll-1] += 1\nprint(ans_li.count(0))\n', 'a,b = map(int,input().split())\nans_li = [0 for x in range(a)]\n\nfor i in range(b):\n d = int(input())\n l = list(map(int, input().split()))\n for ll in l:\n ans_li[ll-1] += 1\nprint(ans_li.count(0))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s302462138', 's725143006', 's944196278'] | [9052.0, 9184.0, 9184.0] | [22.0, 22.0, 21.0] | [223, 226, 200] |
p02688 | u158380546 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['a = 1;\ntreat = 0;\nn, k = map(int, input().split());\n\ndata = [input().split() for l in range(2*k)]\nprint(data);\n\n\nwhile a <= n:\n print("γγγγγγ¬γε");\n print(a);\n print("γθͺΏγΉγ");\n b = 0;\n d = 0;\n \n while b < k:\n search = int(data[2*b][0]);\n c = 0;\n \n while c < search:\n print("δ»γ―");\n print(data[2*b+1][c]);\n x = int(data[2*b+1][c]);\n if x == a :\n d = d + 1;\n c = c + 1\n \n b = b + 1;\n print(d);\n \n if d == 0:\n treat = treat + 1;\n \n a = a + 1;\n \nprint(treat);', 'a = 1;\ntreat = 0;\nn, k = map(int, input().split());\n\ndata = [input().split() for l in range(2*k)]\n\n\nwhile a <= n:\n b = 0;\n d = 0;\n \n while b < k:\n search = int(data[2*b][0]);\n c = 0\n \n while c < search:\n if data[2*b+1][c] == a:\n d = d + 1;\n c = c + 1\n \n b = b + 1;\n \n if d == 0:\n treat = treat + 1;\n \n a = a + 1;\n \nprint(treat);', 'a = 1;\ntreat = 0;\nn, k = map(int, input().split());\n \ndata = list(input().split() for l in range(2*k))\n \n \nwhile a <= n:\n b = 0;\n d = 0;\n \n while b < k:\n search = int(data[2*b][0]);\n c = 0;\n \n while c < search:\n x = int(data[2*b+1][c]);\n if x == a :\n d = d + 1;\n c = c + 1\n \n b = b + 1;\n \n if d == 0:\n treat = treat + 1;\n \n a = a + 1;\n \nprint(treat);'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s373468963', 's663572958', 's766512385'] | [13588.0, 9352.0, 9676.0] | [973.0, 197.0, 325.0] | [654, 453, 483] |
p02688 | u160265910 | 2,000 | 1,048,576 | N _Snukes_ called Snuke 1, Snuke 2, ..., Snuke N live in a town. There are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \cdots, A_{i, {d_i}}. Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief? | ['n, k = map(int, input().split())\nhash_list = [False for i in range(n)]\n\nfor i in range(k):\n d = int(input())\n okashi_list = list(map(int,input().split()))\n print(okashi_list)\n for j in range(d):\n having = okashi_list[j] - 1\n if not hash_list[having]:\n hash_list[having] = True\n\ncount = 0\nfor i in range(n):\n if not hash_list[i]:\n count += 1\n \n\nprint(hash_list)\nprint(count)', 'n, k = map(int, input().split())\nhash_list = [False for i in range(n)]\n\nfor i in range(k):\n d = int(input())\n okashi_list = list(map(int,input().split()))\n for j in range(d):\n having = okashi_list[j] - 1\n if not hash_list[having]:\n hash_list[having] = True\n\ncount = 0\nfor i in range(n):\n if not hash_list[i]:\n count += 1\n \n\nprint(count)'] | ['Wrong Answer', 'Accepted'] | ['s192557216', 's229428799'] | [9208.0, 9208.0] | [24.0, 22.0] | [427, 387] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.