[Python][백준 21608번] 상어초등학교
# https://www.acmicpc.net/problem/21608 from copy import deepcopy import sys from collections import deque, defaultdict, Counter sys.stdin = open("input.txt", "rt") sys.setrecursionlimit(100000) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] N = int(input()) sits = [[0]*N for _ in range(N)] def chMostLoves(sits, loves): res = [] maxN = 0 for r in range(N): for c in range(N): if sits[r][c] != 0: continue ..
더보기