211209 백준 코딩연습 파이썬 10451 순열 사이클

https://solved.ac/

 

 

파이썬

 

실2 순열 사이클

 

https://www.acmicpc.net/problem/10451

 

 

다른 코드

 

import sys
def DFS(graph, lst_root, a):
    cnt = 0
    for i in range(a):
        visited = []
        stack = [lst_root[i]]
        while stack:        
            n = stack.pop()
            if n not in visited:       
                if n in graph:
                    visited.append(n)
                    stack += set(graph[n]) - set(visited)
                    del graph[n]
        if visited:
            cnt +=1
    return cnt
 
graph = {}
 
n = int(input())
 
for i in range(0,n):
    a = int(sys.stdin.readline())
    ran = list(range(1,a+1))
    lst = list(map(int,sys.stdin.readline().split()))
 
    for i in range(0,a):
            graph[ran[i]] = [lst[i]]
            
    print(DFS(graph,lst,a))