https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5LuHfqDz8DFAXc
SW Expert Academy
SW ํ๋ก๊ทธ๋๋ฐ ์ญ๋ ๊ฐํ์ ๋์์ด ๋๋ ๋ค์ํ ํ์ต ์ปจํ ์ธ ๋ฅผ ํ์ธํ์ธ์!
swexpertacademy.com
def DFS(per,level):
global Max,N
if Max>= per: #์๊ฐ์ด๊ณผ ๋์ ๋ฐฑํธ๋ํน
return
if level == N:
if Max<per:
Max=per
return
for i in range(N):
if not visit[i]: #์์ง ๋ฐฉ๋ฌธ ์ํ์ ๋
visit[i] = 1
DFS(per*(arr[level][i]/100),level+1)
visit[i] = 0
T = int(input())
for tc in range(1,T+1):
N = int(input())
arr = [list(map(int,input().split())) for _ in range(N)]
visit = [0]*N
Max = 0
DFS(1,0) # percentage,level
print(f'#{tc} {Max*100:.6f}') #์์ซ์ 6์๋ฆฌ๊น์ง..
'Problem Solving > SWEA' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
swea14190. ๋ฏผ์ฝ์จ์ ๊ฝ๋ฐญ(python) (0) | 2022.04.11 |
---|---|
swea4021.์๋ฆฌ์ฌ (0) | 2022.04.07 |
swea2117.ํ ๋ฐฉ๋ฒ ์๋น์ค (0) | 2022.04.07 |
swea.14195 ๋ฏธ์๋ฌผ ๊ด์ฐฐ (0) | 2022.04.06 |
swea. ์ ๊ธฐ๋ฒ์ค (0) | 2022.03.06 |
๋๊ธ