10451 순열 사이클 #include using namespace std; vector adj(1001); int visited[1001]; void dfs(int x) { visited[x] = 1; if (!visited[adj[x]]) { dfs(adj[x]); } } int main() { int test_case, node, max = 0, check; cin >> test_case; for (int i = 0; i > node; memset(visited, 0, sizeof(visited)); for (int j = 1; j > tmp; adj[j] = tmp; } check = 0; for (int j = 1; j
