[10451번] 순열 사이클

#include 
#include 

using namespace std;

int N, T;
int map[1001];
bool visited[1001];
int x, y, cnt;
queue Q;

void init() {
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> map[i]; 
		visited[i] = false;
	}
}

void solve() {
	int graphNum = 0;
	for (int i = 1; i <= N; i++) {
		if (visited[i] == false) {
			int now = i;
			visited[now] = true;
			while (true) {
				int next = map[now];
				if (visited[next] == false) {
					visited[next] = true;
					now = next;
				}
				else {
					graphNum++; 
					break;
				}
			}
		}
	}
	cout << graphNum << endl;
}

int main() {
	cin >> T;
	while(T--){
		init();

		solve();
	}
	return 0;
}