【PAT甲级】1042. Shuffling Machine (20)
来源:互联网 发布:linux ntp同步 编辑:程序博客网 时间:2024/06/08 02:49
#include <stdio.h>#define N 54int main(int argc, char* argv[]) { int k; scanf("%d", &k); int i, j; int a[N + 1] = {0}; int b[N + 1] = {0}; for (i = 1; i <= N; i++) { scanf("%d", &a[i]); b[i] = i; } int flag[N + 1] = {0}; for (j = 0; j < k; j++) { for (int s = 1; s <= N; s++) { flag[s] = 0; } for (i = 1; i <= N; i++) { if (flag[i] == 0) { int t = i; int tmp = b[t]; int tmp2; do { flag[a[t]] = 1; tmp2 = b[a[t]]; b[a[t]] = tmp; tmp = tmp2; t = a[t]; } while (t != i); b[a[t]] = tmp; flag[a[t]] = 1; } } } for (i = 1; i <= N; i++) { if ((b[i] - 1) / 13 == 0) { printf("S%d", b[i]); } else if ((b[i] - 1) / 13 == 1) { printf("H%d", (b[i] - 1) % 13 + 1); } else if ((b[i] - 1) / 13 == 2) { printf("C%d", (b[i] - 1) % 13 + 1); } else if ((b[i] - 1) / 13 == 3) { printf("D%d", (b[i] - 1) % 13 + 1); } else if ((b[i] - 1) / 13 == 4) { printf("J%d", (b[i] - 1) % 13 + 1); } if (i < N) printf(" "); else printf("\n"); } return 0;}
0 0
- PAT甲级.1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20) PAT 甲级
- 【PAT甲级】1042. Shuffling Machine (20)
- PAT甲级练习1042. Shuffling Machine (20)
- PAT甲级1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)-PAT甲级
- PAT 甲级 1042. Shuffling Machine (20)
- PAT甲级 1042. Shuffling Machine (20)
- 1042. Shuffling Machine (20)-PAT甲级真题
- 【待复习】PAT甲级1042. Shuffling Machine (20)
- PAT(甲级)1042. Shuffling Machine
- 1042. Shuffling Machine (20)-PAT
- 【PAT】1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- PAT 1042. Shuffling Machine (20)
- pat 1042. Shuffling Machine (20)
- 进程通信之消息队列
- scala远程调用thrift接口
- svn无法提交代码
- React Native开发小结
- C语言 结构体 数组 指针
- 【PAT甲级】1042. Shuffling Machine (20)
- 生成一个接口
- Debian通过ODBC连接Mysql
- 如何在Mac OS X中开启或关闭显示隐藏文件命令
- 数据结构作业 栈 实现 括号匹配 问题
- ios客户端学习-AppDelegate获取UINavigationController及UIStoryboard
- 入门 | 初学者必读:解读14个深度学习关键词
- 解决ie9以下的跨域问题
- 简析TCP的三次握手与四次分手