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 | u619144316 | 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... | ['if __name__ == \'__main__\':\n m = [input() for _ in range(3)]\n n = input()\n a = [int(input()) for _ in range(int(n))]\n c =[]\n for i in m:\n b = [int(j) for j in i.split()]\n c.append(b)\n\n for n,i in enumerate(c):\n for m,j in enumerate(i):\n if j in a:\n ... | ['Wrong Answer', 'Accepted'] | ['s897912541', 's202275724'] | [3064.0, 3064.0] | [18.0, 20.0] | [951, 576] |
p02760 | u624075921 | 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... | ["mat=[]\n\nfor i in range(3):\n inp = [int(x) for x in input().split()]\n mat.append(inp)\n \nn = int(input())\n\nfor _ in range(n):\n q = int(input())\n for i in range(3):\n if q in mat[i]:\n ind = mat[i].index(q)\n mat[i][ind] = '1'\n break\n \nif mat[0][0]==... | ['Wrong Answer', 'Accepted'] | ['s178604419', 's073127311'] | [3064.0, 3188.0] | [18.0, 20.0] | [942, 942] |
p02760 | u624613992 | 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 for k in range(n):\n if a[i][j] == b[k]:\n a[i][j] = 0\n\nans = "No"\nfor i in range(3):\n if a[i][0] + a[i][1] + a[i][2] ... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s782806744', 's997382509', 's169444491'] | [3064.0, 3064.0, 3192.0] | [17.0, 18.0, 17.0] | [495, 497, 496] |
p02760 | u624617831 | 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 bingo = []\n for i in range(3):\n a = list(map(int, input().split()))\n bingo.append(a)\n \n n = int(input())\n for j in range(n):\n b = int(input())\n\n for k in range(3):\n for l in range(3):\n if int(bingo[k][l]) == b:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s624320059', 's642163098', 's971695748', 's122780521'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0, 18.0] | [706, 662, 693, 766] |
p02760 | u625864724 | 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... | ['b = []\nfor i in range(3):\n lst = list(map(int,input().split()))\n b.append(lst)\nn = int(input())\nfor i in range(n):\n a = int(input())\n for j in range(3):\n for k in range(3):\n if (b[j][k] == a):\n b[j][k] = 0\nif (b[0][0] = b[0][1] = b[0][2] or b[1][0] = b[1][1] = b[1][2] or b[2][0] = b[2][1... | ['Runtime Error', 'Accepted'] | ['s350930189', 's565915844'] | [9012.0, 9276.0] | [24.0, 33.0] | [513, 530] |
p02760 | u626228246 | 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()))\nB = list(map(int,input().split()))\nC = list(map(int,input().split()))\nN = int(input())\nM = [int(input()) for i in range(N)]\n\nfor m in range(M):\n if M[m] in A:\n A[M[m]] = 0\n elif M[m] in B:\n B[M[m]] = 0\n elif M[m] in C:\n C[M[m]] = 0\n\nfor t in ran... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s023446456', 's330706788', 's331867716', 's244883208'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0] | [565, 533, 566, 576] |
p02760 | u626361595 | 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 = []\ntmp = input()\nbingo.append(tmp.split(' '))\ntmp = input()\nbingo.append(tmp.split(' '))\ntmp = input()\nbingo.append(tmp.split(' '))\nfor i in len(bingo):\n bingo[i] = [int(bingo[i][0]), int(bingo[i][1]), int(bingo[i][2])]\n\nn = input()\ndata = []\narr = range(int(n))\narr = list(arr)\nfor count in a... | ['Runtime Error', 'Accepted'] | ['s242817987', 's743909429'] | [3192.0, 3192.0] | [17.0, 18.0] | [1278, 1292] |
p02760 | u626881915 | 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... | ['mat = [[False]*3 for i in range(3)]\na_mat = []\nfor i in range(3):\n a_list = list(map(int, input().split()))\n a_mat.append(a_list)\nn = int(input())\nfor i in range(n):\n b = int(input())\n for x in range(3):\n for y in range(3):\n if a_mat[x][y] == b:\n mat[x][y] = True\n\nif mat[0][0] and mat[... | ['Runtime Error', 'Accepted'] | ['s233500732', 's337073670'] | [3188.0, 3064.0] | [18.0, 18.0] | [668, 662] |
p02760 | u627417051 | 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... | ['60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n', '\nimport sys\ninput = sys.stdin.buffer.readline\n\n\nfrom collections import defaultdict\n\ncon = 10 ** 9 + 7\n\ndef getlist():\n\treturn list(map(int, input().split()))\n\n\ndef main():\n\tA = []\n\tfor i in range(3):\n\t\ta = getlist()\n\... | ['Runtime Error', 'Accepted'] | ['s969249823', 's462675516'] | [2940.0, 3444.0] | [17.0, 26.0] | [60, 918] |
p02760 | u628581330 | 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 = [map(int,input().split()) for a in range(3)]\na1 = [a[0][0],a[0][1],a[0][2]]\na2 = [a[1][0],a[1][1],a[1][2]]\na3 = [a[2][0],a[2][1],a[2][2]]\na4 = [a[0][0],a[1][1],a[2][2]]\na5 = [a[0][2],a[1][1],a[2][0]]\na6 = [a[0][0],a[1][0],a[2][0]]\na7 = [a[0][1],a[1][1],a[2][1]]\na8 = [a[0][2],a[1][2],a[2][2]]\nn = int(inpu... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s313802600', 's332092095', 's633256034', 's693664105', 's926700859', 's393071701'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 17.0, 17.0] | [558, 549, 549, 400, 509, 557] |
p02760 | u629350026 | 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 a1,a2,a3=map(int,input().split())\n a.append(a1,a2,a3)\nn=int(input())\nfor i in range(n):\n b=int(input())\n for j in range(9):\n if a[j]==b:\n a[j]=0\nif a[0]==0 and a[1]==0 and a[2]==0:\n print("Yes")\nelif a[3]==0 and a[4]==0 and a[5]==0:\n print("Yes")\nelif a[6]==0 and a... | ['Runtime Error', 'Accepted'] | ['s473369711', 's939371163'] | [3064.0, 3064.0] | [17.0, 18.0] | [623, 647] |
p02760 | u629540524 | 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 k in range(n):\n b = int(input())\n for i in range(3):\n for j in range(3):\n if a[i][j] == b:\n a[i][j] = -1\nf = False\nfor i in range(3):\n for j in range(3):\n if (a[0][0] == a[0][1] == a... | ['Wrong Answer', 'Accepted'] | ['s628090348', 's697425822'] | [9296.0, 9280.0] | [29.0, 30.0] | [744, 735] |
p02760 | u630027862 | 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... | ["x = [input().split() for i in range(3)]\nN = int(input())\nb = [int(input()) for n in range(N)]\nl = [[0]*3, [0]*3, [0]*3]\nfor val in b:\n for i in range(3):\n for j in range(3):\n print(val)\n if val == int(x[i][j]):\n l[i][j] = 1\nif l[0][0] + l[0][1] + l[0][2] == 3:\... | ['Runtime Error', 'Accepted'] | ['s371177646', 's806887728'] | [3192.0, 3064.0] | [23.0, 17.0] | [738, 715] |
p02760 | u640123177 | 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... | ['li_a = list(map(int, input().split()))\nli_b = list(map(int, input().split()))\nli_c = list(map(int, input().split()))\nli_d = [li_a[0], li_b[0], li_c[0]]\nli_e = [li_a[1], li_b[1], li_c[1]]\nli_f = [li_a[2], li_b[2], li_c[2]]\nli_g = [li_a[0], li_b[1], li_c[2]]\nli_h = [li_a[2], li_b[1], li_c[0]]\nn = int(input())\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s818894331', 's921351752', 's318440845'] | [3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0] | [775, 776, 906] |
p02760 | u642528832 | 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 = [list(map(int,input().split())) for i in range(3)]\nbingo_list = sum(bingo_list,[])\nn = int(input())\nbingo_number = [int(input())for i in range(n)]\ncheck_list = [0 for i in range(9)]\n\nfor j in bingo_number:\n if j in bingo_list:\n check_list[bingo_list.index(j)] = 1\n\nif [1,1,1] in [check... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s177917605', 's193630130', 's251517060', 's903044980'] | [8992.0, 9060.0, 8960.0, 9112.0] | [25.0, 22.0, 23.0, 29.0] | [478, 477, 505, 485] |
p02760 | u646412443 | 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)]\nbingo = [[0 for _ in range(3)] for _ in range(3)]\nprint(bingo)\nfor i in range(n):\n for j in range(3):\n for k in range(3):\n if a[j][k] == b[i]:\n bingo[j][k] = True\... | ['Wrong Answer', 'Accepted'] | ['s601706500', 's916557541'] | [3064.0, 3064.0] | [18.0, 17.0] | [781, 674] |
p02760 | u646892595 | 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(list(map(int, input().split())))\nN = input()\nN = int(N)\nB = []\nfor _ in range(N):\n b = input()\n B.append(int(b))\nnpA = np.array(A)\ncheck = 'no'\nfor a in npA:\n if a[0] in B and a[1] in B and a[2] in B:\n check = 'yes'\nfor a in np... | ['Wrong Answer', 'Accepted'] | ['s595175539', 's372139985'] | [12504.0, 12504.0] | [150.0, 150.0] | [572, 572] |
p02760 | u647679586 | 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... | ["row_1 = list(map(int, input().split()))\nrow_2 = list(map(int, input().split()))\nrow_3 = list(map(int, input().split()))\nN = int(input())\nnumbers_called = []\nfor i in range(N):\n b = int(input())\n numbers_called.append(b)\n\ncol_1 = [row_1[0], row_2[0], row_3[0]]\ncol_2 = [row_1[1], row_2[1], row_3[1]]\nco... | ['Wrong Answer', 'Accepted'] | ['s050712665', 's721751540'] | [9168.0, 9260.0] | [27.0, 25.0] | [759, 811] |
p02760 | u651314218 | 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())\nnum_count = int(input())\nnumber_list = [0] * num_count\nfor i in range(num_count):\n number_list[i] = int(input())\n\nbingo_map = [[a, b, c], [d, e, f], [g, h, i]]\nbingo_answer = [[0, 0, 0], [0, 0, 0], ... | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s019381684', 's021214810', 's462201256', 's536086136'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0] | [1187, 1173, 1177, 1187] |
p02760 | u655048024 | 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_1 = list(map(int,input().split()))\na_2 = list(map(int,input().split()))\na_3 = list(map(int,input().split()))\na = [a_1,a_2,a_3]\nn = int(input())\nfor i in range(n):\n h = int(input())\n for j in range(3):\n for k in range(3):\n if(a[j][k]==h):\n a[j][k]=0\nans = "No"\nfor i in range(3):\n if(le... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s860119928', 's916510622', 's736112133'] | [9228.0, 8960.0, 9292.0] | [28.0, 25.0, 30.0] | [578, 624, 624] |
p02760 | u656803083 | 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... | ['map_list = [int,input().split() for x in range(3)]\n\nn = int(input())\nfor i in range(n):\n a = int(input())\n ', 'map_list = [list(map(int,input().split())) for x in range(3)]\n \nn = int(input())\nfor i in range(n):\n a = int(input())\n for i in range(3):\n for j in range(3):\n if map_list[i][j] == a:\... | ['Runtime Error', 'Accepted'] | ['s584279956', 's457971044'] | [8836.0, 9220.0] | [25.0, 29.0] | [109, 542] |
p02760 | u657329920 | 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 = input().split()\n a = [int(num) for num in a]\n A.append(a)\n\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 b.count(A[i][j]) != 0:\n A[i][j] = 0\n else:\n continue\n\nif (sum(A[0]) or sum(A[1]) or sum(A[2])\... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s213811743', 's617987442', 's737893021', 's905480751', 's450456862'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 17.0, 17.0] | [455, 519, 464, 541, 559] |
p02760 | u658987783 | 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())\n\nn=int(input())\n\ncard=[a11,a12,a13,a21,a22,a23,a31,a32,a33]\ndef isBingo():\n if ( (card[0] == -1 and card[1] == -1 and card[2] == -1) \\\n or (card[3] == -1 and card[4] == -1 and card[5] == -1)... | ['Wrong Answer', 'Accepted'] | ['s433571404', 's156942877'] | [3064.0, 3188.0] | [17.0, 21.0] | [910, 928] |
p02760 | u665452497 | 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\nimport numpy as np\n\ncard = np.array([list(map(int, input().split())) for _ in range(3)])\nn = int(input())\n\nfor _ in range(n):\n num = int(input())\n if num in card:\n pos = tuple(nd[0] for nd in np.where(card == num))\n print(pos)\n card[pos[0], pos[1]] = 0\n\nf = 0\n\... | ['Wrong Answer', 'Accepted'] | ['s135204439', 's396622444'] | [12440.0, 21448.0] | [149.0, 964.0] | [528, 509] |
p02760 | u666961261 | 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... | ['class CircularQueue(): \n \n # constructor \n def __init__(self, size): # initializing the class \n self.size = size \n \n # initializing queue with none \n self.queue = [None for i in range(size)] \n self.front = self.rear = -1\n \n def enqueue(self, data): \n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s578233580', 's674838552', 's926647064'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [2157, 500, 766] |
p02760 | u670606123 | 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()))\nb_list = list(map(int, input().split()))\nc_list = list(map(int, input().split()))\nN = int(input())\nd_list = [int(input()) for k in range(N)]\n\nfor n in range(3):\n for p in range(3):\n if d_list[n] == a_list[p]:\n a_list[p] = 555\n for q in range(3... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s374199400', 's646888965', 's241524702'] | [3192.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0] | [969, 1022, 1022] |
p02760 | u672370694 | 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())\nnum = [int(input()) for i in range(n)]\nBingo.append([Bingo[0][0] , Bingo[1][1],Bingo[2][2] ])\nBingo.append([Bingo[0][2] , Bingo[1][1],Bingo[2][0] ])\nk=0\nre = 'No'\nfor l in range(3):\n if len(list(set(num) & set(Bingo[l]))) == 3:\n ... | ['Wrong Answer', 'Accepted'] | ['s578599842', 's421067018'] | [3064.0, 3064.0] | [17.0, 18.0] | [340, 425] |
p02760 | u674052742 | 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 -*-\n"""\nCreated on Tue Mar 3 22:38:51 2020\n\n@author: Kanaru Sato\n"""\n\nA = []\n[A.append(list(map(int, input().split()))) for i in range(0,3)]\n\nN = int(input())\n\nb = []\n[b.append(list(map(int, input()))) for i in range(0,N)]\n\nflag = [[0, 0, 0]\n [0, 0, 0]\n [0, 0, 0]]\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s205050108', 's741043159', 's260264155'] | [3192.0, 3064.0, 3064.0] | [17.0, 19.0, 17.0] | [694, 698, 686] |
p02760 | u674064321 | 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_input = input().split()\n a.append(int(a_input))\n\nfor i in range(n):\n x = input()\n for j in range(3):\n for k in range(3):\n if x == int(a[j][k]):\n a[j][k] = "0"\n\nfor i in range(3):\n if a[0][i] == "0" and a[0][i] == a[1][i] and a[0][i] == a[2][i]:\n pri... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s083041966', 's843360579', 's101195451'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [611, 606, 661] |
p02760 | u674190122 | 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 row_sums(B):\n return sum(B[0])==0 or sum(B[1])==0 or sum(B[2]) == 0\n\ndef diagonal_sum(M):\n i,j = -1,-1\n sums = 0\n for _ in range(3):\n i += 1\n j += 1\n sums += M[i][j]\n return sums == 0\n\ndef column_sum(M):\n columns = list(zip(*M))\n return row_sums(columns)\n\... | ['Wrong Answer', 'Accepted'] | ['s991460361', 's026986961'] | [3064.0, 3064.0] | [18.0, 18.0] | [893, 383] |
p02760 | u674418975 | 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... | ["up = list(input().split())\nmid = list(input().split())\ndown = list(input().split())\n\ntable = [up, mid, down]\n# print(table)\nnums = []\nwhile True:\n try:\n nums.append(input())\n except EOFError:\n break\n# print(nums)\n\nfor i in range(3):\n for j in range(3):\n if table[i][j] in nums:\... | ['Wrong Answer', 'Accepted'] | ['s977439136', 's567844824'] | [3064.0, 3064.0] | [17.0, 17.0] | [1097, 1062] |
p02760 | u677842374 | 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 = []\nB = []\ncnt = 0\n\nfor i in range(3):\n A.append(list(map(int, input().split())))\n\nN = int(input())\n\nfor i in range(N):\n B.append(int(input()))\n\nfor i in range(3):\n for j in range(3):\n for k in B:\n if A[i][j] == k:\n A[i][j] = 0\n\nfor i in range(3): ... | ['Wrong Answer', 'Accepted'] | ['s066474760', 's659467017'] | [3064.0, 3064.0] | [17.0, 17.0] | [678, 737] |
p02760 | u678505520 | 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 check(a,b):\n if a==b:\n a=-1\n\nA1=list(map(int,input().split()))\nA2=list(map(int,input().split()))\nA3=list(map(int,input().split()))\nN=int(input())\n\ni = 0\nj = 0\nwhile i<N:\n b = int(input())\n while j<3:\n check(A1[j],b)\n while j<3:\n check(A2[j],b)\n while j<3:\n ... | ['Time Limit Exceeded', 'Wrong Answer', 'Time Limit Exceeded', 'Accepted'] | ['s692064692', 's859822522', 's868452453', 's497097913'] | [3064.0, 3064.0, 3064.0, 3064.0] | [2104.0, 20.0, 2104.0, 17.0] | [543, 591, 586, 306] |
p02760 | u679089074 | 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... | ['#7\nA = [list(map(int,input().split())) for i in range(3)]\n\nN = int(input())\n\nB = [int(input()) for i in range(N)]\n\nC = [[0,0,0],[0,0,0],[0,0,0]]\nAns = "No"\n\nfor i in range(3):\n for j in range(3):\n if A[i][j] in B: \n C[i][j] = 1\n\nfor i in range(3):\n if C[i][1]+C[i][2]+C[... | ['Runtime Error', 'Accepted'] | ['s971240400', 's348595650'] | [9252.0, 9108.0] | [27.0, 28.0] | [580, 580] |
p02760 | u685510108 | 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 = list(map(int, input().split()))\n A.append(a)\n\nN = int(input())\n\nB = []\nfor i in range(N):\n B.append(int(input()))\n\nfor b in B:\n for i in range(3):\n for j in range(3):\n if b == A[i][j]:\n A[i][j] = 0\n\nans = "NO"\nfor i in range... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s197224266', 's242196879', 's908800412', 's264418691'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 17.0, 18.0] | [609, 609, 622, 609] |
p02760 | u685684561 | 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... | ["a0,a1,a2=map(int,input().split())\na3,a4,a5=map(int,input().split())\na6,a7,a8=map(int,input().split())\nN=int(input())\nb=[input() for i in range(N)]\n\nc=range(9)\nlists=[]\nlists.append(a0)\nlists.append(a1)\nlists.append(a2)\nlists.append(a3)\nlists.append(a4)\nlists.append(a5)\nlists.append(a6)\nlists.append(a7)... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s009175660', 's892620791', 's214642428'] | [3192.0, 3188.0, 3192.0] | [19.0, 18.0, 19.0] | [1167, 1039, 1136] |
p02760 | u686713618 | 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=[list(map(int,input().split())) for i in range(3)]\nN=int(input())\nb=[int(input()) for i in range(N)]\nfor i in range(N):\n for j in range(3):\n for k in range(3):\n if A[j][k]==b[i]:\n A[j][k]=0\nif (A[0][0]==A[0][1]==A[0][2]==0) or (A[1][0]==A[1][1]==A[1][2]==0) or (A[2][0]... | ['Runtime Error', 'Accepted'] | ['s351358878', 's745553995'] | [3064.0, 3064.0] | [17.0, 17.0] | [549, 627] |
p02760 | u692498898 | 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... | ["d=[list(map(int,input().split()))for i in range(3)]\nrow=int(input())\nnum=[int(input()) for j in range(row)]\nbingo=0\nfor a in range(3):\n if d[0][a] and d[1][a] and d[2][a] in num:\n bingo=bingo+1\n elif d[a][0] and d[a][1] and d[a][1] in num:\n bingo=bingo+1\nif d[1][1] and d[2][2] and d[3][3] in num:\n ... | ['Runtime Error', 'Accepted'] | ['s934206272', 's677808257'] | [3064.0, 3064.0] | [18.0, 17.0] | [429, 481] |
p02760 | u692632484 | 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=[[int(i) for i in input().split()] for _ in range(3)]\nN=int(input())\nfor _ in range(N):\n b=int(input())\n for i in range(3):\n for j in range(3):\n if A[i][j]==b:\n A[i][j]=-1\nflag=False\nfor h in range(3):\n cnt=0\n for w in range(3):\n if A[h][w]==-1:\n ... | ['Runtime Error', 'Accepted'] | ['s061899429', 's874644646'] | [3064.0, 3064.0] | [17.0, 17.0] | [628, 683] |
p02760 | u693134887 | 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 = [int(x) for x in input().split()]\na2 = [int(x) for x in input().split()]\na3 = [int(x) for x in input().split()]\nn = int(input())\nb = []\nfor _ in range(n):\n b.append(input())\nres = ""\nfor x in b:\n if int(x) == int(a1[0]):\n print(x)\n res += "1"\n if int(x) == int(a2[1]):\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s229069163', 's946610209', 's324974884'] | [3064.0, 3192.0, 3064.0] | [17.0, 18.0, 17.0] | [420, 1514, 907] |
p02760 | u693200186 | 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 l in range(3)]\nn = int(input())\nb = [input() for i in range(n)]\nc = [a[0][0],a[1][1],a[2][2]]\nd = [a[0][2],a[1][1],a[2][0]]\ntate1 = len(set(a[0]) & set(b))\ntate2 = len(set(a[1]) & set(b))\ntate3 = len(set(a[2]) & set(b))\nyoko1 = len(set([x[0] for x in a]) & set(b))\nyoko2 = len(set([x[... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s198461182', 's495810988', 's958013058'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [555, 580, 553] |
p02760 | u693933222 | 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\n\na = []\n\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\n\na = np.array(a)\n\n#print(a)\n\nn = int(input())\n\nfor i in range(n):\n b = int(input())\n for j in a:\n for k in j:\n if (k == b):\n k = 0\n break\n\nans = m... | ['Wrong Answer', 'Accepted'] | ['s330760016', 's415639916'] | [14412.0, 3064.0] | [150.0, 17.0] | [487, 499] |
p02760 | u696010640 | 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())\n\nval = 0\nflag = False\n\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] = 0\n\nval = 0\nfor i in range(3):\n val += A[i]\nif val == 0:\n ... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s614768722', 's707608003', 's969005412', 's657304862'] | [9000.0, 9176.0, 9160.0, 9168.0] | [24.0, 30.0, 24.0, 26.0] | [597, 599, 526, 602] |
p02760 | u696969901 | 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_ROW_NO = 3\n\nA = []\nfor i in range(BINGO_ROW_NO):\n A.append(input().split())\nprint(A)\n\nN = int(input())\n\n\n\ndef SetBingo(A, b):\n for y in range(BINGO_ROW_NO - 1):\n for x in range(BINGO_ROW_NO - 1):\n if A[y][x] == b:\n A[y][x] = ''\n return \n ... | ['Wrong Answer', 'Accepted'] | ['s371229255', 's365204475'] | [3064.0, 3064.0] | [17.0, 17.0] | [902, 842] |
p02760 | u697101155 | 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\nimport sys\n\nA = []\nfor i in range(3):\n row = list(map(int, input().split()))\n A.append(row)\nN = int(input())\nb = []\nfor i in range(N):\n k = int(input())\n b.append(k)\n\nfor k in b:\n for row in A:\n for elem in row:\n if k == elem:\n elem =... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s267520848', 's427634107', 's598324660', 's937538724', 's757297793'] | [12504.0, 13216.0, 13408.0, 12484.0, 12484.0] | [154.0, 164.0, 150.0, 150.0, 149.0] | [710, 674, 713, 714, 755] |
p02760 | u700138719 | 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... | ['list1 = []\nfor x in range(3):\n list1.append([int(i)for i in input().split()])\nn = int(input())\nindices = []\nfor x in range(n):\n val = int(input())\n if val in list1[0]:\n indices.append([list1[0].index(val),0])\n elif val in list1[1]:\n indices.append([list1[1].index(val),1])\n elif... | ['Wrong Answer', 'Accepted'] | ['s205026883', 's123008153'] | [3064.0, 3064.0] | [17.0, 17.0] | [1003, 1085] |
p02760 | u703214333 | 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)]\nmaze=[["*" for i in range(3)] for _ in range(3)]\nfor i in range(3):\n for j in range(3):\n for k in range(n):\n if b[i]==a[j][k]:\n maze[j][k]="#"\nfor i in range(3):\n f=1... | ['Runtime Error', 'Accepted'] | ['s684894945', 's911858888'] | [3064.0, 3064.0] | [17.0, 17.0] | [842, 842] |
p02760 | u706785092 | 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 = input().split()\nd, e, f = input().split()\ng, h, i = input().split()\nN = int(input())\n\nnum_list = []\nfor _ in range(N):\n num_list.append(int(input()))\n\nfor j in num_list:\n if a == j:\n a = 101\n if b == j:\n b = 101\n if c == j:\n c = 101\n if d == j:\n d ... | ['Wrong Answer', 'Accepted'] | ['s699921453', 's059400097'] | [3064.0, 3064.0] | [17.0, 17.0] | [811, 841] |
p02760 | u707659359 | 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\ncard = [[int(x) for x in input().split(' ') ] for _ in range(3)]\n\npatterns = []\n\npatterns += [[card[i][j] for i in range(3)] for j in range(3)]\npatterns += [[card[j][i] for i in range(3)] for j in range(3)]\npatterns.append([card[i][i] for i in range(3)])\npatterns.append([card[2-i][2-i] for i in ran... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s038010866', 's778431523', 's810267167', 's831763228'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 18.0] | [542, 603, 561, 569] |
p02760 | u712429027 | 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\ninput = sys.stdin.readline\nins = lambda: input().rstrip()\nini = lambda: int(input().rstrip())\ninm = lambda: map(int, input().rstrip().split())\ninl = lambda: list(map(int, input().split()))\nout = lambda x, s=\'\\n\': print(s.join(map(str, x)))\n\na = inl()\nb = inl()\nc = inl()\nn = ini()\nbingo = []\... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s536923367', 's634795309', 's685363528'] | [9220.0, 9236.0, 9296.0] | [26.0, 32.0, 30.0] | [814, 684, 814] |
p02760 | u719790500 | 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 import itertools\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n c = list(map(int,input().split()))\n d = [a[0],b[0],c[0]]\n e = [a[1],b[1],c[1]]\n f = [a[2],b[2],c[2]]\n g = [a[0],b[1],c[2]]\n h = [a[2],b[1],c[0]]\n n = int(input())\n listB =... | ['Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s709526688', 's724837072', 's814702419', 's906219756', 's631027868'] | [9180.0, 9200.0, 9252.0, 8964.0, 9240.0] | [32.0, 26.0, 21.0, 26.0, 28.0] | [519, 535, 514, 162, 539] |
p02760 | u721425712 | 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... | ["# B\na = []\nfor i in range(3):\n a1, a2, a3 = map(int, input().split())\n a.append(a1)\n a.append(a2)\n a.append(a3)\n \nprint(a)\n \nn = int(input())\nb = []\nfor i in range(n):\n bb = int(input())\n b.append(bb)\n \nfor i in range(n):\n while a.count(b[i]) > 0:\n a[a.index(b[i]... | ['Wrong Answer', 'Accepted'] | ['s320304225', 's446944980'] | [3064.0, 3064.0] | [18.0, 18.0] | [727, 713] |
p02760 | u723345499 | 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... | ['res = False\nfor row in a:\n if all(num in b for num in row):\n res = True\nfor col in zip(a):\n if all(num in b for num in col):\n res = True\nif all(a[i][i] in b for i range(3)):\n res = True\nif all(a[i][2 - i] in b for i range(3)):\n res = True\n\n\nprint("Yes" if res else("No"))... | ['Runtime Error', 'Accepted'] | ['s005068810', 's387412414'] | [2940.0, 3064.0] | [17.0, 17.0] | [305, 452] |
p02760 | u723583932 | 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... | ['#157 b\na=[]\ncall_num=[]\nfor i in range(3):\n x,y,z=map(int,input().split())\n a.append(x)\n a.append(y)\n a.append(z)\nn=int(input())\nfor i in range(n):\n x=int(input())\n if x in a:\n call_num.append(a.index(x))\nbingo\nans=[[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,7],[2,5,8],[0,4,8],[2,4,6]... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s414405562', 's854111939', 's449804571'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0] | [509, 509, 507] |
p02760 | u723711163 | 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 = [ list(map(int, input().split())) for _ in range(3) ]\nt_or_f = [ [False]*3 for _ in range(3) ]\n\nnums = [ r for i in range(3) for r in bingo ]\n\nn = int(input())\nfor _ in range(n):\n i = int(input())\n\n if i in nums:\n for x in range(3):\n for y in range(3):\n if bingo[x][y... | ['Wrong Answer', 'Accepted'] | ['s085434767', 's730714478'] | [3064.0, 3064.0] | [17.0, 18.0] | [726, 687] |
p02760 | u724844363 | 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()))\nseat = [a1, a2, a3]\nn = int(input())\nb = [int(input()) for i in range(n)]\n\nseat_tf = [[False, False, False] for _ in range(3)]\n\nfor k in b:\n for i in range(3):\n for j in range(3):\n ... | ['Wrong Answer', 'Accepted'] | ['s826190468', 's916571612'] | [3064.0, 3064.0] | [21.0, 17.0] | [749, 749] |
p02760 | u727057618 | 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... | ["\ndata = []\nfor j in range(3):\n data.extend([int (i) for i in input().split()])\n\nbingo_dic = {}\nfor i, d in enumerate(data):\n bingo_dic[d] = i\n \nN = int(input())\n\nbingo = [0,0,0,0,0,0,0,0,0]\nfor _ in range(N):\n i = int(input())\n if i in bingo_dic.keys():\n bingo[bingo_dic[i]] = 1\n \nif bingo[... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s171652317', 's283370668', 's879654107'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [833, 832, 832] |
p02760 | u729133443 | 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=lambda a:any(all(b)for b in a)or all(a[i][i]for i in(0,1,2)) \na=eval('list(map(int,input().split())),'*3)\nexec('b=int(input());a=[[u*(u!=b)for u in t]for t in a];'*int(input()))\na=[[not u for u in t]for t in a]\nprint('NYoe s'[f(a)|f(t[::-1]for t in zip(*a))::2])", "s,a=',036,048,246,258,345,678,',open(0).read... | ['Runtime Error', 'Accepted'] | ['s243226875', 's862073311'] | [3060.0, 2940.0] | [18.0, 17.0] | [266, 130] |
p02760 | u729938879 | 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 _ in range(3):\n a.append(list(map(int,input().split()))) \nprint(a)\nn = int(input())\nnum_list = []\nfor _ in range(n):\n num_list.append(int(input()))\n \nflg = False\nfor i in range(3):\n if a[i][0] in num_list and a[i][1] in num_list and a[i][2] in num_list:\n flg = True\n b... | ['Wrong Answer', 'Accepted'] | ['s462588681', 's341098695'] | [3064.0, 3064.0] | [17.0, 18.0] | [512, 831] |
p02760 | u731603651 | 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... | ['\nA1=list(map(int,input().split()))\nA2=list(map(int,input().split()))\nA3=list(map(int,input().split()))\nN=int(input())\nb=[0]*N\nfor i in range(N):\n print(i)\n b[i]=int(input())\nC1=any([i == A1[0] for i in b])\nC2=any([i == A1[1] for i in b])\nC3=any([i == A1[2] for i in b])\nC4=any([i == A2[0] for i in b])\nC... | ['Runtime Error', 'Accepted'] | ['s458896573', 's596377529'] | [3064.0, 3064.0] | [17.0, 18.0] | [622, 629] |
p02760 | u734936991 | 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... | ['60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n', "b = []\nb.append([int(s) for s in input().split()])\nb.append([int(s) for s in input().split()])\nb.append([int(s) for s in input().split()])\n\nn = int(input())\n\nfor i in range(0, n):\n v = int(input())\n\n for i in range(0, 3):\n ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s107395029', 's604950528', 's988355745', 's519544753'] | [2940.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 18.0] | [60, 669, 669, 669] |
p02760 | u738898077 | 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... | ['\nls_a = []\nfor i in range(3):\n ls_a.extend(list(map(int,input().split())))\nn = int(input())\nls_b = [int(input()) for i in range(n)]\n\nfor i in range(9):\n if ls_a[i] in ls_b:\n ls_a[i] = 0\n\nprint(ls_a,ls_b)\nfor i in range(3):\n if ls_a[i] == 0 and ls_a[i+3] == 0 and ls_a[i+6] == 0:\n p... | ['Wrong Answer', 'Accepted'] | ['s830350557', 's867793975'] | [3064.0, 3064.0] | [18.0, 18.0] | [614, 597] |
p02760 | u742729271 | 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())\n\ni = 0\nwhile i<N:\n b = int(input())\n j=0\n while j<3:\n k=0\n while k<3:\n if A[j][k]==b:\n A[j][k]=0\n k+=1\n j+=1\n i+=1\n\nflag = False\ni = 0\nwhile i<3:\n if A[i][0]+A[i][1]+A[i][2] == 0:\n flag = Tru... | ['Runtime Error', 'Accepted'] | ['s616208449', 's502521229'] | [3064.0, 3064.0] | [17.0, 18.0] | [537, 535] |
p02760 | u744521311 | 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... | ['mylist=[]\n\nmylist= map(int,input().rstrip().split())\nmylist= map(int,input().rstrip().split())\nmylist = map(int,input().rstrip().split())\n\nnum = int(input())\n\nfor i in range(num):\n x = map(int,input().rstrip().split())\n k=0\n for j in mylist:\n if j==x:\n mylist[k]=0\n k+=1\n ... | ['Runtime Error', 'Accepted'] | ['s769120995', 's986761574'] | [3064.0, 3064.0] | [18.0, 17.0] | [544, 552] |
p02760 | u748311048 | 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... | ["#N=int(input())\n#N,M=map(int, input().split())\n#L=list(map(int, input().split()))\nL=[]\nCheck=[]\nfor n in range(9):\n Check.append(-(n+1))\n\nfor i in range(3):\n L.append(map(int, input().split()))\n\nN=int(input())\nfor j in range(N):\n I=int(input())\n if I in L:\n Check[L.index(I)]=1\n \nfor k in rang... | ['Wrong Answer', 'Accepted'] | ['s009266009', 's288830285'] | [3188.0, 3064.0] | [19.0, 17.0] | [573, 626] |
p02760 | u750485713 | 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 = [input().split() for i in range(3)]\n\na.extend(b)\na.extend(c)\nb = [input() for i in range(10)]\nfor b1 in b:\n a = [\'a\' if b1 == s in s else s for s in a]\n\nif a[0] == \'a\' and a[1] == \'a\' and a[2] == \'a\':\n print("Yes")\nelif a[3] == \'a\' and a[4] == \'a\' and a[5] == \'a\':\n print("Yes... | ['Runtime Error', 'Accepted'] | ['s356787337', 's473353174'] | [3064.0, 3064.0] | [17.0, 18.0] | [698, 735] |
p02760 | u752522099 | 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 card.append(list(map(int,input().split())))\n\nN = int(input()) \n\nresult = [[0,0,0],[0,0,0],[0,0,0]] \nfor _ in range(N): \n b = int(input()) \n for i in range(3): \n for j in range(3):\n if b == card[i][j]:\n ... | ['Runtime Error', 'Accepted'] | ['s622464067', 's300346244'] | [3064.0, 3064.0] | [17.0, 17.0] | [1256, 1256] |
p02760 | u753635524 | 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\nA = []\n\nflag_First = True\nfor Count in range(3):\n for x in input().split(' '):\n x.strip('\\n')\n InputValue = int(x)\n if 1<=int(x)<=100:\n if flag_First==True:\n A.append (InputValue)\n flag_First = False\n else:\n ... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s387449059', 's493830352', 's721270813', 's929644049', 's932515306', 's995324072', 's149486683'] | [3192.0, 3192.0, 3192.0, 3192.0, 3192.0, 3192.0, 3192.0] | [18.0, 17.0, 18.0, 18.0, 19.0, 18.0, 19.0] | [2029, 2029, 1964, 2035, 2263, 2027, 2135] |
p02760 | u757274384 | 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())\nB = [int(input()) for i in range(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 A[j][k] = "*"\nans = ["*","*","... | ['Wrong Answer', 'Accepted'] | ['s717745233', 's610735011'] | [3064.0, 3064.0] | [17.0, 17.0] | [530, 527] |
p02760 | u758583243 | 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 judge(board):\n for i in range(0, 3):\n if board[i][0] == board[i][1] == board[i][2] == 0 :\n return True\n if board[0][i] == board[1][i] == board[2][i] == 0:\n return True\n \n if board[0][0] == board[1][1] == board[2][2] == 0:\n return True\n if board[0][2]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s116867778', 's482376054', 's373716978'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [1023, 999, 1370] |
p02760 | u761062383 | 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 resolve():\n A = [list(map(int, input().split())) for _ in range(3)]\n N = int(input())\n B = [int(input()) for _ in range(N)]\n punch = [[False for _ in range(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 punch[i][j] = True\n... | ['Runtime Error', 'Accepted'] | ['s919370021', 's646160542'] | [9196.0, 9188.0] | [29.0, 27.0] | [757, 723] |
p02760 | u765325669 | 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... | ['60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34', 'a = [int(j) for i in range(3) for j in input().split(\' \')]\nn = int(input())\nnn = [int(input()) for i in range(n)]\n\nfor ni in nn:\n if ni in a:\n a[a.index(ni)] = 0\n\n \njudge = "Yes"\nif a[4]!=0:\n if a[2]!=0 and a[6]!=0:\n ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s274885024', 's565625669', 's844860027', 's506590871'] | [2940.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0] | [59, 327, 330, 362] |
p02760 | u766566560 | 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 i in range(3)]\nN = int(input())\nb = [input() for i in range(N)]\n\nfor i in range(N):\n\tfor j in range(3):\n\t\tfor k in range(3):\n\t\t\tif A[j][k] == b[i]:\n\t\t\t\tA[j][k] = '○'\n\nfor i in range(3):\n\tif A[i][0] == A[i][1] == A[i][2]:\n\t\tprint('YES')\n\t\texit()\n\telif A[0][i] == A... | ['Wrong Answer', 'Accepted'] | ['s996520251', 's939083019'] | [3064.0, 3064.0] | [17.0, 17.0] | [439, 439] |
p02760 | u768256617 | 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=[]\nfor i in range(3):\n a=list(map(int,input().split()))\n bingo.append(a)\n \nn=int(input())\nfor i in range(n):\n b=int(input())\n for j in range(3):\n if b in bingo[i]:\n bingo[i][bingo[i].index(b)]=0\n \ndef hantei(l):\n for i in range(3):\n if all([l[i][j]==0 for j in range(3)]):\n ... | ['Runtime Error', 'Accepted'] | ['s591801437', 's178499982'] | [9240.0, 9252.0] | [20.0, 30.0] | [608, 630] |
p02760 | u771167374 | 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())\nl = [int(input()) for i in range(n)]\nif (a11 and a12 and a13 in l) or (a21 and a22 and a23 in l) or (a31 and a32 and a33 in l) or (a11 and a21 and a31 in l) or (a22 and a... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s215980405', 's721859114', 's812216292', 's937017323'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [465, 595, 494, 559] |
p02760 | u771538568 | 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... | ['c=[]\nw=0\nfor i in range(3):\n c.append(list(map(int,input().split())))\nN=int(input())\nd=[]\nfor y in range(N):\n d.append(int(input()))\nfor n in d:\n for p in c:\n for j in p:\n if n in j:\n j=0\nfor t in c:\n for h in t:\n if c.count(0)==3:\n o=1\n ... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s036593316', 's616728619', 's670436959', 's645948315'] | [3188.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0, 17.0] | [822, 857, 731, 413] |
p02760 | u773440446 | 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)]\nN = int(input())\nq = [int(input()) for i in range(N)]\nprint(q)\nfor i in range(3):\n for j in range(3):\n for k in range(N):\n\n if l[i][j] == q[k]:\n l[i][j] = 0\n \n if l[0][0] == 0 and l[0][1] == 0 and l[0][2] == 0:\n prin... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s087235942', 's994846361', 's227502310'] | [9264.0, 9212.0, 9220.0] | [30.0, 24.0, 28.0] | [1008, 999, 1000] |
p02760 | u774762906 | 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(map(int,input().split())) for i in range(3)]\nN=int(input())\nb=[]\nfor i in range(N):\n b.append(int(input()))\n\n\nfor i in range(3):\n for j in range(3):\n for x in range(N):\n if A[i][j]==b[x]:\n A[i][j]=0\n\nfor i in range(3):\n if A[i][0]==0 and A[i][1]==0 and... | ['Runtime Error', 'Accepted'] | ['s026409945', 's327195987'] | [3064.0, 3064.0] | [17.0, 18.0] | [622, 730] |
p02760 | u785728112 | 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... | ["for _ in range(3):\n A = list(map(int, input().split())) \nN = int(input())\n\nfor _ in range(N):\n b = int(input())\n for y in range(3):\n for x in range(3):\n if A[y][x] == b:\n A[y][x] = -1\n\nfor y in range(3):\n f = True\n for x in range(3):\n if A[y][x] != -1... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s178757889', 's376882115', 's416118602', 's001585743'] | [9268.0, 9224.0, 9100.0, 9192.0] | [24.0, 23.0, 28.0, 27.0] | [643, 746, 746, 552] |
p02760 | u787059958 | 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\nkey = []\nfor i, v in enumerate(A):\n for k, j in enumerate(v):\n if (j in B):\n key.append([i, k])\n\nans = [[[0, 0], [1, 0], [2, 0]], [[0, 1], [1, 1], [2, 1]], [[0, 2], [1, 2], [2,... | ['Runtime Error', 'Accepted'] | ['s969040284', 's473879213'] | [3064.0, 3444.0] | [17.0, 21.0] | [567, 609] |
p02760 | u789436713 | 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 collections import Counter\nA1=list(map(int,input().split()))\nA2=list(map(int,input().split()))\nA3=list(map(int,input().split()))\nA=[A1,A2,A3]\nN=int(input())\nfor _ in range(N):\n b=int(input())\n \n for tmpA in A:\n if b in tmpA:\n index=tmpA.index(b)\n tmpA[index]=-1\n break\n \n\n \... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s061374285', 's327373319', 's400858257', 's909743050', 's160838565'] | [3064.0, 3064.0, 3444.0, 3064.0, 3436.0] | [17.0, 17.0, 40.0, 20.0, 22.0] | [714, 654, 815, 740, 651] |
p02760 | u791110052 | 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 num in b:\n for x in range(3):\n for y in range(3):\n if a[x][y] == num:\n a[x][y] = 0\n\nif sum(a[0]) == 0 or sum(a[1]) == 0 or sum(a[3]) == 0:\n print("Yes")\nelif sum([a[0][0],a[1... | ['Runtime Error', 'Accepted'] | ['s510981025', 's694845054'] | [3064.0, 3064.0] | [18.0, 18.0] | [579, 584] |
p02760 | u794066762 | 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... | ['\ndef check(grid):\n\tbingo=False\n\t#row\n\tfor i in range(3):\n\t\tcount=0\n\t\tfor j in range(3):\n\t\t\tif grid[i][j]==1:\n\t\t\t\tcount+=1\n\tif count==3:\n\t\tprint(1)\n\t\tbingo=True\n\t#col\n\tcount=0\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tif grid[j][i]==1:\n\t\t\t\tcount+=1\n\tif count==3:\n\t\... | ['Wrong Answer', 'Accepted'] | ['s336735651', 's979961687'] | [3064.0, 3064.0] | [17.0, 18.0] | [851, 812] |
p02760 | u796708718 | 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 = [[],[],[]]\nb = []\n\nfor i in range(0,3):\n A[i] = [int(x) for x in input().split(" ")]\nN = int(input())\nfor i in range(0,N):\n b.append(int(input()))\n\nfor i in range(0,3):\n for j in range(0,3):\n for n in range(0,N):\n if A[i][j] == b[n]:\n A[i][j] = 0\n\nif A[0] == [0,0,0] or A[1] == [... | ['Wrong Answer', 'Accepted'] | ['s571755384', 's492106887'] | [3064.0, 3064.0] | [18.0, 17.0] | [654, 655] |
p02760 | u798260206 | 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().solit()))\na2= list(map(int,input().solit()))\na3= list(map(int,input().solit()))\na = a1 + a2 + a3\n\nn = int(input())\n\n\nfor _ in range(n):\n b = int(input())\n if b in a:\n a[a.index(b)]=0\n \n \ncheck = 0\nfor i in range(3):\n \n if (a[3*i]==a[3*i+1] and a[3*i+1]==a[3*i+2]) or ... | ['Runtime Error', 'Accepted'] | ['s650820195', 's347910993'] | [3064.0, 3064.0] | [17.0, 18.0] | [545, 547] |
p02760 | u798543098 | 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\ngrid = []\nfor i in range(3):\n array = list(map(int,input().strip().split()))\n grid.append(array)\n \ngrid = np.array(grid)\n\nN = int(input().split())\ns = [int(input()) for i in range(N)]\n\nfor i in s:\n b = np.where(grid==i,0,grid)\n \nif grid[0][0]==0 & grid[0][1]==0 & grid... | ['Runtime Error', 'Accepted'] | ['s090826115', 's982755617'] | [20780.0, 12448.0] | [419.0, 151.0] | [838, 883] |
p02760 | u803865203 | 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])\ncheck = np.zeros([3,3])\nchoice = []\nflag = "No"\n\nfor i in range(3):\n a = input().split()\n a = [int(x) for x in a]\n bingo[i] = a\nN = int(input())\nfor i in range(N):\n choice.append(int(input()))\n\nconvert = bingo.reshape([9])\nfor i in range(9):\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s444362755', 's538842435', 's249963413'] | [13736.0, 3064.0, 20692.0] | [159.0, 17.0, 336.0] | [781, 750, 793] |
p02760 | u809816772 | 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 for k in range(N):\n if A[i][j] == B[k]:\n A[i][j] = 0\n\nans = "No"\nfor i in range(3):\n if A[i][0] == 0 and A[i][1] == ... | ['Wrong Answer', 'Accepted'] | ['s241048224', 's481036860'] | [3064.0, 3064.0] | [18.0, 18.0] | [568, 588] |
p02760 | u809819902 | 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()))\nka = a + b + c\nx = int()\nn = int(input())\nfor i in range(n):\n k = int(input())\n if k in ka: ka[ka.index(k)] = x\nprint(ka)\nans = "No"\nif ka[0] == x and ka[1] == x and ka[2] == x:ans = "Yes"\neli... | ['Wrong Answer', 'Accepted'] | ['s826282626', 's612881491'] | [9232.0, 9176.0] | [30.0, 29.0] | [720, 710] |
p02760 | u810288681 | 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 math\nh,w = map(int, input().split())\nprint(1 if h==1 or w==1 else math.ceil(h*w/2) )', "al = []\nans = 'No'\nfor i in range(3):\n al.append(list(map(int, input().split())))\nn = int(input())\nbl = [int(input()) for i in range(n)]\nfor i in bl:\n for a in al:\n if i in a:\n a[a.index(i... | ['Runtime Error', 'Accepted'] | ['s434368316', 's811315344'] | [2940.0, 3188.0] | [18.0, 20.0] | [91, 602] |
p02760 | u812587837 | 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 isBingo(a):\n for i in range(3)\n if a[i][0] == a[i][1] and a[i][0] == a[i][2]:\n return 'Yes'\n elif a[0][i] == a[1][i] and a[i][0] == a[2][i]:\n return 'Yes'\n if a[0][0] == a[1][1] and a[0][0] == a[2][2]:\n return 'Yes'\n elif a[0][2] == a[1][1] and a[0][2] =... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s040162535', 's182249457', 's756101279', 's449446182'] | [2940.0, 2940.0, 3064.0, 3064.0] | [17.0, 18.0, 17.0, 17.0] | [644, 645, 718, 718] |
p02760 | u813993459 | 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\nxy = [list(map(int, input().split())) for _ in range(3)]\nn = int(input())\nnum = [list(map(int, input().split())) for _ in range(n)]\n\ndef input_b(xy:list, num:int, result:list):\n for i in range(3):\n if num in xy[i]:\n for j in range(3):\n if num==xy[i][j]... | ['Runtime Error', 'Accepted'] | ['s253471131', 's479303693'] | [12440.0, 12484.0] | [155.0, 152.0] | [781, 873] |
p02760 | u816631826 | 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... | ['matrix = []\nfor i in range(3):\n line = []\n line = input().split(" ")\n matrix.append(line)\n\nn = int(input())\nchosen = 0\n\nfor i in range(n):\n b = input()\n for i in range(3):\n for j in range(3):\n if matrix[i][j] == b:\n chosen += 1\n matrix[i][j... | ['Wrong Answer', 'Accepted'] | ['s412200488', 's309772857'] | [9300.0, 3188.0] | [27.0, 19.0] | [1085, 778] |
p02760 | u818078165 | 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 = []\nfor i in range(n):\n b.append(int(input()))\n\nV = [[False,False,False],[False,False,False],[False,False,False]]\n\nfor i in b:\n for i in range(len(A)):\n for j in range(len(A[i])):\n if(A[i][j] == i):\n ... | ['Wrong Answer', 'Accepted'] | ['s868759454', 's699565639'] | [3064.0, 3064.0] | [17.0, 17.0] | [700, 713] |
p02760 | u819611380 | 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... | ['R = 3\nC = 3\nmatrix = [] \nprint("Enter the entries rowwise:") \n \nfor i in range(R): \n a =[] \n for j in range(C): \n a.append(int(input())) \n matrix.append(a) \n \n# For printing the matrix \nfor i in range(R): \n for j in range(C): \n print(matrix[i][j], end = " ") \n pr... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s666747562', 's750064193', 's680968117'] | [3064.0, 3060.0, 3064.0] | [17.0, 17.0, 17.0] | [390, 245, 766] |
p02760 | u823885866 | 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\nA1 = list(map(int, sys.stdin.readline().split()))\nA2 = list(map(int, sys.stdin.readline().split()))\nA3 = list(map(int, sys.stdin.readline().split()))\nN = int(sys.stdin.readline())\nb = [int(sys.stdin.readline()) for _ in range(N)]\nA = A1 + A2 + A3\ni = 0\nwhile i <= 8:\n if b.count(A[i]):\n A[i] =... | ['Runtime Error', 'Accepted'] | ['s510567130', 's412880530'] | [3064.0, 3064.0] | [18.0, 18.0] | [547, 585] |
p02760 | u826771152 | 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... | ['first_array = [int(i) for i in input().split()]\nsecond_array = [int(i) for i in input().split()]\nthird_array = [int(i) for i in input().split()]\nN = int(input())\nbs = []\nfor i in range(N):\n bs.append(i)\nfirst_array = [(i in bs) for i in first_array]\nsecond_array = [(i in bs) for i in second_array]\nthird_arr... | ['Wrong Answer', 'Accepted'] | ['s999255128', 's740472182'] | [3064.0, 3064.0] | [18.0, 18.0] | [959, 1169] |
p02760 | u830162518 | 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,inout().split())\nN=int(input())\nL=[int(input()) for i in range(N)]\nif a in L and b in L and c in L:\n print('Yes')\nelif d in L and e in L and f in L:\n print('Yes')\nelif g in L and h in L and i in L:\n print('Yes')\nelif a in L an... | ['Runtime Error', 'Accepted'] | ['s316297957', 's899733591'] | [3064.0, 3064.0] | [17.0, 17.0] | [569, 569] |
p02760 | u830592648 | 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=list(list(map(int, input().split())) for _ in range(3))\nN=int(input())\nB=list(int(input()) for _ in range(N))\na=np.array(A)\nC=a.flatten()\n\nfor c in range(len(C)):\n for b in range(len(B)):\n if C[c]==B[b]:\n C[c]=0\n\n if (sum(C[:3])==0) | (sum(C[3:6])==0) |... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s176936483', 's324284268', 's477789936'] | [3064.0, 3064.0, 14244.0] | [18.0, 17.0, 150.0] | [516, 529, 517] |
p02760 | u830881690 | 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(input9())\nr = []\nfor _ in range(3):\n b = int(input())\n for i in range(3):\n for j in range(3):\n if a[i][j] == 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: ans = 'Y... | ['Runtime Error', 'Accepted'] | ['s349545183', 's621841478'] | [3064.0, 3064.0] | [17.0, 17.0] | [472, 464] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.