โ๋ฌธ์
https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV19AcoKI9sCFAZN
๋ฉ๋ชจ๋ฆฌ: 44,016 KB, ์๊ฐ: 147 ms, ์ฝ๋๊ธธ์ด: 294 Bytes
โ๐ปํ์ด
๋ฉ๋ชจ๋ฆฌ ๊ฐ์ ์๋ ๊ฐ์ผ๋ก ๋๋๋ฆฌ๋ ค๊ณ ํ๋ฏ๋ก ๋ค๋ฅธ ๋ถ๋ถ์ ์ฐพ์ผ๋ฉด ๋๋ค.
๋ง์ฝ ๋๋ฒ์งธ ์์น๊ฐ ๋ค๋ฅด๋ค๋ฉด ๊ทธ ์์น๋ถํฐ ๋๊น์ง ์๋ ๋นํธ๋ ๊ฐ๊ฒ ๋ง๋ค์ด์ฃผ๊ณ ๋ฐ๊พผ ํ์๋ฅผ ์ฆ๊ฐํ๋ฉด ๋๋ค.
๐ป์ฝ๋
T = int(input())
for tc in range(1, T+1):
bit = list(input())
n = len(bit)
find = [0] * n
res = 0
for i in range(n):
if find[i] != int(bit[i]):
for j in range(i, n):
find[j] = int(bit[i])
res += 1
print(f"#{tc} {res}")
๐ํ๊ธฐ
๋๋ ์ ์๊พธ ์๊ฐ์ ํ๋ค๊ฐ ๋ฉ์ถ๋์ง ์ฒ์ ์๊ฐํ ์ฝ๋๋ฅผ ๋๊น์ง ์๋ํด๋ณผ ํ์๊ฐ ์์ด๋ณด์ธ๋ค.
'Coding Test > Algorithms' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[ํ๋ก๊ทธ๋๋จธ์ค] N์ผ๋ก ํํ/Python - Lv.3 (1) | 2024.11.26 |
---|---|
[SWEA] 1215. ํ๋ฌธ1/Python - D3 (0) | 2024.11.16 |
[SWEA] 1225.์ํธ์์ฑ๊ธฐ/Python - D3 (1) | 2024.11.13 |
[SWEA] 5215.ํ๋ฒ๊ฑฐ ๋ค์ด์ดํธ/Python - D3 (1) | 2024.11.12 |
[SWEA] 2805.๋์๋ฌผ ์ํํ๊ธฐ/Python - D3 (0) | 2024.11.11 |