๐Ÿงฉ Algorithm/SWEA

[SWEA] 5356. ์˜์„์ด์˜ ์„ธ๋กœ๋กœ ๋งํ•ด์š” (Python/D3)

devCloud 2024. 10. 29. 21:50
728x90

[๋ฌธ์ œ ๋งํฌ] ๐Ÿ‘‡

 

SW Expert Academy

SW ํ”„๋กœ๊ทธ๋ž˜๋ฐ ์—ญ๋Ÿ‰ ๊ฐ•ํ™”์— ๋„์›€์ด ๋˜๋Š” ๋‹ค์–‘ํ•œ ํ•™์Šต ์ปจํ…์ธ ๋ฅผ ํ™•์ธํ•˜์„ธ์š”!

swexpertacademy.com


Solution

T = int(input())  # ํ…Œ์ŠคํŠธ ์ผ€์ด์Šค ์ˆ˜
for test_case in range(1, T + 1):
    board = [list(input().strip()) for _ in range(5)]
    result = []
    for j in range(15):
        for i in range(5):
            if j < len(board[i]):
                result.append(board[i][j])
    print(f"#{test_case} {''.join(result)}")

 


 

728x90