题意很简单,就是按照给定的序列order[],将第i个位置的牌移到第order[i]位置.
注意多次洗牌需要保留上次的顺序基础上进行,不能破坏。
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
/*
Created by HarvestWu on 2018/5/1.
*/
using namespace std;
int a[55];
int b[55];
void init()
{
for (int i = 0; i < 55; i++)
{
a[i] = i;
b[i] = i;
}
}
void copy()
{
for (int i = 0; i < 55; i++)
a[i] = b[i]; //保存上次的顺序
}
int main()
{
int n;
int order[55];
init();
scanf("%d", &n);
for (int i = 1; i < 55; i++)
scanf("%d", &order[i]);
while (n--)
{
for (int i = 1; i < 55; i++)
b[order[i]] = a[i];
copy();//备份顺序
}
for (int i = 1; i < 55; i++)
{
if (b[i]>=1&&b[i]<=13)
printf("S%d", b[i]);
if (b[i] >= 14 && b[i] <= 26)
printf("H%d", b[i] - 13);
if (b[i] >= 27 && b[i] <= 39)
printf("C%d", b[i] - 26);
if (b[i] >= 40 && b[i] <= 52)
printf("D%d", b[i] - 39);
if (b[i] >= 53 && b[i] <= 54)
printf("J%d", b[i] - 52);
if (i != 54)
printf(" ");//最后一张牌后无空格
}
return 0;
}