1042. Shuffling Machine (20)

最新推荐文章于 2024-02-19 11:56:54 发布

要认认真真

最新推荐文章于 2024-02-19 11:56:54 发布

阅读量350

点赞数

分类专栏： pat-a-简单模拟

本文链接：https://blog.youkuaiyun.com/dy476813515/article/details/43529821

版权

pat-a-简单模拟专栏收录该内容

41 篇文章

订阅专栏

点击打开链接

#include <cstdio>
char c[][4]={"","S1","S2","S3","S4","S5","S6","S7","S8","S9","S10","S11","S12","S13",
	"H1","H2","H3","H4","H5","H6","H7","H8","H9","H10","H11","H12","H13",
	"C1","C2","C3","C4","C5","C6","C7","C8","C9","C10","C11","C12","C13",
	"D1","D2","D3","D4","D5","D6","D7","D8","D9","D10","D11","D12","D13", "J1", "J2"};
int num[55]={0};
int pos[55]={0};
int main(){
	freopen("in.txt","r",stdin);
	int k;
	scanf("%d",&k);
	for(int i=1;i<=54;i++){
		scanf("%d",&pos[i]);
	}
	for(int i=1;i<=54;i++){
		int tmp=pos[i];
		for(int j=1;j<k;j++){
			tmp=pos[tmp];
		}
		num[tmp]=i;
	}
	for(int i=1;i<54;i++){
		printf("%s ",c[num[i]]);
	}
	printf("%s\n",c[num[54]]);
	return 0;
}