728x90
[๋ฌธ์ ๋งํฌ] ๐
SW Expert Academy
SW ํ๋ก๊ทธ๋๋ฐ ์ญ๋ ๊ฐํ์ ๋์์ด ๋๋ ๋ค์ํ ํ์ต ์ปจํ ์ธ ๋ฅผ ํ์ธํ์ธ์!
swexpertacademy.com
ํ์ด
1. ๋ ์ง๋ฅผ ๋ฆฌ์คํธ์ ๋ชจ๋ ์ ์ฅํ๋ค.
days = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
2. ๋ ์ง ๋ฆฌ์คํธ์ ๊ธธ์ด๋งํผ for๋ฌธ์ ๋๋ฆฐ๋ค.
- ์ ๋ ฅ๋ฐ์ ๊ฒ๊ณผ ๋ ์ง ๋ฆฌ์คํธ์ ๋ค์ด์๋ ๋ฌธ์์ด๊ณผ ๊ฐ์ผ๋ฉด
- 7์์ ํ์ฌ ๋ ์ง๋ฅผ ๋นผ์ค๋ค.
for i in range(len(days)):
if days[i] == day:
result = 7 - i
break
Solution
test_case = int(input())
for tc in range(1, test_case + 1):
day = input()
days = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
result = 0
for i in range(len(days)):
if days[i] == day:
result = 7 - i
break
print("#%d %d" %(tc, result))
728x90
'๐งฉ Algorithm > SWEA' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
| [SWEA] 3314. ๋ณด์ถฉํ์ต๊ณผ ํ๊ท (Python/D3) (0) | 2024.10.21 |
|---|---|
| [SWEA] 5601. [Professional] ์ฅฌ์ค ๋๋๊ธฐ (Python/D3) (1) | 2024.10.21 |
| [SWEA] 1289. ์์ฌ์ ๋ฉ๋ชจ๋ฆฌ ๋ณต๊ตฌํ๊ธฐ (Python/D3) (0) | 2024.10.20 |
| [SWEA] 10570. ์ ๊ณฑ ํฐ๋ฆฐ๋๋กฌ ์ (Python/D3) (0) | 2024.10.20 |
| [SWEA] 11688. Calkin-Wilf tree 1 (Python/D3) (1) | 2024.10.20 |