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 |
|---|---|---|---|---|---|---|---|---|---|---|
p02760 | u832871520 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["BingoRow = 3\nBingoList = [list(map(int,input().split())) for i in range(BingoRow)]\n\nTargetRow = int(input())\nTargetList = [int(input()) for i in range(TargetRow)]\n\nansList = []\nx = 0\nflg = false\nfor row in BingoList:\n for num in row:\n flg = false\n for target in TargetList:\n if num == target:\... | ['Runtime Error', 'Accepted'] | ['s736638816', 's676839967'] | [2940.0, 3064.0] | [17.0, 18.0] | [926, 931] |
p02760 | u833436666 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['ans="No"\nA=3\nt=[0]*A\nx=[0]*A\ny=[0]*A\nfor i in range(A):\n t[i], x[i], y[i] = map(int, input().split())\n#print(x[1])\n\nN=int(input())\nS=[]\nfor _ in range(N):\n S.append(input())\n#print(S[0])\nS1=[int(s) for s in S]\nfor i in range(A):\n if t[i] in S1:\n t[i]=0\n if x[i] in S1:\n x[i]=0\n if y[i... | ['Wrong Answer', 'Accepted'] | ['s808314176', 's196521373'] | [3064.0, 3064.0] | [17.0, 18.0] | [526, 671] |
p02760 | u834269725 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["from functools import reduce\n\na = reduce(lambda a, b: a + b, [list(map(int, input().split())) for _ in range(3)])\nprint(a)\nn = int(input())\nb = {int(input()): None for _ in range(n)}\n\nr = [(ai in b) for ai in a]\n\ncombs = [\n [0,1,2],\n [3,4,5],\n [6,7,8],\n [0,3,6],\n [1,4,7],\n [2,5,8],\n ... | ['Wrong Answer', 'Accepted'] | ['s695163857', 's578315483'] | [3572.0, 3064.0] | [22.0, 17.0] | [422, 367] |
p02760 | u835283937 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['def main():\n A = [[int(a) for a in input().split()] for i in range(3)]\n N = int(input())\n b = [int(input()) for i in range(N)]\n print(A, N, b)\n for k in b:\n for i in range(3):\n for j in range(3):\n if A[i][j] == k:\n A[i][j] = "x"\n bingo = ... | ['Wrong Answer', 'Accepted'] | ['s218453572', 's644331526'] | [3064.0, 3064.0] | [18.0, 18.0] | [794, 782] |
p02760 | u836737505 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['a = [list(map(int, input().split())) for _ in range(3)]\n n = int(input())\n b = [int(input()) for i in range(n)]\n ai = [[1]*3 for _ in range(3)]\n for i in range(3):\n for j in range(3):\n if a[i][j] in b:\n ai[i][j] = 0\n ans = "No"\n for k in range(3):\n i... | ['Runtime Error', 'Accepted'] | ['s908658495', 's909126744'] | [2940.0, 3064.0] | [17.0, 18.0] | [550, 539] |
p02760 | u844895214 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import sys\nfrom collections import deque\nimport numpy as np\nimport math\nsys.setrecursionlimit(10**6)\ndef S(): return sys.stdin.readline().rstrip()\ndef SL(): return map(str,sys.stdin.readline().rstrip().split())\ndef I(): return int(sys.stdin.readline().rstrip())\ndef IL(): return map(int,sys.stdin.readline().rs... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s440749569', 's990463871', 's924078995'] | [27088.0, 27096.0, 26876.0] | [116.0, 117.0, 119.0] | [1282, 1272, 1260] |
p02760 | u845148770 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['A = [0]*3\nfor i in range(0,3):\n A[i] = list(map(int, input().split()))\nN = int(input())\nb = [int(input()) for i in range(N)]\n\ncount = 0\nwhile count < N:\n for i in range(0,3):\n for j in range(0,3):\n if b[count] == A[i][j]:\n A[i][j] = 0\n count += 1\n \nprint(A)\nsum_... | ['Wrong Answer', 'Accepted'] | ['s280228965', 's733334881'] | [3064.0, 3064.0] | [18.0, 18.0] | [866, 861] |
p02760 | u846226907 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['\na = list(list(map(int,input().split())) for _ in range(3))\n\nN = int(input())\n\nb = list(int(input()) for _ in range(N))\n\n\nax = [[0]*3]*3\n\nfor k in range(N):\n for i in range(3):\n for j in range(3):\n if a[i][j] == b[k]:ax[i][j]= 1\n\n\nfor i in range(3):\n xcnt = 0\n ycnt = 0\n ... | ['Runtime Error', 'Accepted'] | ['s280128515', 's220862523'] | [3064.0, 3064.0] | [17.0, 17.0] | [664, 563] |
p02760 | u846808272 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["t = [0] * 3\nx = [0] * 3\ny = [0] * 3\na=[]\nfor i in range(3):\n t[i], x[i], y[i] = map(int, input().split())\na.append(t)\na.append(x)\na.append(y)\nn=int(input())\nli=[input() for i in range(n)]\n\nctr=[[0,0,0],[0,0,0],[0,0,0]]\nfor i in range(3):\n for j in range(3):\n for k in range(n):\n ... | ['Wrong Answer', 'Accepted'] | ['s797064897', 's289617439'] | [3188.0, 3188.0] | [17.0, 18.0] | [965, 954] |
p02760 | u848535504 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['A = [list(map(int,input().split())) for i in range(3)]\nN = int(input())\nb = [int(input()) for i in range(N)]\n\nfor i in range(3):\n for j in range(3):\n if A[i][j] in b:\n A[i][j] = 0\n\nfor i in range(3):\n if A[i][0] == A[i][1] == A[i][2]:\n print("Yes")\n exit(0)\n if A[... | ['Runtime Error', 'Accepted'] | ['s101699613', 's993743599'] | [9072.0, 9220.0] | [23.0, 25.0] | [499, 645] |
p02760 | u849756457 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['nums = []\n\nfor i in range(3):\n nums.append([int(n) for n in input().split(" ")])\nprint(nums)\n\nbingo_list = []\n\nbingo_list.extend(nums)\nfor i in range(3):\n bingo_list.append([nums[0][i], nums[1][i], nums[2][i]])\nbingo_list.append([nums[0][0], nums[1][1], nums[2][2]])\nbingo_list.append([nums[2][0], nu... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s775837930', 's937948781', 's181003691'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0] | [619, 629, 588] |
p02760 | u857673087 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a1,a2,a3 = map(int,input().split())\nb1,b2,b3 = map(int,input().split())\nc1,c2,c3 = map(int,input().split())\nN = int(input())\nb = [int(input()) for _ in range(N)]\n\nif a1 and a2 and a3 in b or\n b1 and b2 and b3 in b or\n c1 and c2 and c3 in b or\n a1 and b1 and c1 in b or\n a2 and b2 and c2 in b or\... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s013238704', 's456104687', 's965537774'] | [2940.0, 9232.0, 9028.0] | [17.0, 27.0, 31.0] | [431, 531, 532] |
p02760 | u861071267 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import sys\nA = [list(map(int,input().split())) for i in range(3)]\nN = int(input())\nb = [int(input()) for i in range(N)]\nans_flag = True\nans_flag2 = True\nans = [[False, False, False], [False, False, False], [False, False, False]]\n\nfor i in range(3):\n for j in range(3):\n if A[i][j] in b:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s053498780', 's393500377', 's451104479'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [692, 612, 680] |
p02760 | u861109991 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a = [list(map(int, input().split())) for i in range(3)]\nN = int(input())\nb = [int(input()) for i in range(N)]\n\na = np.array(a)\nb = np.array(b)\n\nafter = np.zeros((3,3))\nfor i in range(N):\n after += a == b[i]\n \nbool1 = (np.sum(after, axis=0)==3).sum()\nbool2 = (np.sum(after, axis=1)==3).sum()\nbool3 = ... | ['Runtime Error', 'Accepted'] | ['s085949213', 's159468793'] | [3064.0, 14468.0] | [18.0, 160.0] | [472, 492] |
p02760 | u863964720 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["Array = [list(map(int,input().split())) for _ in range(3)]\nArrayBingo = [[0,0,0],[0,0,0,],[0,0,0]]\nN = int(input())\nB = []\ncheckR = 0\ncheckG = 0\ncheckN = 0\nfor i in range (N):\n B.append(int(input()))\nfor l in range (N):\n for j in range (3):\n for k in range (3):\n if Array[j][k]==B[l... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s171423761', 's486344260', 's553962539', 's605122113', 's797930558', 's998773512', 's267133963'] | [3064.0, 3064.0, 3064.0, 3192.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 18.0, 17.0, 17.0, 18.0] | [1292, 927, 849, 1526, 994, 1525, 1028] |
p02760 | u864276028 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A = list(map(int, input().split()))\nB = list(map(int, input().split()))\nC = list(map(int, input().split()))\nX = A + B + C\nN = int(input())\nL = []\nfor i in range (N):\n K = int(input())\n L.append(K)\nck = 'No'\nif A[1] in L and A[2]in L and A[3] in L:\n ck == 'Yes'\nelif B[1] in L and B[2]in L and B[3] in L:... | ['Runtime Error', 'Accepted'] | ['s037241575', 's971086751'] | [9288.0, 9228.0] | [29.0, 31.0] | [672, 666] |
p02760 | u864711178 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['yoko_1 = [int(i) for i in input().split()]\nyoko_2 = [int(i) for i in input().split()]\nyoko_3 = [int(i) for i in input().split()]\ntate_1 = [yoko_1[0], yoko_2[0], yoko_3[0]]\ntate_2 = [yoko_1[1], yoko_2[1], yoko_3[1]]\ntate_3 = [yoko_1[2], yoko_2[2], yoko_3[2]]\nnaname_1 = [yoko_1[0], yoko_2[1], yoko_3[2]]\nnaname_2... | ['Wrong Answer', 'Accepted'] | ['s195291259', 's349864931'] | [3192.0, 3064.0] | [18.0, 17.0] | [836, 906] |
p02760 | u869917163 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A1 = list(map(int,input().split()))\nA2 = list(map(int,input().split()))\nA3 = list(map(int,input().split()))\nN = int(input())\nb_list=[]\nfor i in range(N):\n b_list.append(int(input))\n\nfor i in b_list:\n A1 = [x in A1 if x != i else -1]\n A2 = [y in A2 if y != i else -1]\n A3 = [z in A3 if z != i else -1]\n\... | ['Runtime Error', 'Accepted'] | ['s907687491', 's200322316'] | [3064.0, 3064.0] | [17.0, 18.0] | [542, 588] |
p02760 | u870684607 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['A=[]\nfor i in range(3):\n A.extend(list(map(int, input().split())))\nN = int(input())\nn=[]\nwhile N>0:\n inp = int(input())\n if inp in A:\n n.append(inp)\n N-=1\nA = [A[:3],A[3:6],A[6:9], [A[0], A[4], A[8]], [A[2], A[4], A[6]], [A[0], A[3], A[6]], [A[1], A[4], A[7]], [A[2], A[5], A[8]]]\nfor ele... | ['Wrong Answer', 'Accepted'] | ['s420822627', 's002010137'] | [3064.0, 3064.0] | [18.0, 18.0] | [398, 488] |
p02760 | u871867619 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\n\nA = []\nfor _ in range(3):\n A.append([int(x) for x in input().split()])\nA = np.array(A)\nR = np.zeros((3,3))\nN = int(input())\nB = []\n\nfor _ in range(N):\n b = int(input())\n x, y = np.where(A == b)\n if len(x) > 0:\n for i in range(len(x)):\n R[x[i], y[i]] = 1... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s421392704', 's615173670', 's706042388'] | [21408.0, 12440.0, 21664.0] | [335.0, 153.0, 303.0] | [544, 542, 538] |
p02760 | u871934301 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['A,B,C=map(int,input().split())\nD,E,F=map(int,input().split())\nG,H,I=map(int,input().split())\nN=int(input())\nb=[input() for i in range(N)]\nif b.count(A)>0 and b.count(B)>0 and b.count(C)>0:\n print("Yes")\n exit()\nif b.count(D)>0 and b.count(E)>0 and b.count(F)>0:\n print("Yes")\n exit()\nif b.count(... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s076980516', 's128403132', 's150821129', 's182195264', 's238404257', 's468690342', 's810860302', 's985034812', 's710197448'] | [3064.0, 3064.0, 3188.0, 3064.0, 3188.0, 3064.0, 3064.0, 3064.0, 3188.0] | [17.0, 18.0, 17.0, 17.0, 18.0, 19.0, 19.0, 18.0, 18.0] | [800, 878, 904, 802, 904, 802, 795, 800, 909] |
p02760 | u873736356 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A = list(list(map(int, input().split())) for i in range(3))\nN = int(input())\nB = [int(input()) for i in range(N)]\nresult = [[0]*3 for i in range(3)]\nprint(A,N,B,result)\n\nfor i in range(3):\n for j in range(3):\n for k in range(N):\n if A[i][j] == B[k]:\n result[i][j] = 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s116262939', 's151691992', 's472121903'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0] | [922, 922, 902] |
p02760 | u875541136 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\nS = np.array([list(map(int, input().split())) for _ in range(3)])\nn = int(input())\nfor _ in range(n):\n S = np.where(S==int(input()), 0, S)\nif min(np.sum(S, axis=0))==0 or min(np.sum(S, axis=1))==0:\n print('Yes')\n exit()\nif (S[0][0] == 0 and S[1][1] == 0 and S[2][2]) or (S[2][0] == ... | ['Wrong Answer', 'Accepted'] | ['s491854249', 's815117794'] | [14536.0, 14448.0] | [155.0, 148.0] | [382, 445] |
p02760 | u884679979 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["row1=list(map(int,input().split()))\nrow2=list(map(int,input().split()))\nrow3=list(map(int,input().split()))\nbingo=row1+row2+row3\nnum=int(input())\nnum_list=set()\nfor i in range(num):\n num_list.add(int(input()))\n\nbingo_list=[[0,3,6],[1,4,7],[2,5,8],[0,1,2],[3,4,5],[6,7,8],[0,4,8],[2,4,6]]\nnum_list=list(num_l... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s098087502', 's120976257', 's480395674', 's554568123', 's957550664', 's848108191'] | [3188.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0, 18.0, 17.0, 18.0] | [517, 521, 497, 519, 500, 540] |
p02760 | u884692162 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['def get(A, ar, ac):\n if ar > 2 or ar < -2 or ac > 2 or ar < -2:\n return 0\n return A[ar][ac]\n\ndef check(A, ar, ac):\n if 0 == get(A, ar-1, ac-1) and 0 == get(A, ar-2, ac-2) and 0 == get(A, ar+1, ac+1) and 0 == get(A, ar+2, ac+2):\n return True\n if 0 == get(A, ar+1, ac-1) and 0 == get(A,... | ['Wrong Answer', 'Accepted'] | ['s463709683', 's920188614'] | [3192.0, 3064.0] | [18.0, 18.0] | [1160, 1206] |
p02760 | u886655280 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\n\nA_list = []\n\nfor i in range(3):\n a = list(map(int, input().split()))\n A_list.append(a)\n\nN = int(input())\nnarray = np.zeros((3, 3), dtype=np.int)\n\n\nfor j in range(N):\n b = int(input())\n\n for n in range(3):\n for m in range(3): \n if A_list[n][m] == b:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s061138212', 's157556966', 's180380496', 's377748217', 's500475259', 's513577693', 's746152205', 's885146969', 's928884947', 's858814787'] | [14480.0, 12516.0, 21332.0, 12500.0, 12516.0, 14564.0, 12432.0, 14480.0, 12516.0, 9164.0] | [149.0, 157.0, 301.0, 149.0, 149.0, 149.0, 148.0, 151.0, 151.0, 30.0] | [710, 710, 710, 694, 710, 753, 753, 710, 753, 880] |
p02760 | u890461092 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\n\na = []\nans = 'No'\n\na.append(list(map(int,input().split())))\na.append(list(map(int,input().split())))\na.append(list(map(int,input().split())))\n\nn = int(input())\n\nfor i in range(n):\n d = int(input())\n for j in range(3):\n for k in range(3):\n if a[j][k] == n:\n a[j][k] ... | ['Wrong Answer', 'Accepted'] | ['s757154199', 's505681609'] | [13088.0, 12508.0] | [159.0, 153.0] | [716, 756] |
p02760 | u891422384 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A = [list(map(int,input().split())) for i in range(3)]\nn = int(input())\nfor j in range(n):\n b = int(input())\n for j in range(3):\n for k in range(3): \n \tif b==A[j][k]:\n \t\tA[j][k]=-1\n\nfor k in range(3):\n if A[k][:]==[-1,-1,-1]:\n print('Yes')\n exit(0)\n \nfor k in range(3):\n if sum(A... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s124820994', 's202619670', 's242351530', 's251755798', 's507662233', 's651211087', 's659041442', 's931054374', 's382659949'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 19.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0, 18.0] | [483, 512, 523, 471, 491, 438, 479, 466, 493] |
p02760 | u893661063 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['Aij= [input().split() for l in range(3)]\nN=int(input())\nb= [int(input()) for i in range(N)]\nfor j in range(3):\n for k in range(3):\n for n in range(N):\n if int(Aij[j][k])==b[n]:\n Aij[j][k]=0\n\n\nif (Aij[0][0] == Aij[0][1] == Aij[0][2] == "0") or (Aij[1][0] == Aij[1][1] == Ai... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s435278738', 's565883336', 's826508001', 's440151850'] | [9312.0, 9224.0, 9256.0, 9296.0] | [30.0, 29.0, 22.0, 27.0] | [788, 781, 795, 625] |
p02760 | u896741788 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['l=[list(map(int,input().split())) for i in range(3)]\nl=sum(l,[])\nn=int(input())\nli=set([input() for ini in range(n)])\nd=[0 for i in range(9)]\nfor g in range(9):\n if l[g] in li:d[g]=1\nif set([1]) in [set(d[h::3])for h in range(3)]+[set(d[h:h+3])for h in range(3)]+[set([d[0],d[4],d[8]]),set([d[2],d[4],d[6]])]:\... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s006619948', 's099450637', 's559157953', 's780483735', 's984956056'] | [3064.0, 3064.0, 3188.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 17.0, 17.0] | [343, 356, 325, 342, 332] |
p02760 | u896941378 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['#include <bits/stdc++.h>\nusing namespace std;\nvoid print() {\n cout << endl;\n}\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n cout << head;\n if (sizeof...(tail) != 0)\n cout << " ";\n print(forward<Tail>(tail)...);\n}\ntemplate <class T>\nvoid print(vector<T... | ['Runtime Error', 'Accepted'] | ['s530233580', 's025320130'] | [8820.0, 9124.0] | [24.0, 28.0] | [1910, 814] |
p02760 | u898428248 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['A11,A12,A13 = map(int, input().split())\nA21,A22,A23 = map(int, input().split())\nA31,A32,A33 = map(int, input().split())\nN = int(input())\nb = []\nfor i in range(N):\n b.append(int(input()))\n\ndef check_bingo(bingo_card):\n bingo_cnt = 0\n bingo_list = [[0, 1, 2],\n [3, 4, 5],\n ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s024751655', 's403067454', 's557998615'] | [3064.0, 3192.0, 3064.0] | [17.0, 17.0, 18.0] | [1357, 1443, 1452] |
p02760 | u899953001 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['#!/usr/bin/env python\n\na = []\na.append([int(i) for i in input().split()])\na.append([int(i) for i in input().split()])\na.append([int(i) for i in input().split()])\nn = int(input())\nc = [[0,0,0],[0,0,0],[0,0,0]]\nfor i in range(n):\n b = int(input())\n for j in range(3):\n for k in range(3):\n ... | ['Wrong Answer', 'Accepted'] | ['s897856844', 's173731598'] | [3064.0, 3188.0] | [18.0, 19.0] | [755, 1036] |
p02760 | u904081717 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import sys\nimport numpy as np\n\nbingo_list = np.array([list(map(int, input().split())) for _ in range(3)])\nN = int(input())\nn = [int(input()) for _ in range(N)]\n\nA = np.array([[41,7,46],[26,89,2],[78,92,8]])\n\nfor i in range(3):\n for j in range(N):\n if A[i,0] == n[j]:\n for k in range(N)... | ['Wrong Answer', 'Accepted'] | ['s167727451', 's657027027'] | [17208.0, 12448.0] | [243.0, 150.0] | [1012, 1256] |
p02760 | u906501980 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['a = [list(map(int, input().split())) for _ in range(3)]\nis_bingo = [[False]*3 for _ in range(3)]\nn = int(input())\nfor _ in range(n):\n b = int(input())\n for i, ai in enumerate(a):\n for j, aii in enumerate(ai):\n if aii == b:\n is_bingo[i][j] = True\nis_bingo_flat = [j for i... | ['Runtime Error', 'Accepted'] | ['s209920674', 's578073417'] | [3064.0, 3188.0] | [17.0, 19.0] | [559, 572] |
p02760 | u907403674 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['array= []\nfor i in range(3):\n array.append(list(map(int,input().split())))\nn= int(input())\nnumber=[]\nanswer = "No"\nfor i in range(n):\n number.append(input())\n\nfor i in range (3):\n for j in range(3):\n for k in range(n):\n print(array[i][j])\n print(number[k])\n ... | ['Wrong Answer', 'Accepted'] | ['s828337628', 's796260559'] | [3064.0, 3064.0] | [18.0, 17.0] | [773, 713] |
p02760 | u915647268 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['number = []\nresult = "No"\n\nfor i in range(3):\n\tfor n in input().split():\n\t\tn = int(n)\n\t\tnumber.append(n)\n\nbingo = [None for _ in range(9)]\n\nN = int(input())\nfor i in range(N):\n\tb = int(input())\n\tfor j in range(9):\n\t\tif b == number[j]:\n\t\t\tbingo[j] = True\n\nprint(bingo)\n\nfor i in range(3)... | ['Wrong Answer', 'Accepted'] | ['s783511872', 's457897782'] | [3064.0, 3192.0] | [18.0, 17.0] | [700, 687] |
p02760 | u917733926 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A1 = list(map(int, input().split()))\nA2 = list(map(int, input().split()))\nA3 = list(map(int, input().split()))\nA = list()\nA.extend(A1)\nA.extend(A2)\nA.extend(A3)\nN = int(input())\nB = list()\nresult = list()\nfor _ in range(N):\n B.append(int(input()))\nfor e in B:\n if e in A:\n result.append(A.in... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s002964682', 's583233306', 's648903382', 's731122837', 's906564580', 's993983986'] | [3064.0, 3192.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0, 17.0, 18.0, 18.0] | [892, 923, 906, 906, 903, 905] |
p02760 | u922487073 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["# import numpy as np\n\nbingo = np.zeros((3,3))\nbin_bingo = np.zeros((3,3))\n\n\nfor i in range(3):\n bingo[i] = list(map(int, input().split()))\n\nN = int(input())\n\nfor _ in range(N):\n num = int(input())\n bin_bingo = np.logical_or(bin_bingo, bingo == num)\n\n# find bingo\nlin1 = np.array([[True, True, ... | ['Runtime Error', 'Accepted'] | ['s603455983', 's828059941'] | [3192.0, 12448.0] | [18.0, 151.0] | [1258, 1243] |
p02760 | u923270446 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A = [input().split() for x in range(3)]\nN = int(input())\nB = [int(input()) for y in range(N)]\nindex1 = 0\nindex2 = 0\ncount1 = 0\ncount2 = 0\nMatch = {}\nfor number in B:\n for n in A:\n for m in n:\n if number == m:\n March['A[count1][count2]'] = m\n count2 += 1\n count1 += 1\n count2 =... | ['Wrong Answer', 'Accepted'] | ['s604130094', 's579445556'] | [3060.0, 3064.0] | [19.0, 17.0] | [321, 699] |
p02760 | u933341648 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a = [input().split() for _ in range(3)]\nn = int(input())\nb = [input() for _ in range(n)]\n\np = []\np += a\np += [list(a_) for a_ in zip(*a)]\np += [[a[x][x] for x in range(3)]]\np += [[a[x][2-x] for x in range(3)]]\n\nfor p_ in p:\n for x in p_:\n if x in b:\n continue\n else:\n ... | ['Wrong Answer', 'Accepted'] | ['s802277814', 's007536546'] | [3064.0, 3064.0] | [18.0, 20.0] | [365, 380] |
p02760 | u934052933 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['def main():\n a = [list(map(int, input().split())) for _ in range(3)]\n n = int(input())\n b = [int(input()) for _ in range(n)]\n card = [[0]*3]*3\n for i in range(n):\n for j in range(n):\n card[i][j] == False\n for k in range(n):\n if a[i][j] == b[k]:\n ... | ['Runtime Error', 'Accepted'] | ['s812292786', 's472144571'] | [3064.0, 3064.0] | [17.0, 17.0] | [789, 735] |
p02760 | u936285815 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["f = list(map(int, input().split()))\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\nn = int(input())\nk = []\nfor i in range(n):\n k.append(int(input()))\n\nlis = []\n\nlis.append(f)\nlis.append(s)\nlis.append(t)\n\nans = 0\n\nfor i in lis:\n c =0\n for n in range(len(i)):\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s020517723', 's211396271', 's299435997', 's485589389', 's562453606'] | [3192.0, 3064.0, 3192.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0, 18.0, 18.0] | [794, 812, 793, 804, 803] |
p02760 | u937782958 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["# -*- coding: utf-8 -*-\na = []\nfor i in range(3):\n tmp = input()\n a.append(list(map(int, tmp.split())))\n\nn = int(input())\n# print('n', n)\nb = []\nfor j in range(n):\n b.append(int(input()))\n\n# print('a', a)\n# print('b', b)\n\ndef rep(a):\n for i in range(3):\n for j in range(3):\n ... | ['Runtime Error', 'Accepted'] | ['s965494629', 's511260697'] | [2940.0, 3064.0] | [17.0, 17.0] | [814, 795] |
p02760 | u941438707 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['a=[list(map(int,input().split())) for _ in range(3)]\nb=[int(input()) for _ in range(int(input()))]\nfor i in range(3):\n for j in range(3):\n if a[i][j] in b:\n a[i][j]=0\nans="No" \nfor i in range(3):\n if a[i][0]==a[i][1]==a[i][2]==0:\n ans="Yes"\nfor i in range(3):\n i... | ['Wrong Answer', 'Accepted'] | ['s134632092', 's100449254'] | [3064.0, 3064.0] | [17.0, 17.0] | [490, 461] |
p02760 | u946346344 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['import sys\n\ndef input():\n return sys.stdin.readline().strip()\n\ndef main():\n \n a = [[0]*3 for i in range(3)]\n for i in range(3):\n a[i] = list(map(int, input().split()))\n n = int(input())\n b = [0]*n\n bingo = "No"\n for i in range(n):\n b[i] = int(input())\n for k... | ['Wrong Answer', 'Accepted'] | ['s138543500', 's763391091'] | [3064.0, 3064.0] | [17.0, 17.0] | [818, 700] |
p02760 | u946517952 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["card = []\nfor i in range(3):\n a1,a2,a3 = map(int,input().split())\n card.append([a1,a2,a3])\nprint(card)\n\nn = int(input())\n\nfor i in range(n):\n num = int(input())\n for j in [0,1,2]:\n for k in [0,1,2]:\n if num == card[j][k]:\n card[j][k] = 0\nif card[0] == [0,0,0] or ca... | ['Wrong Answer', 'Accepted'] | ['s195957631', 's457401205'] | [3064.0, 3064.0] | [17.0, 17.0] | [656, 644] |
p02760 | u947101138 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['a1=list(map(int,input().split(" ")))\na2=list(map(int,input().split(" ")))\na3=list(map(int,input().split(" ")))\nN=int(input())\nb=[]\n\nfor i in range(N):\n b.append(int(input()))\n\nallnum=[]\nallnum.append(a1)\nallnum.append(a2)\nallnum.append(a3)\n\n\nbingo=[[0,0,0],[0,0,0],[0,0,0]]\n\nfor k in b:\n for i ... | ['Wrong Answer', 'Accepted'] | ['s542957830', 's011075014'] | [3064.0, 3064.0] | [17.0, 17.0] | [796, 786] |
p02760 | u948779457 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A1 = list(map(int,input().split()))\nA2 = list(map(int,input().split()))\nA3 = list(map(int,input().split()))\nN = int(input())\nfor _ in range(N):\n b = int(input())\n for i in range(3):\n if A1[i] == b:\n A1[i] = 0\n for j in range(3):\n if A2[j] == b:\n A2[j] = 0\n for k in range(3):\n if A3... | ['Wrong Answer', 'Accepted'] | ['s356476264', 's888302841'] | [3064.0, 3064.0] | [17.0, 17.0] | [804, 789] |
p02760 | u951401193 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a = [0]*3\nb = [[0]*3]*3\nfor i in range(3):\n\ta[i] = list(map(int,input().split()))\n\nn = int(input())\n\nfor i in range(n):\n tmp = int(input())\n for j in range(3):\n for k in range(3):\n if a[i][j] == tmp:\n b[i][j] = 1\n if b[i][0]==1 and b[i][1]==1 and b[i][2]==1:\n print('Yes... | ['Runtime Error', 'Accepted'] | ['s864182290', 's679567420'] | [3064.0, 3064.0] | [17.0, 17.0] | [623, 421] |
p02760 | u952708174 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["def c_guess_the_number():\n N, M = [int(i) for i in input().split()]\n Conds = [[int(i) for i in input().split()] for j in range(M)]\n\n digit = [-1] * N\n \n for s, c in Conds:\n if digit[s - 1] not in (-1, c):\n return -1\n digit[s - 1] = c\n\n \n \n if digit[0] == 0... | ['Runtime Error', 'Accepted'] | ['s432326571', 's712794055'] | [3064.0, 3188.0] | [19.0, 19.0] | [966, 797] |
p02760 | u952854963 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["l=[]\nfor i in range(3):\n l.append(list(map(int, input().split())))\nn = int(input())\nfor i in range(n):\n m = int(input())\n\n for j in range(3):\n for k in range(3):\n if l[j][k] == m:\n l[j][k] = -1\no=0\np=0\nfor j in range(3):\n for k in range(3):\n o+=l[j][k... | ['Wrong Answer', 'Accepted'] | ['s320036749', 's417117047'] | [3188.0, 3064.0] | [19.0, 17.0] | [501, 500] |
p02760 | u956257368 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\nA = np.zeros((3,3), dtype=int)\nfor i in range(3):\n A[i,:] = list(map(int, input().split()))\nN = int(input())\nB = [int(input()) for _ in range(N)]\n\nA = A.flatten()\nfor a in range(len(A)):\n\n for b in range(N):\n if A[a] == B[b]:\n A[a] = -1\n\nprint(A.reshape(3,3))\n... | ['Wrong Answer', 'Accepted'] | ['s136760024', 's774506045'] | [12444.0, 12528.0] | [152.0, 147.0] | [837, 816] |
p02760 | u956547804 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a1=list(map(int,input().split()))\na2=list(map(int,input().split()))\na3=list(map(int,input().split()))\na=[a1,a2,a3]\nn=int(input())\nq=[[0,0,0],[0,0,0],[0,0,0]]\nb=[]\nb=[int(input()) for i in range(n)]\nfor i in b:\n for c in range(3):\n for x in range(3):\n if b==a[c][x]:\n q[c... | ['Wrong Answer', 'Accepted'] | ['s658186720', 's704910973'] | [3064.0, 3064.0] | [18.0, 17.0] | [598, 598] |
p02760 | u965095643 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import sys\n\nbingo=[]\n\nfor _ in range(3):\n bingo.append(list(map(int, input().split())))\n\nn=int(input())\n\nfor i in range(n):\n a=int(input())\n for j in range(3):\n for k in range(3):\n if bingo[j][k] == a:\n bingo[j][k]=0\n\nprint(bingo)\n\nfor i in range(3):\n if bingo[i][0]==0 & bingo[i]... | ['Wrong Answer', 'Accepted'] | ['s957441500', 's708871770'] | [3064.0, 3064.0] | [17.0, 17.0] | [619, 647] |
p02760 | u968404618 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['A = [list(map(int, input().split())) for _ in range(3)]\nn = int(input())\nB = [int(input()) for _ in range(n)]\n\nfor i in range(3):\n for j in range(3):\n if A[i][j] in B:\n A[i][j] = -1\n\nfor i in range(3):\n ans1, ans2 = 0, 0\n for j in range(3):\n if A[i][j] == -1:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s055009886', 's563210936', 's647347426'] | [9144.0, 9116.0, 9144.0] | [28.0, 29.0, 30.0] | [591, 587, 591] |
p02760 | u968846084 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['import sys\nA=[[0]*3 for i in range(3)]\nfor i in range(3):\n A[i]=list(map(int,input().split()))\nn=int(input())\nfor i in range(n):\n b=int(input())\n for j in range(3):\n for k in range(3):\n if A[j][k]==b:\n A[j][k]=10**10\nfor i in range(3):\n if sum(A[i])==3*10**10:\n print("Yes")\n sys... | ['Time Limit Exceeded', 'Accepted'] | ['s233757063', 's518328483'] | [9432.0, 3064.0] | [2104.0, 17.0] | [670, 669] |
p02760 | u970133396 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['import numpy as np\n\ndef isBingo(isOpen):\n if np.any(np.all(isOpen==1,axis=0)==True) or \\\n np.any(np.all(isOpen==1,axis=1)==True):\n return "Yes"\n cnt1=0\n cnt2=0\n for i in range(3):\n print(isOpen[i][i])\n if isOpen[i][i]==1:\n cnt1+=1\n if isOpen[i][2-... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s673664095', 's677551664', 's209313943'] | [12516.0, 12496.0, 14436.0] | [148.0, 149.0, 148.0] | [710, 672, 682] |
p02760 | u970899068 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a= [list(map(int, input().split())) for i in range(3)]\nn=int(input())\nb=list(int(input()) for i in range(n))\nc=[[0,0,0] for i in range(3)]\n\nfor i in range(n):\n for j in range(3):\n for k in range(3):\n if b[i]==a[j][k]:\n c[j][k]=1\n\nif sum(c[0])==3 or sum(c[1])==3 or sum(c[... | ['Wrong Answer', 'Accepted'] | ['s790734322', 's667619479'] | [3064.0, 3064.0] | [17.0, 17.0] | [650, 608] |
p02760 | u971124021 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\nA = []\nfor i in range(3):\n A.append(list(map(int,input().split())))\n\nN = int(input())\nB = []\nfor i in range(N):\n B.append(int(input()))\n\nfor i,a in enumerate(A):\n for j,x in enumerate(a):\n if x in B:\n A[i][j] = 0\n\ndef bingo(x):\n if sum(x) == 0:\n print('yes')\n exi... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s205892403', 's328023359', 's926659407', 's209887028'] | [12512.0, 12524.0, 12444.0, 12512.0] | [147.0, 156.0, 150.0, 155.0] | [490, 632, 546, 488] |
p02760 | u977642052 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['def main(a: list, n: int, b: list):\n res = [[False, False, False], [False, False, False], [False, False, False]]\n for b in b:\n for i, a_row in enumerate(a):\n for j, a_col in enumerate(a_row):\n if b == a_col:\n res[i][j] = True\n\n for i in range(3):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s405379215', 's562269797', 's296549590'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [921, 921, 917] |
p02760 | u977771109 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['import sys\nrl = sys.stdin.readline\n\nrows = 3\ncols = 3\na11,a12,a13 = [int(x) for x in rl().split(\' \')]\na11,a12,a13 = [int(x) for x in rl().split(\' \')]\na31,a32,a33 = [int(x) for x in rl().split(\' \')]\n\nn = int(rl())\nb = []\n\nfor i in range(n):\n b.append(int(rl()))\n\n#####################\n\ncard = ... | ['Runtime Error', 'Accepted'] | ['s725216881', 's103996288'] | [3064.0, 3064.0] | [17.0, 17.0] | [942, 945] |
p02760 | u981309686 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["dic={}\na=[[0 for i in range(3)]for j in range(3)]\nfor i in range(1,100):\n dic[i]=[-1,-1]\nfor i in range(3):\n for j in range(3):\n x=int(input())\n a[i][j]=3\n dic[x]=[i,j]\nn=int(input())\nfor i in range(n):\n x=int(input())\n if(dic[x]!=[-1,-1]):\n a[dic[x][0],dic[x][1]]=... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s117913800', 's305725851', 's507063531', 's101454393'] | [3064.0, 3064.0, 3064.0, 3192.0] | [17.0, 17.0, 18.0, 17.0] | [626, 632, 581, 599] |
p02760 | u982594421 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["a = [list(map(int, input().split())) for _ in range(3)]\nn = int(input())\nb = [int(input()) for _ in range(n)]\n\nbingo = 'No'\n\nfor t in zip(*a):\n a.append(list(t))\n\na.append([a[i][i] for i in range(3)])\na.append([a[i][2-i]for i in range(3)])\n\nfor line in a:\n if all(item in b for item in a):\n ... | ['Wrong Answer', 'Accepted'] | ['s603331983', 's028302926'] | [8932.0, 9092.0] | [28.0, 27.0] | [333, 350] |
p02760 | u983181637 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\n\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\n\nlist_ = set(a+b+c)\nn = int(input())\n\na = np.array([a, b, c])\n\nfor _ in range(n):\n x = int(input())\n if x in list_:\n a = np.where(a==x,0,a)\nif np.sum(a==0) < 3:\n ... | ['Wrong Answer', 'Accepted'] | ['s775181061', 's049259156'] | [21340.0, 20920.0] | [308.0, 340.0] | [552, 562] |
p02760 | u983327168 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['import sys\nlist1=[]\nlist3=["Bingo","Bingo","Bingo"]\nA1,A2,A3=map(str,input().split())\nA4,A5,A6=map(str,input().split())\nA7,A8,A9=map(str,input().split())\nn=int(input())\nlist1=[input() for i in range(1,n+1)]\nlist2=[[A1,A2,A3],\n [A4,A5,A6],\n [A7,A8,A9]]\nfor y in range(3):\n for x in range(n):\n ... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s364579622', 's538541016', 's968125870'] | [3064.0, 3064.0, 3188.0] | [18.0, 18.0, 17.0] | [928, 722, 961] |
p02760 | u984276646 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A = [list(map(int, input().split())) for i in range(3)]\nN = int(input())\nB = [[0 for i in range(3)] for j in range(3)]\nfor i in range(N):\n a = int(input())\n for m in range(3):\n for n in range(3):\n if a == A[m][n]:\n B[m][n] = 1\np = 'No'\nfor i in range(3):\n cnt1 = 0\n cnt2 = 0\n for j in ... | ['Runtime Error', 'Accepted'] | ['s339100629', 's869795905'] | [3064.0, 3064.0] | [18.0, 17.0] | [594, 596] |
p02760 | u985041094 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['def B():\n a = [list(map(int,input().split())) for i in range(3)]\n n = int(input())\n b = [list(map(int,input().split())) for i in range(n)]\n for bingo in b:\n for i in range(3):\n for j in range(3):\n if a[i][j] == bingo:\n a[i][j] = 0\n for i in r... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s042437379', 's141574323', 's256603074', 's273369363', 's405251517', 's425845868', 's482778028', 's505771687', 's561567052', 's575736227', 's724208641', 's761036040', 's777867426', 's884683760', 's914366571', 's777997352'] | [3060.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 18.0, 18.0, 17.0, 18.0, 17.0, 18.0, 20.0, 18.0, 18.0, 17.0, 18.0, 17.0] | [639, 574, 671, 591, 577, 648, 661, 700, 624, 700, 645, 643, 618, 644, 733, 572] |
p02760 | u987326700 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['bingo = []\nb = []\n\nfor i in range(3):\n tmp = list(map(int,input().split()))\n bingo.append(tmp)\n\nn = int(input())\n\nwhile True:\n try:\n b.append(int(input()))\n except EOFError:\n break\n\nlis1 = [bingo[0][0],bingo[0][1],bingo[0][2]]\nlis2 = [bingo[1][0],bingo[1][1],bingo[1][2]]\nlis3 = [bingo[2][0]... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s848876545', 's954013663', 's170359842'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [757, 705, 742] |
p02760 | u989348352 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['import itertools\n\nA = []\nA1 = [int(i) for i in input().split()]\nA.append(A1)\nA2 = [int(i) for i in input().split()]\nA.append(A2)\nA3 = [int(i) for i in input().split()]\nA.append(A3)\n\nf = [[0] * 3 for i in range(3)]\n\n#print(A)\n\n\nN = int(input ())\nb = [input().split() for i in range(N)]\nb= list(itertool... | ['Wrong Answer', 'Accepted'] | ['s343388134', 's371862587'] | [3064.0, 3064.0] | [17.0, 18.0] | [824, 815] |
p02760 | u995062424 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['port numpy as np\nFlg = "No"\nA = [[0]*3 for i in range(3)]\nfor i in range(3):\n A[i][0], A[i][1], A[i][2] = map(int, input().split()) \nN = int(input())\nb = [0]*N\nfor j in range(N):\n b[j] = int(input())\n\nfor i in range(3):\n for j in range(3):\n for k in range(N):\n if(A[i][j] == ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s081517082', 's229899044', 's705837869'] | [2940.0, 21520.0, 12516.0] | [17.0, 304.0, 150.0] | [701, 624, 703] |
p02760 | u995419623 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['a = list(map(int,input().split()))\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nd = [a[0],b[0],c[0]]\ne = [a[1],b[1],c[1]]\nf = [a[2],b[2],c[2]]\ng = [a[0],b[1],c[2]]\nh = [a[2],b[1],c[0]]\n\nn = int(input())\n\nbs = []\nfor _ in range(n):\n bs.append(int(input())\n \nfor... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s154692704', 's241057757', 's258428628', 's437552352', 's517291459', 's868069683', 's896208286', 's814224380'] | [3064.0, 3064.0, 3064.0, 3064.0, 2940.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 17.0, 19.0] | [440, 478, 431, 468, 1, 473, 485, 432] |
p02760 | u996564551 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A11, A12, A13 = input().split(' ')\nA21, A22, A23 = input().split(' ')\nA31, A32, A33 = input().split(' ')\nN = int(input())\nb = []\nfor i in range(N):\n b = input()\nif A11 and A12 and A13 in b:\n print('Yes')\nelif A21 and A22 and A23 in b:\n print('Yes')\nelif A31 and A32 and A33 in b:\n print('Yes')\nelif A1... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s324133776', 's783870080', 's690944497'] | [9228.0, 8936.0, 9200.0] | [28.0, 25.0, 27.0] | [547, 783, 784] |
p02760 | u996731299 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['bingo=[list(map(int,input().split())) for i in range(3)]\nN=int(input())\nnumber=[list(map(int,input().split())) for i in range(N)]\n\n#print(bingo)\n#print(number)\ncheck=[0,0,0,0,0,0,0,0,0]\nans=0\nfor i in range(N):\n for j in range(3):\n for k in range(3):\n if number[i]==bingo[j][k]:\n ... | ['Wrong Answer', 'Accepted'] | ['s016101839', 's458760239'] | [3064.0, 3064.0] | [18.0, 17.0] | [686, 703] |
p02760 | u997641430 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["A = [list(map(int, input().split())) for _ in range(3)]\nN = int(input())\nB = [int(input(_)) for _ in range(N)]\nX = [[0 for _ in range(3)] for _ in range(3)]\nfor n in range(N):\n for i in range(3):\n for j in range(3):\n if A[i][j] == B[n]:\n X[i][j] = 1\ntate = any([all([X[i][j... | ['Wrong Answer', 'Accepted'] | ['s815193389', 's043218493'] | [3064.0, 3064.0] | [17.0, 18.0] | [559, 574] |
p02760 | u998169143 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ["import numpy as np\n\nA = [[0] * 3 for i in range(3)]\nA[0] = list(map(int, input().split()))\nA[1] = list(map(int, input().split()))\nA[2] = list(map(int, input().split()))\n\nN = int(input())\nb = [0] * N\nfor i in range(N):\n b[i] = int(input())\nprint(b)\n\nif ((A[0][0] in b) & (A[0][1] in b) & (A[0][2] in b))... | ['Wrong Answer', 'Accepted'] | ['s754999968', 's384126452'] | [12800.0, 12516.0] | [151.0, 150.0] | [863, 854] |
p02760 | u999503965 | 2,000 | 1,048,576 | We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}. The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet. Determine whether we will have a bi... | ['l=list(map(int,imput().split()))\nl+=list(map(int,imput().split()))\nl+=list(map(int,imput().split()))\n\nn=int(input())\n\nans_list=[False]*9\n\nfor i in range(n):\n num=int(input())\n if num in l:\n index=l.index(num)\n ans_list[index]=True\n \nif ans_list[0] and ans_list[1] and ans_list[2]:\n print("Ye... | ['Runtime Error', 'Accepted'] | ['s845385668', 's939449313'] | [9208.0, 9248.0] | [24.0, 28.0] | [781, 782] |
p02761 | u001024152 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['print(-1)', 'import sys\nN, M = map(int, input().split())\nsc = [tuple(map(int, input().split())) for _ in range(M)]\n\nfor i in range(0, 1000):\n ok = True\n for si, ci in sc:\n if (i//10**(N-si)) % 10 != ci:\n ok = False\n if ok and len(str(i)) == N:\n print(i)\n sys.exit()\... | ['Wrong Answer', 'Accepted'] | ['s562623772', 's114798444'] | [2940.0, 3060.0] | [17.0, 18.0] | [9, 314] |
p02761 | u001687078 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ["N,M = map(int, input().split())\nsc = [list(map(int, input().split())) for _ in range(M)]\nx = [-1]*N\nfor s,c in sc:\n s -= 1\n if x[s] == -1 or x[s] == c:\n x[s] = c\n else:\n print(-1)\n exit()\nif N!=1 and x[0]==0:\n print(-1)\n exit()\nif x[0]==-1:\n x[0]=1\nif N>=2 and x[1... | ['Wrong Answer', 'Accepted'] | ['s784711493', 's055968997'] | [3064.0, 3064.0] | [18.0, 17.0] | [391, 433] |
p02761 | u003475507 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n,m=map(int,input().split())\n\nr=""\nfor i in range(n):\n if i == 0:r += \'1\'\n else : r+=\'0\'\nr = list(r)\n\nk ={}\nfor _ in range(m):\n x,y = map(int,input().split())\n\n if x == 1 and y == 0: print(\'-1\');exit()\n\n if k.get(x) and k[x] != y: print(\'-1\');exit()\n else: k[x] = y\n\nfor i,j ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s588869857', 's980863090', 's906152328'] | [3064.0, 9144.0, 3064.0] | [17.0, 30.0, 17.0] | [349, 291, 376] |
p02761 | u007018214 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['import sys\nn,m = map(int,input().split())\nans = [0] * n\nprint(ans)\nfor i in range(m):\n s,c = map(int,input().split())\n if ans[s-1] != 0 and ans[s-1] != c:\n print(-1)\n sys.exit()\n ans[s-1] = c\nt=""\nfor i in ans:\n t += str(i)\nt = int(t)\nif len(str(t)) != n:\n print(-1)\n sy... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s727015106', 's776743877', 's865589787'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [324, 324, 430] |
p02761 | u007263493 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ["n , m = map(int,input().split())\nx = [0]\ny = [0]\nz = [0]\n\nfor i in range(m):\n s , c = map(int,input().split())\n if s ==1:\n x.append(c)\n elif s==2:\n y.append(c)\n elif s == 3:\n z.append(c)\n\n\nif n ==1:\n if len(set(x)) > 2:\n print('-1')\n else:\n print... | ['Wrong Answer', 'Accepted'] | ['s336371761', 's056129283'] | [3064.0, 3064.0] | [17.0, 18.0] | [831, 833] |
p02761 | u008079810 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ["N,M=map(int,input().split())\n\nflag=True\nex=[False]*(N)\nprint(ex)\nfor i in range(M):\n S,C=map(int,input().split())\n if ex[S-1]==False or ex[S-1]==str(C):\n ex[S-1]=str(C)\n else:\n flag=False\n break\n\nif N>1 and ex[0]==str(0):\n flag=False\n\nif flag:\n for i in range(N-1):... | ['Wrong Answer', 'Accepted'] | ['s787526017', 's518073345'] | [3188.0, 3064.0] | [18.0, 17.0] | [493, 483] |
p02761 | u010870870 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['N,M =map(int, input().split())\na = [input().split() for l in range(M)]\n\nfor i in range(M):\n for j in range(2):\n a[i][j]=int(a[i][j])\n\na.sort()\nfor i in range(M-1):\n if a[i]==a[i+1]:\n a[i]=[0,0]\nans = 10**(N-1)\n\nfor i in range(M):\n if a[i][0]==1 ans a[i][1]!=0:\n ans += (a[i... | ['Runtime Error', 'Accepted'] | ['s277828225', 's160628133'] | [3060.0, 3064.0] | [18.0, 18.0] | [616, 355] |
p02761 | u017624958 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ["N, M = list(map(int, input().split()))\nsc = [list(map(int, input().split())) for i in range(M)]\n\nanswer = [None] * N\nfor si, ci in sc:\n digit = si - 1\n if answer[digit] is not None and answer[digit] != ci:\n print(-1)\n exit()\n \n answer[digit] = ci\n\nfor i, value in enumerate(answer... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s153542397', 's300742905', 's301819778', 's607328210', 's618778152', 's897712970', 's439218436'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [19.0, 18.0, 17.0, 17.0, 18.0, 17.0, 18.0] | [476, 443, 393, 432, 465, 491, 596] |
p02761 | u018679195 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ["M = int(M)\nN = int(N)\nans = ['0' for i in range (N)]\nfl = True\n\nfor i in range (M) :\n s , c = input().split()\n s = int(s) - 1\n if (s == 0 and c == '0') :\n fl = False\n if (ans[s] != '0') :\n if (ans[s] != c) :\n fl = False\n else :\n ans[s] = c\n\nres = ''\n\nif... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s408372645', 's500925044', 's923348854', 's805615966'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0] | [403, 343, 394, 593] |
p02761 | u018771977 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['#! env/bin/local python3\n# -*- coding: utf-8 -*-\n\nconditions = []\n\nn, m = map(int, input().split())\nwhile True:\n try:\n conditions.append(list(map(int, input().split())))\n except EOFError:\n break\n\nnumber: list = [0] * n\n\nis_ok = True\nfor c in conditions:\n if number[c[0]-1] == 0 o... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s213031722', 's461427689', 's735618954'] | [2940.0, 20640.0, 3188.0] | [17.0, 294.0, 21.0] | [482, 638, 458] |
p02761 | u021548497 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n, m = map(int, input().split())\nans = 10**(n-1)\n\njudge = [0]*m\nfor i in range(m):\n judge[i] = [int(x) for x in input().split()]\n\nflag = False\nwhlie ans < 10**n:\n ans = str(ans)\n for i in range(m):\n if ans[judge[i][0]-1] != judge[i][1]:\n break\n if i == m-1:\n print(int(ans))\n fla... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s606805188', 's971873543', 's854201923'] | [2940.0, 3064.0, 3064.0] | [16.0, 18.0, 17.0] | [393, 338, 530] |
p02761 | u028014940 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['\nN, M = map(int, input().split())\n\nif 4 <= M <= 5:\n print("-1")\n\nelif M == 0:\n print("0")\n\nelse:\n None\n', 'N,M = map(int,input().split())\nsc = [tuple(map(int,input().split())) for i in range(M)]\n\nif N==1:\n r = range(0,10)\nelif N==2:\n r = range(10,100)\nelse:\n r = range(100,1000)\n\... | ['Wrong Answer', 'Accepted'] | ['s748582983', 's959958756'] | [2940.0, 3064.0] | [18.0, 18.0] | [112, 340] |
p02761 | u028973125 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['import sys\n\nN, M = map(int, sys.stdin.readline().split())\n\ncond = {}\nflag = True\nfor _ in range(M):\n s, c = map(int, sys.stdin.readline().split())\n if s not in cond:\n if s == 1 and c == 0:\n flag = False\n break\n else:\n cond[s] = c\n else:\n if... | ['Wrong Answer', 'Accepted'] | ['s443212259', 's198824463'] | [3064.0, 3064.0] | [18.0, 17.0] | [542, 636] |
p02761 | u029000441 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['nm=input().rstrip().split(" ")\nn =int(nm[0])\nm= int(nm[1])\nlines=[]\nimport sys\nfor line in sys.stdin.readlines():\n nums=line.rstrip().split()\n lines.append(nums)\n#print(lines)\nlinga=[]\nlingb=[]\n\nlinesd =list(map(list, set(map(tuple, lines))))\nprint(linesd)\nfor i in range(len(linesd)):\n linga.a... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s582635114', 's958149535', 's471800359'] | [3192.0, 3064.0, 3192.0] | [20.0, 20.0, 18.0] | [2039, 883, 1479] |
p02761 | u032222383 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n,m=map(int,input().split())\ns=[]*m\nc=[]*m\nt=[]\nfor i in range(m):\n s[i], c[i]=map(int,input().split())\nfor i in range(n):\n t.append("0")\nfor i in range(m):\n t[s[i]-1]=str(c[i])\nfor i in reversed(range(m)):\n if t[s[i]-1]!=str(c[i]):\n print(-1)\n break\n elif \'\'.join(t)=="000... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s250817617', 's851568444', 's967257077', 's959508206'] | [3064.0, 3064.0, 3064.0, 3060.0] | [18.0, 18.0, 17.0, 18.0] | [386, 374, 464, 216] |
p02761 | u036340997 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n, m = map(int, input().split())\ns = []\nc = []\nfor i in range(m):\n _s, _c = map(int, input().split())\n s.append(_s)\n c.append(_c)\n\ns = [0, 0, 10, 100]\ng = [10, 10, 100, 1000]\nfor i in range(s[n], g[n]):\n i_str = str(i)\n for j in range(m):\n if i_str[s[j]-1] != str(c[j]):\n break\n else:\n ... | ['Runtime Error', 'Accepted'] | ['s808097055', 's907953002'] | [3064.0, 3064.0] | [18.0, 19.0] | [339, 343] |
p02761 | u038408819 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n, m = map(int, input().split())\nsc = [list(map(int, input().split())) for i in range(m)]\ns = [0] * n\nfor i in sc:\n s[i[0]-1] = str(i[1])\nans = ""\nfirst = True\nfor i in s:\n if i == 0 and first and len(s) != 1:\n ans += str(1)\n first = False\n continue\n ans += str(i)\nif len(ans... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s007561807', 's091381672', 's198358882', 's355415635', 's647325799', 's797463190', 's957947068', 's822505227'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [24.0, 17.0, 17.0, 17.0, 18.0, 17.0, 18.0, 18.0] | [362, 365, 368, 327, 364, 349, 364, 425] |
p02761 | u038887660 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n, m = map(int, input().split())\nsc = {}\nfor m2 in range(m):\n sc[m2]=input().split()\ndic = {}\nnum = 0\n \nfor li in sc.values():\n if int(li[0]) == 1:\n if n >= 2:\n if int(li[1]) == 0:\n num = -1\n break\n if li[0] in dic.keys():\n if li[1] != dic[... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s325191246', 's997383676', 's464856921'] | [3064.0, 3060.0, 3064.0] | [18.0, 17.0, 20.0] | [562, 318, 480] |
p02761 | u044964932 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['def main():\n n, m = map(int, input().split())\n ans = [0]*n\n for _ in range(m):\n s, c = map(int, input().split())\n if ans[s-1] == 0:\n ans[s-1] = c\n elif ans[s-1] != 0 and ans[s-1] != c:\n print(-1)\n exit()\n\n if len(ans[0]) == 1:\n print... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s217121386', 's240443046', 's132509221'] | [3064.0, 3064.0, 3064.0] | [19.0, 17.0, 18.0] | [431, 437, 609] |
p02761 | u046158516 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['def convert(s): \n \n # initialization of string to "" \n new = "" \n \n # traverse in the string \n for x in s: \n new += x \n \n # return string \n return new \n\nn,m=map(int,input().split())\na=[]\nfor i in range(n):\n a.append(0)\nb=[]\nif n==1:\n b.append(0)\nelse:\n b.append(1)... | ['Wrong Answer', 'Accepted'] | ['s592372535', 's688788779'] | [3064.0, 3064.0] | [17.0, 18.0] | [580, 601] |
p02761 | u047012797 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['nm = [int(i) for i in input().split()]\nn = nm[0]\nm = nm[1]\nslist = []\nclist = []\nfor i in range(m):\n sc = [int(i) for i in input().split()]\n slist.append(sc[0])\n clist.append(sc[1])\n\nfl = 0\nif (n == 1):\n if (slist[0] == 1 and clist[0] == 0):\n print(\'-1\')\n fl = 1\n\nanswerlist = [\'-1\' for i... | ['Runtime Error', 'Accepted'] | ['s007657473', 's890634827'] | [3064.0, 3064.0] | [18.0, 18.0] | [713, 808] |
p02761 | u051401873 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['n , m = map(int, input().split())\ns = []\nc = []\nans = [str(0) for _ in range(n)]\n\nfor _ in range(m):\n st, ct = map(int, input().split())\n if(ans[st-1] != "0"):\n print(-1)\n quit()\n ans[st-1] = str(ct)\nans = "".join(ans)\nif len(str(int(ans))) < n:\n print(-1)\nelse:\n print(ans)\n', 'n , m =... | ['Wrong Answer', 'Accepted'] | ['s477762199', 's486055357'] | [3064.0, 3064.0] | [17.0, 17.0] | [290, 441] |
p02761 | u052244548 | 2,000 | 1,048,576 | If there is an integer not less than 0 satisfying the following conditions, print the smallest such integer; otherwise, print `-1`. * The integer has exactly N digits in base ten. (We assume 0 to be a 1-digit integer. For other integers, leading zeros are not allowed.) * The s_i-th digit from the left is c_i. \lef... | ['import itertools\nimport functools\nimport math\nfrom collections import Counter\nfrom itertools import combinations\nimport re\n\n\n\n\nN,M=map(int,input().split())\n\n\nans = ["."] * N\n\nfor i in range(M):\n S,C=map(int,input().split())\n\n \n if ans[S-1] not in (".",C):\n print(-1)\n exit()... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s063599060', 's085782429', 's840741141', 's411583422'] | [9856.0, 9512.0, 9804.0, 9888.0] | [38.0, 34.0, 37.0, 34.0] | [1123, 659, 493, 1139] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.