Algorithm Problem/Python

[python] SWEA - 4751. ๋‹ค์†”์ด์˜ ๋‹ค์ด์•„๋ชฌ๋“œ ์žฅ์‹

deo2kim 2020. 12. 12. 12:56
๋ฐ˜์‘ํ˜•

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

  • D3 | ?

๐Ÿ’จ ๊ทœ์น™์„ ์ฐพ๋Š” ๋ฌธ์ œ

๐Ÿ’จ ์ฒซ์ค„๊ณผ ๋งˆ์ง€๋ง‰์ค„์€ ..#. ๊ณผ ๋์— .

๐Ÿ’จ ๋‘๋ฒˆ์งธ์ค„๊ณผ ๋„ค๋ฒˆ์งธ์ค„์€ .#.# ๊ณผ ๋์— .

๐Ÿ’จ ๊ฐ€์šด๋ฐ ๋ฌธ์ž๊ฐ€ ๋“ค์–ด๊ฐ€๋Š”์ค„์€ #. + ๋ฌธ์žํ•˜๋‚˜ + . ๊ณผ ๋งˆ์ง€๋ง‰์— #

 

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

for tc in range(int(input())):
    word = input()
    a = '..#.'
    b = '.#.#'
    ab_last = '.'
    c1 = '#.'
    c2 = '.'
    c_last = '#'

    N = len(word)
    answer = ['']*5
    answer[0] += a*N + ab_last
    answer[1] += b*N + ab_last
    for w in word:
        answer[2] += c1 + w + c2
    answer[2] += c_last
    answer[3] += b*N + ab_last
    answer[4] += a*N + ab_last

    for rw in answer:
        print(rw) 

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

์ถœ์ฒ˜: SW Expert Academy

 

SW Expert Academy

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

swexpertacademy.com

 

๋ฐ˜์‘ํ˜•
๋Œ“๊ธ€์ˆ˜0