๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm/SWEA

[swea] 2805 ๋†์ž‘๋ฌผ ์ˆ˜ํ™•ํ•˜๊ธฐ(ํŒŒ์ด์ฌ/python)

by chjcoder 2023. 11. 2.

๐ŸŽˆ๋ฌธ์ œ

 

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&problemLevel=3&problemLevel=4&contestProbId=AV7GLXqKAWYDFAXB&categoryId=AV7GLXqKAWYDFAXB&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=4&pageSize=10&pageIndex=2

๐ŸŽ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฐ ์ ‘๊ทผ

๋‹จ์ˆœ ๊ตฌํ˜„

1. ํ–‰๋ ฌ์— index๋กœ ์ ‘๊ทผํ•˜๋Š” ๋‹จ์ˆœํ•œ ๋ฌธ์ œ์ด๋‹ค.

2. ๊ทœ์น™์„ ์ฐพ์•„์•ผ ๋œ๋‹ค.

3. ์œ„์ชฝ / ๊ฐ€์šด๋ฐ / ์•„๋ž˜์ชฝ์œผ๋กœ ๋‚˜๋ˆ ์„œ ๊ทœ์น™์„ ์ฐพ์•˜๋‹ค.

 

๐Ÿ’ป์ฝ”๋“œ

# 2805 ๋†์ž‘๋ฌผ ์ˆ˜ํ™•ํ•˜๊ธฐ


T = int(input())

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

    invest = 0
    # ์œ„์ชฝ
    for i in range(n//2):
        invest += sum(farm[i][n//2-i:n//2+i+1]) # [0,3:4] , [1,2:5] , [2,1:6]
    # ๊ฐ€์šด๋ฐ
    invest += sum(farm[n//2])
    # ์•„๋ž˜์ชฝ
    for i in range(n-1,n//2,-1):    # [6,3] -> 6,5,4
        invest += sum(farm[i][n//2-(n-1-i):n//2+(n-i)])      # [6,3:4] , [5,2:3+(6-5)]
    
    print(f"#{test_case} {invest}")

๐ŸŽ„์ฝ”๋“œ ์„ค๋ช…

์ฃผ์„์œผ๋กœ ์„ค๋ช…์€ ๋Œ€์ฒดํ•œ๋‹ค.