题目链接:
简单模拟
代码如下:
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static HashMap<Integer, String> map=new HashMap<Integer, String>();
static int N;
static int[] change;
static int[] now;
static int[] next;
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
change=new int[55];
now=new int[55];
next=new int[55];
N=sc.nextInt();
for(int i=1;i<=13;i++)
map.put(i, "S"+i);
for(int i=1;i<=13;i++)
map.put(i+13, "H"+i);
for(int i=1;i<=13;i++)
map.put(i+26, "C"+i);
for(int i=1;i<=13;i++)
map.put(i+39, "D"+i);
map.put(53, "J1");
map.put(54, "J2");
for(int i=1;i<=54;i++){
change[i]=sc.nextInt();
now[i]=i;
}
for(int i=0;i<N;i++){
for(int j=1;j<=54;j++){
next[change[j]]=now[j];
}
for(int j=1;j<=54;j++)
now[j]=next[j];
}
for(int i=1;i<=53;i++)
System.out.print(map.get(now[i])+" ");
System.out.print(map.get(now[54]));
}
}