arr = []dx = [0,1]dy = [1,0]def search(l, d, x, y): global arr global dx global dy n = x m = y # print(n,m) for i in range(l): # print('v', 'n', n, 'm', m, end= ' ') arr[n-1][m-1] = 1 n += dx[d] m += dy[d]a, b = map(int, input().split())o = int(input())for i in range(a): v = [0]*b arr.append(v)for i in range(o): p, q, r, s = map(int,input().split()) search(p,q,r,s)for i in range(a): for j in range(b): print(arr[i][j], end = ' ') print()import syslimit_number = 21000sys.setrecursionlimit(limit_number)arr = []ans = []arr2 = []dx = [1,0,-1,0]dy = [0,1,0,-1]f = 0def count(p,q): arr2[p][q] = 0 for i in range(4): if p+dx[i]>=0 and p+dx[i]<n and q+dy[i]>=0 and q+dy[i]<n and arr2[p+dx[i]][q+dy[i]]: count(p+dx[i], q+dy[i])def search(high): global arr for i in range(n): for j in range(n): if arr[i][j] > high: arr2[i][j] = 1 for i in range(n): for j in range(n): if arr2[i][j] == 1: ans[high] += 1 count(i, j)n = int(input())for i in range(n): c = [0]*n arr2.append(c) v = list(map(int, input().split())) arr.append(v)for i in range(n): for j in range(n): if f<arr[i][j]: f = arr[i][j]ans = [0]*(f+1)for i in range(f): search(i)print(max(ans))
# v = []# n = 0# x = 0# y = 0# z = 0# min = 2000# def search(a,b,c,m):# global n# global x# global y# global z# global min# if m == n:# if a>=b and b>=c and a-c<min:# x=a# y=b# z=c# min = a-c# return# search(a+v[m], b, c, m+1)# search(a, b+v[m], c, m+1)# search(a, b, c+v[m], m+1)## n = int(input())# v = list(map(int, input().split()))# search(0,0,0,0)## print(x,y,z)# # a >= b >= carr = []cnt = 0dx = [1 ,0 ,1, -1]dy = [0, 1, 1, 1]def search(x,y,num,dir): global arr global cnt cnt += 1 if x+dx[dir]>-1 and x+dx[dir]<19 and y+dy[dir]<19 and arr[x+dx[dir]][y+dy[dir]] == num: search(x+dx[dir], y+dy[dir], num, dir)for i in range(19): v = list(map(int,input().split())) arr.append(v)for i in range(19): for j in range(19): if arr[i][j]!=0: cnt = 0 for k in range(4): if i-dx[k]>-1 and j-dy[k] and i+dx[k]<19 and j+dy[k]<19 and arr[i][j]!=arr[i-dx[k]][j-dy[k]] and arr[i][j] == arr[i+dx[k]][j+dy[k]]: search(i,j,arr[i][j],k) if cnt == 5: print(arr[i][j]) print(i+1,j+1) exit() cnt = 0print(0)