洗牌机器。
作者:互联网
#include <stdio.h>
#define MAX 54
void printing(int a);
int main(){
int a[MAX];
int b[MAX];
int T;
int i = 0;
int number[MAX];
scanf("%d", &T);
while((scanf("%d", &number[i])) != EOF)
++i;
for(int i = 0; i < MAX; ++i)
a[i] = i;
while(T--){
for(int j = 0; j < MAX; ++j){
int m = number[j] - 1;
b[m] = a[j];
}
for(int j = 0; j < MAX; ++j)
a[j] = b[j];
}
for(int j = 0; j < MAX ; ++j)
printing(a[j]);
return 0;
}
void printing(int a){
if((a/13) == 0)
printf("S");
else if((a/13) == 1)
printf("H");
else if((a/13) == 2)
printf("C");
else if((a/13) == 3)
printf("D");
else
printf("J");
printf("%d ", a%13 + 1);
}
标签:13,机器,int,MAX,洗牌,else,++,printf 来源: https://blog.csdn.net/weixin_62727423/article/details/121438541