[๋ฐฑ์ค-2630] ์์ข
์ด ๋ง๋ค๊ธฐ / Python
๐ Problem Solving/Baekjoon
import sys
n = int(sys.stdin.readline())
paper = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
white, blue = 0, 0
def divide(n, x, y):
global white, blue
check = paper[x][y]
for i in range(x, x + n):
for j in range(y, y + n):
if check != paper[i][j]:
divide(n // 2, x, y)
divide(n // 2, x, y + n // 2)
divide(n // 2, x + n // 2, y)
divide(n // 2, x + n // 2, y + n // 2)
return
if check == 0:
white += 1
else:
blue += 1
divide(n, 0, 0)
print(white)
print(blue)
ํด์ค
์ด์ ํ์๋ ์ฌ๊ท ๋ฌธ์ ์ ๋น์ทํ ์ ํ! ์ด์ ์ด๋์ ๋ ๋ฅ์ํ๊ฒ ํ ์ ์๊ฒ ๋์๋ค..๐
'๐ Problem Solving > Baekjoon' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[๋ฐฑ์ค-5525] IOIOI / Python (0) | 2021.05.26 |
---|---|
[๋ฐฑ์ค-2667] ๋จ์ง๋ฒํธ๋ถ์ด๊ธฐ / Python (0) | 2021.05.26 |
[๋ฐฑ์ค-1992] ์ฟผ๋ํธ๋ฆฌ / Python (0) | 2021.05.25 |
[๋ฐฑ์ค-1927] ์ต์ ํ / Python (0) | 2021.05.25 |
[๋ฐฑ์ค-1780] ์ข ์ด์ ๊ฐ์ / Python (0) | 2021.05.25 |