침대 밖은 위험해!

#include<iostream>
using namespace std;

int t;

int main(void){
	cin >> t;
	while (t--){
		int n, student[100001], finish[100001], ans = 0;
		bool check[100001];

		cin >> n;
		for (int i = 1; i <= n; i++){
			check[i] = false;
			finish[i] = 0;
		}

		for (int i = 1; i <= n; i++){
			cin >> student[i];
			finish[student[i]]++;
		}

		for (int i = 1; i <= n; i++){
			int now = i;
			while (!check[now] && !finish[now]){
				ans++;
				check[now] = true;
				finish[student[now]]--;
				now = student[now];
			}
		}

		cout << ans << "\n";
	}
	return 0;
}

#include<iostream>
using namespace std;

int t, n, student[100001], stack[100001], check[100001], ans = 0;

void dfs(int now, int cnt){
	check[now]++;
	stack[cnt] = now;

	if (check[student[now]] == 0){
		dfs(student[now], cnt + 1);
	}
	else if (check[student[now]] == 1){
		bool iscycle = false;
		for (int i = 1; i <= cnt; i++){
			if (stack[i] == student[now]){
				for (int j = i; j <= cnt; j++){
					check[stack[j]]++;
				}
				ans += i - 1;
				iscycle = true;
				break;
			}
		}
		if (!iscycle)
			ans += cnt;
	}
	else{ // check[student[now]] == 2
		ans += cnt;
	}
}

int main(void){
	cin >> t;
	while (t--){
		cin >> n;
		ans = 0;
		for (int i = 1; i <= n; i++){
			cin >> student[i];
			check[i] = 0;
		}

		for (int i = 1; i <= n; i++){
			if (check[i] == 0){
				dfs(i, 1);
			}
		}

		cout << ans << "\n";
	}
	return 0;
}

#include <iostream>
using namespace std;
int t, n, student[100010], check[100010], team, cnt;

void dfs(int now, int start){
	if (check[now] > 0)
		return;

	check[now] = ++cnt;

	if (check[student[now]] >= check[start])
		team += cnt - check[student[now]] + 1;
	else
		dfs(student[now], start);
}

int main(void){
	freopen("text.txt", "r", stdin);
	cin >> t;
	while (t--){
		cin >> n;
		cnt = team = 0;
		for (int i = 1; i <= n; i++){
			check[i] = 0;
			cin >> student[i];
		}
		for (int i = 1; i <= n; i++)
			dfs(i, i);
		cout << n - team << "\n";
	}
	return 0;
}

#include<iostream>
using namespace std;

#define left -1
#define right 1

char drill[6][8]; // 0, 5 가상의 톱니바퀴
bool check[6];

// 12시 0, 3시 2, 9시 6
void spin(int drillNum, int dir){
	check[drillNum] = true;

	if (drillNum == 0 || drillNum == 5)
		return;

	// 왼쪽 톱니바퀴
	if (!check[drillNum - 1] && (drill[drillNum][6] - '0') ^ (drill[drillNum - 1][2] - '0')){
		spin(drillNum - 1, -dir);
	}
	// 오른쪽 톱니바퀴
	if (!check[drillNum + 1] && (drill[drillNum][2] - '0') ^ (drill[drillNum + 1][6] - '0')){
		spin(drillNum + 1, -dir);
	}

	char temp;
	if (dir == left){
		temp = drill[drillNum][0];
		for (int i = 0; i < 7; i++){
			drill[drillNum][i] = drill[drillNum][i + 1];
		}
		drill[drillNum][7] = temp;
	}
	else if (dir == right){
		temp = drill[drillNum][7];
		for (int i = 7; i > 0; i--){
			drill[drillNum][i] = drill[drillNum][i - 1];
		}
		drill[drillNum][0] = temp;
	}
}

int main(void){
	freopen("text.txt", "r", stdin);
	for (int i = 1; i < 5; i++){
		for (int j = 0; j < 8; j++){
			cin >> drill[i][j];
		}
	}

	int k, drillNum, dir;
	cin >> k;

	for (int i = 0; i < k; i++){
		cin >> drillNum >> dir;
		for (int j = 0; j < 6; j++)
			check[j] = false;
		spin(drillNum, dir);
	}

	int ans = 0;
	for (int i = 1; i <= 4; i++){
		if (drill[i][0] == '1'){
			ans += (1 << (i - 1));
		}
	}

	cout << ans << "\n";
}

#include <stdio.h>

int t[6][9];

int main() {

	int i, j, n, num, dir[6], k, tmp,ans;

	for (i = 0; i < 4; i++) 
		for (j = 0; j < 8; j++)
			scanf("%1d", &t[i + 1][j]);
	scanf("%d", &n);

	while (n--) {
		for (i = 0; i < 6; i++) dir[i] = 0;
		scanf("%d",&num);
		scanf("%d",&dir[num]);
		
		for (k = num; k > 0; k--) {
			if (t[k - 1][2] != t[k][6] && dir[k] == 1) dir[k - 1] = -1;
			else if (t[k - 1][2] != t[k][6] && dir[k] == -1) { dir[k - 1] = 1;}
		}
		for (k = num; k < 5; k++) {
			if (t[k + 1][6] != t[k][2] && dir[k] == 1) dir[k + 1] = -1;
			else if (t[k + 1][6] != t[k][2] && dir[k] == -1) dir[k + 1] = 1;
		}
		for (i = 0; i < 6; i++) {
			if (dir[i] == -1) {
				tmp = t[i][0];
				for (j = 0; j < 8; j++) {
					t[i][j] = t[i][j + 1];
				}
				t[i][7] = tmp;
			}
			if (dir[i] == 1) {
				tmp = t[i][7];
				for (j = 8; j > 0; j--) {
					t[i][j] = t[i][j - 1];
				}
				t[i][0] = tmp;
			}
		}
	}

	ans = t[1][0] + t[2][0] * 2 + t[3][0] * 4 + t[4][0] * 8;
	printf("%d",ans);
	
	return 0;
}

#include<iostream>
#include<vector>
using namespace std;

int p;
vector<int> a(300000, -1);

int cal(int num){
	int result = 0;
	while (num){
		int temp = 1;
		int mul = num % 10;
		for (int i = 0; i < p; i++)
			temp *= mul;
		result += temp;
		num /= 10;
	}
	return result;
}

int dfs(int num, int cnt){
	if (a[num] != -1)
		return a[num];

	a[num] = cnt;

	return dfs(cal(num), cnt + 1);
}

int main(void){
	int temp;
	cin >> temp >> p;

	cout << dfs(temp, 0) << "\n";
}