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 | u021763820 | 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 -*-\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())\nb = []\nfor i in range(n):\n bn = int(input())\n b.append(bn)\nfor i in range(3):\n for j in range(3):\n if a[i][j] in b:\n ... | ['Runtime Error', 'Accepted'] | ['s795579065', 's074290211'] | [3064.0, 3064.0] | [17.0, 18.0] | [672, 721] |
p02760 | u023229441 | 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()))\nn=int(input())\nans=[[0,0,0] for i in range(3)]\ncount=-1\nfor i in range(n):\n s=int(input())\n for T in [A,B,C]:\n count+=1\n if s in T:\n ans[count][T.index(s)]=1\nfor i in range(3):\n if ans[i]==[1,... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s296802090', 's960672283', 's503703615'] | [3444.0, 3064.0, 3188.0] | [19.0, 18.0, 19.0] | [581, 551, 288] |
p02760 | u025501820 | 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 _ in range(3):\n a.append(list(map(int, input().split())))\na = list(np.array(a).flatten())\nN = int(input())\nindex = []\nfor _ in range(N):\n b_i = int(input())\n if b_i in a:\n indexes = [i for i, x in enumerate(a) if x == b_i]\n for i in indexes:\n ... | ['Wrong Answer', 'Accepted'] | ['s159049113', 's549239680'] | [14180.0, 12500.0] | [153.0, 150.0] | [683, 974] |
p02760 | u026731851 | 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 numpy import *\nA = [ list(map(int,input().split(" "))) for i in range(3)]\nN=int(input())\nb = [input() for i in range(N)]\nC=zeros((3,3))\nfor i in range(0,3):\n for j in range(0,3):\n for k in range(0,N):\n if A[i][j]==b[k]:\n C[i][j]==1 \n\n # if C[i]==[1,1,1]:\n # print(\'Yes\')\nif C[... | ['Wrong Answer', 'Accepted'] | ['s801043925', 's086619121'] | [12524.0, 21304.0] | [149.0, 324.0] | [870, 828] |
p02760 | u030410515 | 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()))\nmaru=111\nflag=0\nn=int(input())\nfor k in range(0,n):\n e=int(input())\n for i in range(0,3): \n if e==a[i]:\n a[i]=maru\n if e==b[i]:\n b[i]=maru\n if e==c[i]:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s934747661', 's957570873', 's171054719'] | [3064.0, 3064.0, 3064.0] | [19.0, 17.0, 17.0] | [839, 839, 812] |
p02760 | u030669569 | 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())\nlst_b = [int(input()) for i in range(N)]\n\n\ndef main(A, N, lst_b):\n \n matrix_result = [[False]*3 for i in range(3)]\n flag_bingo = False\n\n for b in lst_b:\n for i in range(3):\n for j in range(3):\n ... | ['Wrong Answer', 'Accepted'] | ['s053342284', 's864079782'] | [3064.0, 3064.0] | [17.0, 17.0] | [1097, 1071] |
p02760 | u033642300 | 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 top = list(map(int, input().split()))\n middle = list(map(int, input().split()))\n bottom = list(map(int, input().split()))\n N = int(input())\n taken = []\n for i in range(N):\n taken.append(int(input()))\n \n bingo = []\n bingo.append(top)\n bingo.append(middle)\n ... | ['Runtime Error', 'Accepted'] | ['s957185594', 's272843584'] | [9172.0, 9228.0] | [23.0, 28.0] | [952, 955] |
p02760 | u035420666 | 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=[]\nc=[[0,0,0],[0,0,0],[0,0,0]]\nd=[[0,0,0],[0,0,0],[0,0,0]]\nfor i in range(3):\n x,y,z=map(int,input().split())\n A.append([x,y,z])\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 if A[i][j] in b:\n c[i][j] = 1\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s138374257', 's592334098', 's559357934'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [533, 523, 505] |
p02760 | u042113240 | 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))\nfor i in range(3):\n for j in range(3):\n a[i][j] = input()\nA = a.T\nN = input()\nb = np.zeros(N)\nfor i in range(N):\n b[i] = input()\nk = 0\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\nc = np.array(a[... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s474501406', 's542731493', 's595621687', 's687431810', 's759298398', 's803063188', 's918193537', 's944671187', 's993166871', 's719560977'] | [12516.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 14520.0, 3064.0, 3064.0] | [155.0, 18.0, 17.0, 18.0, 18.0, 18.0, 17.0, 149.0, 17.0, 17.0] | [518, 491, 654, 488, 461, 486, 491, 540, 461, 557] |
p02760 | u044026875 | 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=[]\nnums=[]\nans="No"\n\nfor i in range(3):\n l=list(map(int,input().split()))\n a.append(l)\n\nn=int(input())\n\nfor i in range(n):\n s=int(input())\n b.append(s)\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]=0\n ... | ['Runtime Error', 'Accepted'] | ['s950721917', 's873352450'] | [3064.0, 3064.0] | [18.0, 19.0] | [811, 811] |
p02760 | u044638697 | 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()))\nx = False\nfor i in range(3):\n count = 0\n for j in range(3):\n for k in range(N):\n if A[i][j] == b[k]:\n count += 1\n if count == 3:\n ... | ['Wrong Answer', 'Accepted'] | ['s934755841', 's970405214'] | [3064.0, 3064.0] | [17.0, 17.0] | [959, 959] |
p02760 | u047023156 | 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\ninput = sys.stdin.readline\n\nA = []\nb = []\nB = [[0, 0, 0] for _ in range(3)]\n\nfor _ in range(3):\n A.append(list(map(int, input().split())))\n\nN = int(input())\n\nfor _ in range(N):\n b.append(int(input()))\n\nfor value in b:\n for i in range(3):\n for j in range(3):\n i... | ['Wrong Answer', 'Accepted'] | ['s939011043', 's098626489'] | [3064.0, 3064.0] | [17.0, 18.0] | [954, 946] |
p02760 | u050087249 | 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)]\n \nnum = int(input())\nfor i in range(num):\n now = int(input())\n for i in range(3):\n for j in range(3):\n if(a[i][j] == now):\n a[i][j] = 0\nstr = 'No'\nfor j in range(3):\n a1, a2 = 0, 0\n for i in range(3):\n if(a[i][j] != 0):\n ... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s144138993', 's275081436', 's517666564'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [589, 525, 535] |
p02760 | u054825571 | 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)]\nS=[[0,0,0] for _ in range(3)]\nfor b in B:\n for i in range(3):\n if b in A[i]:\n S[i][A[i].index(b)] = 1\n break\np = False\nfor a in S:\n if sum(a)==3:\n p = True\n break\nif not p:\n for ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s635305359', 's774019316', 's043514669'] | [9252.0, 9128.0, 9156.0] | [30.0, 26.0, 28.0] | [500, 407, 491] |
p02760 | u055687574 | 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 = [input().split() for _ in range(3)]\nA = list(itertools.chain.from_iterable(A))\nN = int(input())\nB = [input() for _ in range(N)]\n\nl = [a in B for a in A]\nprint(l)\nif l[0] == l[1] == l[2]:\n print("Yes")\nelif l[3] == l[4] == l[5]:\n print("Yes")\nelif l[6] == l[7] == l[8]:\n pri... | ['Wrong Answer', 'Accepted'] | ['s866203354', 's178648580'] | [3064.0, 3064.0] | [18.0, 18.0] | [555, 610] |
p02760 | u056599756 | 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(input().split()) for i in range(3)]\n\nn=int(input())\n\nb=list(int(input()) for i in range(n))\n\nc=[[0]*3 for i in range(3)]\n\nfor i in range(3):\n for j in range(3):\n c[i][j]=False\n for k in range(n):\n if a[i][j]==b[k]:\n c[i][j]=True\n\nanswer="No"\n\nfor i i... | ['Wrong Answer', 'Accepted'] | ['s249469229', 's223187328'] | [3064.0, 3064.0] | [17.0, 18.0] | [563, 572] |
p02760 | u056830573 | 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... | ['rows = []\nfor i in range(3):\n row = [int(x) for x in input().split()]\n rows.append(row)\n\n\ncolumns = []\nfor k in range(3):\n column = [rows[l][k] for l in range(3)]\n columns.append(column)\n\nleft = []\nfor m in range(3):\n left.append(rows[m][m])\n\nright = []\nfor n in range(3):\n for o in ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s155872838', 's299774524', 's675665554', 's677018594', 's959354778'] | [3064.0, 3064.0, 3064.0, 3064.0, 3188.0] | [17.0, 19.0, 17.0, 17.0, 22.0] | [789, 929, 897, 803, 844] |
p02760 | u062691227 | 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\ncard = np.array([list(map(int, input().split())) for i in range(3)])\n\nn = int(input())\n\nnumber = [int(input()) for i in range(n)]\n\nhit = np.isin(card, number)\n\nrow = hit.all(axis=0).any()\ncol = hit.all(axis=1).any()\n\ndiag1 = hit[0][0] and hit[1][1] and hit[2][2]\ndiag2 = hit[0][2] and... | ['Runtime Error', 'Accepted'] | ['s572255007', 's033860984'] | [12440.0, 12488.0] | [149.0, 150.0] | [384, 404] |
p02760 | u063346608 | 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... | ['s = 3\narr =[]\nfor _ in range(s):\n arr.append(list(map(int, input().rstrip().split())))\nprint(arr)\n\ncheck = [[0,0,0],[0,0,0],[0,0,0]]\n#print(check)\n\n\nN = int(input())\n#print(N)\n\nfor i in range(N):\n data = int(input())\n for k in range(3):\n for j in range(3):\n if data == a... | ['Wrong Answer', 'Accepted'] | ['s634962653', 's181908060'] | [3064.0, 9288.0] | [18.0, 25.0] | [802, 732] |
p02760 | u064434060 | 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)]\n\nn=int(input())\nb = [(input()) for i in range(n)]\ns=[]\nfor i in range(n):\n for j in range(3):\n if b[i] in a[j]:\n k=a[j].index(b[i])\n s.append([j,k])\n if [j,0] in s and [j,1] in s and [j,2] in s:\n print("YES")\n break\n elif [0,k]... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s209684205', 's933376250', 's660024094'] | [3064.0, 3192.0, 3064.0] | [18.0, 17.0, 17.0] | [628, 628, 633] |
p02760 | u066413086 | 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.append(list(map(int, input().split()))) \n\nN = int(input())\nB = []\nfor i in range(N):\n B.append(int(input()))\n\n#print(A)\n\n\nmatch = []\nfor A_line in A:\n match.append([(a in B) for a in A_line])\n\n#print(match)\nans = False\n\nfor m in match:\n ans = ans or all(m)\n\n\nmatc... | ['Wrong Answer', 'Accepted'] | ['s833800068', 's961179302'] | [3064.0, 3064.0] | [17.0, 17.0] | [540, 559] |
p02760 | u068142202 | 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)]\nans = 0\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] = 1\nprint(A)\nfor i in range(3):\n if A[i].count(1) == 3:\n ans += 1\n elif A[0][i] == 1 and... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s550378611', 's568004269', 's899215346'] | [3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0] | [526, 516, 515] |
p02760 | u068750695 | 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 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 \nfor i in range(3):\n flag=True\n for j in range(3):\n if a[i][j]!=0:\n fla... | ['Wrong Answer', 'Accepted'] | ['s867811553', 's736432463'] | [3064.0, 3064.0] | [17.0, 17.0] | [721, 716] |
p02760 | u069699931 | 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'\nif (A[0][0] == A[0][1] == A[0][2] == 0) or (A[1][0] == A[1][1] == A[1][2] == 0) or... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s444107562', 's811119662', 's941384271'] | [8992.0, 9312.0, 9296.0] | [25.0, 25.0, 28.0] | [747, 764, 716] |
p02760 | u071695942 | 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... | ["\nli1 = list(map(int,input().split()))\nli1.extend(list(map(int,input().split())))\nli1.extend(list(map(int,input().split())))\nn = int(input())\nfor i in range(n):\n p = int(input())\n li1 = [0 if j == p else j for j in li1]\nprint(li1)\nif ( li1[0] + li1[1] + li1[2] ) == 0:\n print('Yes')\nelif ( li1[3] + li1[4]... | ['Wrong Answer', 'Accepted'] | ['s819023503', 's613839516'] | [3064.0, 3064.0] | [17.0, 17.0] | [689, 677] |
p02760 | u075401284 | 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... | ['al = [map(int, input().split()) for i in range(3)]\nn = int(input())\nbl = [int(input()) for i in range(n)]\ncheck = [0 for i in range(9)]\n\nfor b in bl:\n if b in al:\n check[al.index(b)] = 1\n\nif [1,1,1] in [check[:3], check[3:6], check[6:], check[0:7:3], check[1:8:3], check[2:9:3], check[0:9:4], check[... | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s305469593', 's391366111', 's274693447'] | [9084.0, 9052.0, 9048.0] | [30.0, 29.0, 32.0] | [357, 378, 380] |
p02760 | u075683628 | 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\nmat = []\n\nfor i in range(3):\n\t(a,b,c)= input().split(' ')\n\tmat.append((int(a),int(b),int(c)))\n\nmat = np.array(mat).reshape(3,3)\n\n\nnum = int(input())\nball=[]\nfor i in range(num):\n ball.append(int(input()))\n\nball = set(ball)\n\nfor h in range(3):\n x = set(mat[h,:])\n res = ball... | ['Wrong Answer', 'Accepted'] | ['s923398262', 's499106884'] | [12472.0, 12500.0] | [153.0, 149.0] | [674, 683] |
p02760 | u077291787 | 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 * Created by solzard on 2020-03-05.\n * \n */\n\n\n\n\n\nbool is_bingo(int player) {\n std::unordered_set<int> winnable_conditions\n {0b111000000, 0b000111000, 0b000000111, 0b100100100, 0b010010010, 0b001001001, 0b100010001, 0b001010100};\n for (const auto &condition : winnable_conditions) {\n if ((pl... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s166863945', 's217511675', 's413294888'] | [2940.0, 2940.0, 3060.0] | [17.0, 17.0, 17.0] | [952, 978, 562] |
p02760 | u078276601 | 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)]\n\nn = int(input())\n\nfor j in range(n):\n b = int(input())\n for j in range(3):\n if A[j][0] == b:\n A[j][0] = 0\n if A[j][1] == b:\n A[j][1] = 0\n if A[j][2] == b:\n A[j][2] = 0\n\nif A[0][0]==A[1][1... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s130715309', 's211729790', 's441837699', 's670623626', 's752031212', 's860341314', 's960939758', 's791393220'] | [9088.0, 9188.0, 9008.0, 8984.0, 9200.0, 9184.0, 8976.0, 9336.0] | [24.0, 28.0, 27.0, 25.0, 27.0, 24.0, 26.0, 30.0] | [609, 559, 556, 556, 503, 779, 558, 858] |
p02760 | u079427319 | 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... | ["aList = []\nfor i in range(3):\n aList.append(list(map(int, input().split())))\nn = int(input())\nbList = []\nfor i in range(n):\n bList.append(int(input()))\n\naListCheck = []\nfor i in range(3):\n aListCheckRow = []\n for j in range(3):\n aListCheckRow.append(aList[i][j] in bList)\n aListCheck.append(aListC... | ['Wrong Answer', 'Accepted'] | ['s060676263', 's445945177'] | [3064.0, 3064.0] | [17.0, 19.0] | [706, 707] |
p02760 | u085530099 | 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())\ns = list(map(int, [input() for i in range(n)]))\nl = [\n [0, 0, 0]\n , [0, 0, 0]\n , [0, 0, 0]\n]\nfor i in range(0, 3):\n for j in range(0, n):\n if a1[i] == s[j]:\n l[0][i]... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s013894716', 's442576383', 's543537110', 's993649616', 's942143055'] | [3184.0, 3064.0, 3188.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0, 17.0, 18.0] | [827, 834, 854, 812, 834] |
p02760 | u087951292 | 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 = input().split(" ")\nlist2 = input().split(" ")\nlist3 = input().split(" ")\ncount = int(input())\nvlist1 = [list1[0],list2[0],list3[0]]\nvlist2 = [list1[1],list2[1],list3[1]]\nvlist3 = [list1[2],list2[2],list3[2]]\nxlist1 = [list1[0],list2[1],list3[2]]\nxlist2 = [list1[2],list2[1],list3[0]]\ncorrect = [\'o\',... | ['Wrong Answer', 'Accepted'] | ['s982145472', 's201908351'] | [3188.0, 3064.0] | [18.0, 18.0] | [1119, 932] |
p02760 | u089504174 | 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 for i in range(3)]\nb=[]\nfor i in range(3):\n x=input().split()\n a[i][0]=x[0]\n a[i][1]=x[1]\n a[i][2]=x[2]\nn=int(input())\nfor i in range(n):\n b.append(input())\nfor i in range(n):\n for j in range(9):\n if b[i]==a[j//3][j%3]:\n a[j//3][j%3]='X'\njud=[0,0,0,0]\nz=0\nres=0\nfor i in range(3... | ['Wrong Answer', 'Accepted'] | ['s057373668', 's733586143'] | [3064.0, 3064.0] | [18.0, 18.0] | [684, 646] |
p02760 | u091964259 | 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... | ['seen = [0,0,0,0,0,0,0,0,0]\nseen[0],seen[1],seen[2] = (map(int,input().split()))\nseen[3],seen[4],seen[5] = (map(int,input().split()))\nseen[6],seen[7],seen[8] = (map(int,input().split()))\nover = False\nN = int(input())\nfor x in range(N):\n num = int(input())\n if num in seen:\n seen[x] = "O"\nif seen[0] == "O... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s096731465', 's122128187', 's257039288', 's262869069', 's308559214', 's342245188', 's399759999', 's428017703', 's446471332', 's454270580', 's498707800', 's517811316', 's531311468', 's617461022', 's627531666', 's748194789', 's008720504'] | [9192.0, 9192.0, 9032.0, 9192.0, 9288.0, 9192.0, 9244.0, 9212.0, 9204.0, 9244.0, 9304.0, 9316.0, 9296.0, 9252.0, 9108.0, 9168.0, 9240.0] | [27.0, 28.0, 31.0, 30.0, 27.0, 28.0, 30.0, 28.0, 27.0, 31.0, 25.0, 28.0, 27.0, 28.0, 32.0, 28.0, 29.0] | [792, 829, 837, 804, 817, 837, 866, 802, 837, 802, 947, 914, 806, 935, 839, 863, 806] |
p02760 | u094425865 | 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 =[]\na.append(list(map(int,input().split())))\na.append(list(map(int,input().split())))\na.append(list(map(int,input().split())))\nn = int(input())\nb =[]\nfor i in range(n):\n b.append(int(input()))\n#print(b)\nfor i in range(3):\n for j in range(3):\n if a[i][j] in b:\n a[i][j]... | ['Wrong Answer', 'Accepted'] | ['s340655965', 's788080918'] | [3064.0, 3192.0] | [18.0, 17.0] | [309, 588] |
p02760 | u094999522 | 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,_,*b = [i.split() for i in open(0)]\nbingo = [[0, 1, 2], [3, 4, 5], [6, 7, 8], [2, 5, 8], [0, 3, 6], [1, 4, 7], [0, 4, 8], [2, 4, 6]]\ns = ["" if i in b else i for i in a1 + a2 + a3]\nfor i,j,k in bingo:\n if {s[i],s[j],s[k]} == {\'\'}:\n print(\'Yes\')\n exit()\nprint(\'No\')', 'a1,a2,a3,_... | ['Wrong Answer', 'Accepted'] | ['s469180628', 's332441195'] | [3064.0, 3064.0] | [17.0, 17.0] | [291, 299] |
p02760 | u096294926 | 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(map(int,input().split())) for i in range(N)]\n\n\nfor k in range(N):\n print(B[k][0])\n for i in range(3):\n for j in range(3):\n print(A[i][j])\n if B[k][0] == A[i][j]:\n A[i][j] = 0\... | ['Wrong Answer', 'Accepted'] | ['s477464367', 's464656220'] | [3064.0, 3064.0] | [18.0, 19.0] | [783, 735] |
p02760 | u102223485 | 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 cal(lst1, lst2, lst3):\n for i in range(3):\n if lst1[i] in lst3:\n lst2[i] = 1\n\ndef judge(a, b, c):\n if a == 1 and (a == b == c):\n return True\n else:\n return False\n\nA_1 = list(map(int, input().split()))\nA_2 = list(map(int, input().split()))\nA_3 = list(map(int, i... | ['Runtime Error', 'Accepted'] | ['s304486162', 's125664687'] | [3188.0, 3188.0] | [18.0, 17.0] | [877, 854] |
p02760 | u102242691 | 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())\n\nb1 = [0,0,0]\nb2 = [0,0,0]\nb3 = [0,0,0]\n\nfor i in range(n):\n b = int(input())\n for j in range(3):\n if a1[j] == b:\n b1[j] = 1\n if a2[j] == b:\n ... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s627599478', 's879011095', 's316427988'] | [3064.0, 3064.0, 3192.0] | [18.0, 18.0, 18.0] | [898, 833, 734] |
p02760 | u105210954 | 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 = list(map(int,input().split()))\n b_list = list(map(int,input().split()))\n c_list = list(map(int,input().split()))\n arr = np.array([a_list, b_list, c_list])\n\n n = int(input())\n for _ in range(n):\n num = int(input())\n arr = np.where(arr == num, 0, arr)\n\... | ['Runtime Error', 'Accepted'] | ['s393218468', 's206648453'] | [3064.0, 12512.0] | [17.0, 151.0] | [727, 748] |
p02760 | u105302073 | 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)]\nappear = [[False] * 3] * 3\nprint("appear", appear)\nfor i in range(int(input())):\n b = int(input())\n for j in range(3):\n for k in range(3):\n if a[j][k] == b:\n appear[j][k] = True\n\nans = "No"\nfor i in range(3):\n... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s360231374', 's471574857', 's781046234'] | [3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0] | [625, 593, 494] |
p02760 | u106181248 | 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.append(list(map(int,input().split())))\nn = int(input())\nx = 0\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\nprint(a)\n\nif (a[0][0] == 0 and a[2][2] == 0 and a[1][1] == 0) or (a[0][2] == 0 and a[2... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s050922794', 's497285463', 's718307191', 's684384551'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 17.0, 17.0] | [1336, 278, 673, 673] |
p02760 | u115110170 | 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 = [[map(int,input().split())] for i in range(3)]\nmat = mat[0]+mat[1]+mat[2]\n\nn = int(input())\nfor _ in range(n):\n m = int(input())\n for i in range(9):\n if mat[i] == m:\n mat[i] = 1000\n\nif sum(mat[:3])>=3000:\n print("Yes")\nelif sum(mat[3:6])>=3000:\n print("Yes")\nelif sum(mat[6:])>=3000:\n ... | ['Runtime Error', 'Accepted'] | ['s762757702', 's768508020'] | [3064.0, 3064.0] | [17.0, 17.0] | [545, 551] |
p02760 | u118760114 | 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()))\n\nal = a1+a2+a3\nn =int(input())\n\nfor i in range(n):\n b = int(input())\n if b in al:\n al[al.index()] = 0\nif a1[0] + a1[1] + a1[2] == 0 or a2[0] + a2[1] + a2[2] == 0 or a3[0] + a3[1] + a3... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s048299480', 's386728156', 's437372763', 's783748898', 's772421966'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 18.0, 18.0] | [506, 506, 506, 506, 507] |
p02760 | u121879791 | 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... | ["list_1 = list(map(int,input().split()))\nlist_2 = list(map(int,input().split()))\nlist_3 = list(map(int,input().split()))\n\n\n#list_a = []\n\nlist_a=list_1\n\n\nfor x in list_2:\n list_a.append(x)\n\n\nfor x in list_3:\n list_a.append(x)\n\n\nN = int(input())\n#list_b = [int(x) for x in input().split()]\nlist_... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s112370261', 's498002266', 's707320587', 's659935600'] | [3192.0, 3064.0, 3064.0, 3188.0] | [18.0, 17.0, 17.0, 18.0] | [1081, 797, 880, 1154] |
p02760 | u123282507 | 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... | ['#Input\nl_A = [[0 for i in range(3)] for j in range(3)]\n\ndef detect_BINGO(l_Atf):\n #print(l_Atf)\n \n for i in range(3):\n f_detect = True\n for j in range(3):\n #print(f_detect, l_Atf[i][j])\n f_detect = f_detect and l_Atf[i][j]\n if(f_detect):\n \n ... | ['Runtime Error', 'Accepted'] | ['s234685075', 's835230163'] | [3064.0, 3064.0] | [17.0, 18.0] | [1281, 1383] |
p02760 | u123849536 | 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# 157b\na = []\nb = []\ncheck_list = [False] * 9\nfor _ in range(3);\n a.extend(list(map(int, input().split())))\nn = int(input())\nfor _ in range(n);\n b.append(int(input()))\n\nfor _b in b:\n if _b in a:\n check_list[a.index(_b)] = True\n\nif check_list[0] and check_list[1] and check_... | ['Runtime Error', 'Accepted'] | ['s968494522', 's392279593'] | [2940.0, 3064.0] | [17.0, 18.0] | [739, 741] |
p02760 | u128196936 | 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(lambda x: (int(x), False), input().split()))\nA+=list(map(lambda x: (int(x), False), input().split()))\nA+=list(map(lambda x: (int(x), False), input().split()))\n\nN = int(input())\nfor _ in range(N):\n n = int(input())\n for a, b in A:\n if a == n:\n b = True\nif (A[0][1] and ((A[1][1] and A[2][... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s082717466', 's340664116', 's504009264', 's641701115'] | [9016.0, 8976.0, 9280.0, 9260.0] | [27.0, 25.0, 28.0, 33.0] | [698, 696, 699, 1387] |
p02760 | u129961029 | 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=[map(int(),input().split())]\na2=[map(int(),input().split())]\na3=[map(int(),input().split())]\nn=int(input())\nb=[input() for i in range(n)]\nfor i in range(3):\n for j in range(n):\n if a1[i] == b[j]:\n a1[i] = 1\n elif a2[i] == b[j]:\n a2[i] = 1\n elif a3[i] == b[j]... | ['Runtime Error', 'Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s028886394', 's427472743', 's774666651', 's829088272', 's635253445'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0, 17.0, 18.0] | [728, 768, 782, 782, 739] |
p02760 | u131411061 | 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 i in range(3)]\n N = int(input())\n b_list = [int(input()) for _ in range(N)]\n\n for i in range(3):\n for j in range(3):\n for b in b_list:\n if(A[i][j] == b):\n A[i][j] = 0\n\n flag = False\n ... | ['Runtime Error', 'Accepted'] | ['s573980800', 's062158835'] | [3064.0, 3188.0] | [17.0, 19.0] | [1356, 1415] |
p02760 | u131946248 | 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\ncard = []\nfor i in range(3):\n card.append(list(map(int, input().split())))\ncard = np.array(card)\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 (card[i, j] == b):\n card[i, j] = 0\nflag = 0\nfor i i... | ['Wrong Answer', 'Accepted'] | ['s523013470', 's855693028'] | [21768.0, 21256.0] | [356.0, 1155.0] | [553, 553] |
p02760 | u132049876 | 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... | ['s = input().split()\nnums = []\n[[nums.append(num) for num in row.split(" ")] for row in s[:9]]\nn = int(s[9])\nbs = s[10:]\nmat = [num in bs for num in nums]\npatterns = [[0, 1, 2],\n [0, 4, 8],\n [0, 3, 6],\n [1, 4, 7],\n [2, 4, 6],\n [2, 5, 8],\n [3... | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s042187557', 's061218227', 's502807986', 's582808775', 's805776243', 's811923953', 's156754458'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 18.0, 17.0, 17.0, 17.0, 17.0, 18.0] | [432, 427, 484, 420, 492, 505, 505] |
p02760 | u132878037 | 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]\na.extend(list(map(int,input().split())))\na.extend(list(map(int,input().split())))\na.extend(list(map(int,input().split())))\nprint(a)\nn=int(input())\nfor i in range(n):\n b=int(input())\n for k in range(10):\n if a[k]==b:\n a[k]=0\nprint(a)\nt="No"\nif a[1]==0 and a[2]==0 and a[3]==0:... | ['Wrong Answer', 'Accepted'] | ['s012629086', 's355362295'] | [3064.0, 3192.0] | [17.0, 17.0] | [664, 646] |
p02760 | u136282556 | 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=3\nnum_list = []\nfor i in range(n):\n num_list.append(list(map(int,input().split())))\n\nN=int(input())\n\nlist1=[int(input()) for _ in range(N)]\n\nlist2=[]\ni=0\nwhile i<=2:\n j=0\n while j<=2:\n list2.append(num_list[i][j])\n j=j+1\n i=i+1\n\ns=0\nfor k in list2:\n if list1.count(k)... | ['Wrong Answer', 'Accepted'] | ['s106021201', 's113036231'] | [9296.0, 9236.0] | [26.0, 31.0] | [854, 840] |
p02760 | u141574039 | 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=[];bingo=0\nimport numpy as np\nA=np.zeros((3,3),dtype=int)\nfor i in range(3):\n a,b,c=map(int,input().split())\n A[i][0]=a\n A[i][1]=b\n A[i][2]=c\nN=int(input())\nfor i in range(N):\n B.append(int(input()))\n#print(A)\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... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s228194793', 's576962307', 's683625578'] | [12508.0, 12508.0, 12508.0] | [152.0, 148.0, 149.0] | [679, 626, 599] |
p02760 | u146803137 | 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\ndef py():\n print("Yes")\ndef pn():\n print("No")\ndef iin():\n x = int(input())\n return x\n\nneko = 0\nnya = 0\nnuko = 0\na = [[0] * 3] * 3\nx = [[0] * 3] * 3\nfor i in range(3):\n for j in range(3):\n a[i][j] = iin()\nn = iin()\nb = [0] * n\nfor i in range(n):\n b[i] = iin()\n... | ['Runtime Error', 'Wrong Answer', 'Accepted'] | ['s041766128', 's154234842', 's825469366'] | [3064.0, 3064.0, 3064.0] | [18.0, 18.0, 18.0] | [740, 754, 745] |
p02760 | u150027030 | 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()))\nN = int(input())\nfor i in range(N-1):\n b = int(input())\n if b in A:\n A = [0 if num == b else num for num in A]\n print(A)\nbingo_check = [[0, 1, 2],\n [0, 3, 6],\n [0, 4, 8],\n [1, 4, 7]... | ['Wrong Answer', 'Accepted'] | ['s029307921', 's174152762'] | [3064.0, 3064.0] | [18.0, 19.0] | [588, 573] |
p02760 | u150517577 | 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 for raw in range(3):\n for colomn in range(3):\n if A[raw][colomn] == b:\n A[raw][colomn] = -1\n return\n return\n\nA = [list(map(int, input().split())) for _ in range(3)]\nN = int(input())\nis_bingo = 'No'\nfor _ in range(N):\n b = int(input(... | ['Wrong Answer', 'Accepted'] | ['s250182236', 's477463368'] | [3064.0, 3064.0] | [17.0, 17.0] | [670, 661] |
p02760 | u151005508 | 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=[]\nA+=list(map(int, input().split()))\nA+=list(map(int, input().split()))\nA+=list(map(int, input().split()))\nN=int(input())\n\nb=[]\nfor _ in range(N):\n b.append(int(input()))\n\nprint(A, N, b)\nfind=set()\nfor num in b:\n if num in A:\n find.add(A.index(num))\nprint(find)\nif {0, 3, 6} < find or {... | ['Wrong Answer', 'Accepted'] | ['s479797992', 's209633266'] | [3064.0, 3064.0] | [17.0, 17.0] | [477, 403] |
p02760 | u152402277 | 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... | ['Ai_j = []\nfor i in range(3):\n Ai_j.append(list(map(int,input().split())))\nN = int(input())\nnumber_list = []\nfor i in range(N):\n number_list.append(int(input()))\n\n\nfor x in number_list:\n for i in range(3):\n for j in range(3):\n if Ai_j[i][j] == x:\n Ai_j[i][j] = \'○\... | ['Wrong Answer', 'Accepted'] | ['s539870970', 's073513863'] | [3064.0, 3064.0] | [17.0, 18.0] | [862, 921] |
p02760 | u152638361 | 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.array([list(map(int,input().split())) for i in range(3)])\nN = int(input())\nb = [int(input()) for i in range(N)]\nB = np.array([[0]*3 for i in range(3)])\nfor _ in b:\n for t in range(3):\n for y in range(3):\n if A[t][y] == _:\n B[t][y] = 1\nans = "No"\... | ['Wrong Answer', 'Accepted'] | ['s085039314', 's905531014'] | [14092.0, 12220.0] | [149.0, 154.0] | [561, 570] |
p02760 | u153379420 | 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... | ["inp = [int(x) for x in input().split()]\n\nbingo = inp[0:9]\nb = inp[10:]\n\nfor i in b:\n for j in range(len(bingo)):\n if i == bingo[j]:\n bingo[j] = 0\n\ntrue_list = list()\nfor i in [0, 3, 6]:\n if (bingo[i] + bingo[i+1] + bingo[i+2]) == 0:\n true_list.append(0)\nfor i in [0... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s368126227', 's643573647', 's458475207'] | [3064.0, 3064.0, 3064.0] | [19.0, 18.0, 18.0] | [585, 610, 678] |
p02760 | u154473588 | 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... | ['input1 = list(map(int, (input().split())))\ninput2 = list(map(int, (input().split())))\ninput3 = list(map(int, (input().split())))\n\na = input1 + input2 + input3\n\nn = int(input())\n\nb = []\nfor i in range(n):\n b.append(int(input()))\n\nfor s in b:\n for i in range(9):\n if a[i] == s:\n a[... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s016160216', 's875074975', 's961854892', 's298685972'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 18.0, 18.0, 17.0] | [635, 643, 659, 656] |
p02760 | u155604571 | 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)]\n\nN = int(input())\nB = [int(input()) for i in range(N)]\n\nans='No'\n\nfor i in range(3):\n for j in range(3):\n print(A[i][j])\n if A[i][j] in B:\n A[i][j]=-1\n\nfor i in range(3):\n if sum(A[i])==-3:\n ans='Yes'\n if ... | ['Wrong Answer', 'Accepted'] | ['s671267075', 's996480610'] | [3064.0, 3064.0] | [17.0, 17.0] | [454, 431] |
p02760 | u157672361 | 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 j in range(n)]\nfor j in range(n):\n for i in range(3):\n for k in range(3):\n if b[j] == a[i][k]:\n a[i][k]=0\n\nfor i in range(3):\n n=0 \n for k in range(3): \n if a[i][k]==0:\n n+=1\n if n==3... | ['Wrong Answer', 'Accepted'] | ['s155832571', 's099716646'] | [3064.0, 3064.0] | [17.0, 20.0] | [716, 738] |
p02760 | u158703648 | 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 = []\nfor _ in range(N):\n b.append(input())\n\nbingo1 =[0,0,0]\nbingo2 =[0,0,0]\nbingo3 =[0,0,0]\nfor i in range(3):\n for j in range(N):\n if A1[i]=b[j]:\n bi... | ['Runtime Error', 'Accepted'] | ['s554376089', 's281428595'] | [3060.0, 3064.0] | [17.0, 17.0] | [1039, 957] |
p02760 | u161868822 | 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 = input().split()\nA2 = input().split()\nA3 = input().split()\n\nhit_example = [7,56,73,84,146,273,292,448]\nb = 0\nans = "no"\n\nN = int(input())\nfor i in range(N):\n x = int(input())\n if int(A1[0]) == x:\n b += 256\n elif int(A1[1]) == x:\n b += 128\n elif int(A1[2]) == x:\n b += 64\n elif int(A2... | ['Wrong Answer', 'Accepted'] | ['s585536732', 's000408136'] | [3064.0, 3064.0] | [19.0, 18.0] | [587, 587] |
p02760 | u163421511 | 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(10)]\n\nc = [[0 for _ in range(3)] for _ in range(3)]\nresult = ""\n\nfor i in range(3):\n for j in range(3):\n if a[j][i] in b:\n c[j][i] = 1\n\nfor i in range(3):\n if c[i][0] == c[i][... | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s338623198', 's523840089', 's801360409'] | [9128.0, 9240.0, 9240.0] | [25.0, 23.0, 32.0] | [613, 614, 612] |
p02760 | u173178698 | 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 = [[j for j in map(int,input().split())] for i in range(3)]\nn = int(input())\nb = [[int(j) for j in 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\nif sum(a[0]) == 0 or sum(a[1]) == 0 or sum(a[2])... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s177087898', 's390375603', 's471732299', 's603236274', 's697134002', 's794638867', 's462975575'] | [3064.0, 3188.0, 3064.0, 3064.0, 3064.0, 3064.0, 12396.0] | [17.0, 19.0, 18.0, 18.0, 17.0, 18.0, 150.0] | [445, 449, 522, 449, 435, 516, 556] |
p02760 | u174766008 | 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())\na = []\nfor i in range(n):\n b = int(input()) \n a.append(b)\nfor i in range(3):\n if a1[i] in a and a2[i] in a and a3[i] in a:\n ans = 'Yes'\nif a1[0] in a and a1[1] in ... | ['Wrong Answer', 'Accepted'] | ['s390245553', 's211478922'] | [3064.0, 3064.0] | [18.0, 17.0] | [616, 646] |
p02760 | u175590965 | 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... | ['=[list(map(int,input().split())) for i in range(3)]\nn=int(input())\nfor k in range(n):\n s=int(input())\n for i in range(3):\n for j in range(3):\n if s == A[i][j]:\n A[i][j]=0 \nif A[0][0]==0 and A[1][0]==0 and A[2][0]==0:\n print("Yes")\n \nelif A[0][1]==0 and A[1][1]==0 and A[2][1]==0:\n pr... | ['Runtime Error', 'Accepted'] | ['s518591750', 's448963079'] | [2940.0, 3064.0] | [17.0, 19.0] | [565, 567] |
p02760 | u175746978 | 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 = []\nfor _ in range(N):\n B.append(input())\n \nfor b in B:\n for x in range(3):\n for y in range(3) :\n if A[x][y] == b:\n A[x][y] = 0\nif A[0][0] + A[1][0] + A[2][0] == 0 \\\nor A[0][1] + A[1][1] ... | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s381532991', 's579933097', 's862190796', 's878877029', 's907243081', 's172338240'] | [3064.0, 3064.0, 3064.0, 2940.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0, 18.0, 21.0] | [589, 572, 584, 427, 572, 574] |
p02760 | u178465329 | 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 check(a,b,c):\n return a==b==c==0\n\n\nt=[list(map(int,list(input().split(" ")))) for i in range(3)]\nn = int(input())\na = [int(input()) for _ in range(n)]\n\nfor i in a:\n for x in range(3):\n for y in range(3):\n if t[x][y] == i :\n t[x][y] = 0\n\nans = check(t[0][0],t[0]... | ['Wrong Answer', 'Accepted'] | ['s408856552', 's681925078'] | [13348.0, 12484.0] | [162.0, 153.0] | [579, 593] |
p02760 | u179376941 | 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 = []\nsheet = set()\nfor _ in range(3):\n lst = [int(i) for i in input().split()]\n bingo.append(lst)\nn = int(input())\nfor _ in range(n):\n a = int(input())\n for i in range(3):\n for j in range(3):\n if bingo[i][j] == a:\n num = 3 * i + j\n sheet.add(num)\nif 0 in sheet and 1 in she... | ['Wrong Answer', 'Accepted'] | ['s954390931', 's676831750'] | [9148.0, 9088.0] | [30.0, 28.0] | [778, 792] |
p02760 | u180528413 | 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 i in range(3):\n for j in a[i]:\n if j != 0:\n break\n else:\n print('Yes')\n break\n if a[0][i] == 0 and a[1][i] == 0 and a[2][i] == 0:\n print('Yes')\n break\n if a[0][0] == 0 and a[1][1] == 0 and a[2][2] == 0:\n print('Yes')\n break\n i... | ['Runtime Error', 'Accepted'] | ['s110120694', 's673060119'] | [3064.0, 3188.0] | [18.0, 19.0] | [411, 635] |
p02760 | u182594853 | 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=list(map(int, input().split()))\na1=list(map(int, input().split()))\na2=list(map(int, input().split()))\nn=int(input())\nb=[]\nfor i in range(n):\n b.append(int(input()))\nans=[]\nfor i in b:\n if (i in a0) == True:\n ans.append(a0.index(i))\n if (i in a1) == True:\n ans.append((a1.index(i))... | ['Wrong Answer', 'Accepted'] | ['s936673149', 's846225805'] | [3064.0, 3064.0] | [18.0, 18.0] | [1167, 968] |
p02760 | u185005484 | 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(e) for e in input().split()]\nA2=[int(e) for e in input().split()]\nA3=[int(e) for e in input().split()]\nN=int(input())\nfor i in range(N):\n b=input()\n for j in range(3):\n if b==A1[j]:\n A1[j]= -1\n elif b==A2[j]:\n A2[j]= -1\n elif b==A3[j]:\n A... | ['Wrong Answer', 'Accepted'] | ['s505142676', 's003267724'] | [3064.0, 3064.0] | [18.0, 17.0] | [758, 827] |
p02760 | u185966380 | 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())\nd = [[0]*3]*3\nfor i in range(3):\n for j in range(3):\n b = int(input())\n if A[i][j] == b:\n d[i][j] = 1\n\nans = "No"\n\nfor i in range(3):\n if sum(d[i]) == 3:\n ans = "Yes"\n break\n if sum([D[i] for D in d]) == 3:\n ... | ['Runtime Error', 'Accepted'] | ['s497112105', 's299334773'] | [3064.0, 3064.0] | [19.0, 17.0] | [467, 511] |
p02760 | u189516107 | 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)]\n\nfor k in range(N):\n for i in range(3):\n for j in range(3):\n if card[i][j] == b[k]:\n card[i][j] = 0\n \nprint(card)\n\n\nfor i in range(3):\n if card[i] == [0, 0, 0]:\n \n... | ['Wrong Answer', 'Accepted'] | ['s572532744', 's709455425'] | [3064.0, 3064.0] | [18.0, 17.0] | [684, 685] |
p02760 | u190178779 | 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 = [ list(map(int,input().split())) for a in range(3) ]\nN = int(input())\npoint = [ int(input()) for a in range(N) ]\n\n# cut holes\nfor I in point:\n for J in card:\n if I in J:\n J.index(I)\n J[J.index(I)] = "H"\nprint(card)\n# vertical check\nfor K in range(3):\n ... | ['Wrong Answer', 'Accepted'] | ['s803705886', 's532595192'] | [9280.0, 9264.0] | [27.0, 28.0] | [814, 802] |
p02760 | u191635495 | 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\nA = []\nfor _ in range(3):\n A += list(map(int, input().split()))\nN = int(input())\nfor _ in range(N):\n b = int(input())\n if b in A:\n A[A.index(b)] = -1\n \n\ndiag = (sum(A[0::4]) == -3) | (sum(A[2:8:2]) == -3)\nrows = (sum(A[:3]) == -3) | (sum(A[3:6]) == -3) | (sum(A[6:]) == -3)\n... | ['Wrong Answer', 'Accepted'] | ['s040119509', 's430568310'] | [9148.0, 9260.0] | [28.0, 29.0] | [446, 437] |
p02760 | u194228880 | 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 checkbingo(bingo,bs):\n for b in bingo:\n cnt = 0\n for n in bs:\n if n in b:\n cnt +=1\n if cnt == 3:\n return True\n return False\n\nlist1 = input(\'\').split(\' \')\nlist2 = input(\'\').split(\' \')\nlist3 = input(\'\').split(\' \')\nbingo = [list1,list2,list3]\nfor i in range(0,2):... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s161385767', 's491156096', 's838156425', 's207111891'] | [3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 18.0] | [627, 652, 655, 652] |
p02760 | u194472175 | 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... | ['bingonum=[[0,0,0],[0,0,0],[0,0,0]]\nbingo=[["False","False","False"],["False","False","False"],["False","False","False"]]\nfor i in range(3):\n bingonum[i][0],bingonum[i][1],bingonum[i][2] = map(int,input().split())\nN = int(input())\nb=[]\nfor _ in range(N):\n b.append(int(input()))\nprint(bingonum[0][0])\npri... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s091148262', 's319643561', 's672121226', 's482895283'] | [3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0] | [869, 873, 873, 835] |
p02760 | u198073053 | 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 = []\nfor i in range(3):\n inp = [int(x) for x in input().split()]\n a.append(inp)\nn = int(input())\nb = []\nfor i in range(n):\n b.append(input())\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] == 0 and a[0][1] == 0 and a[0][2] ==... | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s254420285', 's409466428', 's686744096'] | [3188.0, 3188.0, 3188.0] | [17.0, 17.0, 17.0] | [828, 832, 832] |
p02760 | u199830845 | 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 OrderedDict\n\nf_row_nums = list(input().split())\ns_row_nums = list(input().split())\nt_row_nums = list(input().split())\nN = int(input())\nchosen_nums = [input() for _ in range(N)]\n\nf_dict = OrderedDict()\nfor key in f_row_nums:\n print(key)\n f_dict[key] = False\ns_dict = OrderedDic... | ['Wrong Answer', 'Accepted'] | ['s373213883', 's655024053'] | [3316.0, 3316.0] | [21.0, 20.0] | [1074, 1060] |
p02760 | u199845325 | 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# Your code here!\nls = []\ncount = [0]*9\nfor i in range(3):\n ls.extend(input().split(\' \'))\nfor i in range(int(input())):\n s = input()\n if s in ls:\n i = ls.index(s)\n count[i]="1"\nflag = 0\nfor i in range(3):\n if count[i] == count[i+3] == count[i+6]=="1":\n ... | ['Runtime Error', 'Accepted'] | ['s979427391', 's781475513'] | [3064.0, 3316.0] | [17.0, 20.0] | [619, 601] |
p02760 | u201928947 | 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 = [0,1,3,5,7,8]\nif 4 in bingo:\n if 0 in bingo:\n if 8 in bingo:\n print('Yes')\n exit()\n if 1 in bingo:\n if 7 in bingo:\n print('Yes')\n exit()\n if 2 in bingo:\n if 6 in bingo:\n print('Yes')\n exit()\n if 3 ... | ['Wrong Answer', 'Accepted'] | ['s107647831', 's815152456'] | [3064.0, 3064.0] | [17.0, 17.0] | [783, 1008] |
p02760 | u201986772 | 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())))\n\ndef bingo(x):\n a=False\n for s in range(3):\n if sum(x[0])==3:a=True\n \n for h in range(3):\n if x[i][0]+x[i][1]+x[i][2]==3:a=True\n \n if x[0][0]+x[1][1]+x[2][2]==3:a=True\n \n if x[0][2]+x[1][1]+x[2][0]==3:a=True\n \n re... | ['Wrong Answer', 'Accepted'] | ['s128498027', 's903548047'] | [9276.0, 27148.0] | [31.0, 115.0] | [561, 552] |
p02760 | u205087376 | 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()))\nn = int(input())\nfor i in range(1,n+1):\n b_i = int(input())\nfor j in range(1,n+1):\n d = [" " if b_j in s else s for s in a]\n e = [" " if b_j in s else s for s in b]\n f = [" " if b_j in s else s for s ... | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s123447095', 's544662043', 's646781019', 's666406707', 's966312861', 's576854554'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [18.0, 17.0, 18.0, 17.0, 18.0, 18.0] | [510, 464, 448, 519, 439, 440] |
p02760 | u207137484 | 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=(int(x) for x in input().split())\na21,a22,a23=(int(x) for x in input().split())\na31,a32,a33=(int(x) for x in input().split())\nn=int(input())\nlist=[]\nfor i in range(n):\n\tlist.append(int(input()))\ns=set(list)\n\ndef ch(a,b,c,s):\n\tprint(a,b,c,s)\n\tk=0\n\tif a in s:\n\t\tif b in s:\n\t\t\tif c in s... | ['Wrong Answer', 'Accepted'] | ['s486459947', 's742236432'] | [3064.0, 3064.0] | [18.0, 17.0] | [538, 522] |
p02760 | u207241407 | 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 = sum([list(map(int, input().split())) for _ in range(3)], [])\nN = int(input())\n\nfor b in range(N):\n if b in A:\n A[A.index(b)] = 0\n elif A[0] + A[1] + A[2] == 0:\n print("Yes")\n exit()\n elif A[3] + A[4] + A[5] == 0:\n print("Yes")\n exit()\n elif A[6] + A[7] + ... | ['Wrong Answer', 'Accepted'] | ['s533663004', 's263691838'] | [3064.0, 3064.0] | [17.0, 17.0] | [715, 513] |
p02760 | u207400417 | 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(map(int, input().split())) for i in range(N)]\nc = [[0] * 3 for _ in range(3)]\nfor b in B:\n for i in range(3):\n for j in range(3):\n if A[i][j] == b:\n c[i][j] == 1\nfor i in range(3):\n if c[i][0] and c[i][1] a... | ['Wrong Answer', 'Accepted'] | ['s165565361', 's873194502'] | [3064.0, 3188.0] | [18.0, 20.0] | [571, 550] |
p02760 | u209313313 | 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=list(map(int,input().split()))\nA21, A22, A23=list(map(int,input().split()))\nA31, A32, A33=list(map(int,input().split()))\nN=int(input())\nb=[input() for i in range(N)]\nif A11, A12, A13 in b:\n print('Yes')\nelif A21, A22, A23 in b:\n print('Yes')\nelif A31, A32, A33 in b:\n print('Yes')\neli... | ['Runtime Error', 'Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s046371821', 's180155841', 's207994039', 's293899170', 's630373612', 's865645661'] | [3064.0, 3188.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 20.0, 18.0, 17.0, 17.0, 18.0] | [535, 663, 661, 581, 584, 668] |
p02760 | u210369205 | 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 = [0] * N \nfor i in range(N):\n b[i] = int(input())\nA = [A1,A2,A3]\nB = [[0]*3,[0]*3,[0]*3]\nfor i in range(3):\n for j in range(3):\n for k in range(N):\n if A[... | ['Runtime Error', 'Accepted'] | ['s701425381', 's929833205'] | [3064.0, 3188.0] | [17.0, 17.0] | [834, 835] |
p02760 | u211236379 | 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... | ['mark = []\nfor i in range(N):\n b = int(input())\n for j, a in enumerate(A):\n for k, aa in enumerate(a):\n if aa == b:\n mark.append((j,k))\n\n\n\nif ( ((0,0) and (1,1) and (2,2)) or ((0,2) and (1,1) and (2,0)) ) in mark:\n print("Yes")\n exit()\nelse:\n for i in range... | ['Runtime Error', 'Accepted'] | ['s870487541', 's867565884'] | [3064.0, 3064.0] | [18.0, 18.0] | [505, 632] |
p02760 | u211805975 | 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 = [[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\nbingo = 0\n\nfor i in range(3):\n if a[i][0] == a[i][1] == a[i][2] == -1:\n bingo = 1\n \nf... | ['Runtime Error', 'Accepted'] | ['s350559772', 's614188539'] | [3064.0, 3064.0] | [17.0, 17.0] | [530, 539] |
p02760 | u215341636 | 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 l in range(3))\nn = int(input())\n\nfor i in range(input()):\n b=int(input())\n for j in range(3):\n for k in range(3):\n if a[j][k]==b:a[j][k]=0\nans="No"\nfor i in range(3):\n if a[i][0]==a[i][1]==a[i][2]==0:ans="Yes"\n if a[0][i]==a[1][i]==a[2][i]==0:ans="Y... | ['Runtime Error', 'Accepted'] | ['s891944158', 's743532357'] | [3064.0, 3064.0] | [18.0, 17.0] | [405, 384] |
p02760 | u215630013 | 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... | ["table = []\nfor i in range(3):\n table.append(list(map(int, input().split())))\nparts = int(input())\np_list = []\nfor i in range(parts):\n p_list.append(int(input()))\n\nchk = 0\ncolc = [0, 0, 0]\nnaname = 0\ninaname = 0\nfor r_idx, row in enumerate(table):\n rcnt = 0\n for c_idx, col in enumerate(row):\... | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s140226585', 's238989285', 's247773458', 's585424787', 's251296648'] | [3064.0, 3064.0, 3064.0, 3064.0, 3064.0] | [17.0, 17.0, 18.0, 17.0, 17.0] | [780, 590, 705, 711, 705] |
p02760 | u216392490 | 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 math\nsys.setrecursionlimit(int(1e6))\n\nA = [[0]*3]*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())\n\ncard = [[0]*3]*3\nn = 0\nfor bn in b:\n ... | ['Wrong Answer', 'Accepted'] | ['s530158177', 's151104383'] | [3064.0, 3064.0] | [18.0, 18.0] | [752, 756] |
p02760 | u216888678 | 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())\nbn=[int(input()) for _ in range(N)]\nans=False\nfor ver in zip(*A):\n if all(item in bn for item in ver):\n ans=True\nfor wide in A:\n if all(item in bn for item in wide):\n ans=True\nif all(A[i][i] in bn for i in range(3)):\n ... | ['Runtime Error', 'Accepted'] | ['s812254390', 's356475807'] | [3064.0, 3064.0] | [17.0, 17.0] | [426, 428] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.