Algorithm Problem/Python

[python] SWEA - 2805. ๋†์ž‘๋ฌผ ์ˆ˜ํ™•ํ•˜๊ธฐ

deo2kim 2022. 3. 23. 23:28
๋ฐ˜์‘ํ˜•

๐Ÿค”๋ฌธ์ œ ํ•ด๊ฒฐ

๐Ÿ’ป์†Œ์Šค ์ฝ”๋“œ

T = int(input())
for test_case in range(1, T + 1):
    N = int(input())
    farm = [list(map(int, list(input().strip()))) for _ in range(N)]

    m = N // 2  # ์ค‘์‹ฌ
    answer = 0
    for i in range(m+1):  # ์œ„์•„๋ž˜๊ฐ€ ๋Œ€์นญ์ด๋ฏ€๋กœ ์ ˆ๋ฐ˜๊นŒ์ง€๋งŒ ๊ตฌํ•œ๋‹ค.
        for j in range(m - i, m + i + 1):  # ์ค‘์‹ฌ์„ ๊ธฐ์ค€์œผ๋กœ ์™ผ์ชฝ์œผ๋กœ 1์นธ, ์˜ค๋ฅธ์ชฝ์œผ๋กœ 1์นธ ๋ฒ”์œ„๋ฅผ ๋Š˜๋ ค ๋‚˜๊ฐ„๋‹ค.
            answer += farm[i][j] + farm[N-i-1][j]

    print(f'#{test_case} {answer - sum(farm[m])}')  # ๊ฐ€์šด๋ฐ๋ฅผ ๋‘๋ฒˆ ๋”ํ•ด์คฌ์œผ๋ฏ€๋กœ ํ•œ๋ฒˆ์€ ๋‹ค์‹œ ๋นผ์ค€๋‹ค.

๐Ÿ“•๋ฌธ์ œ ํ™•์ธ

์ถœ์ฒ˜: SW Expert Academy

๋ฐ˜์‘ํ˜•