UVA 10205 - Stack 'em Up

飞上天空的鱼

于 2013-02-11 00:02:03 发布

阅读量414

点赞数

CC 4.0 BY-SA版权

分类专栏： UVA

本文链接：https://blog.youkuaiyun.com/chenchaoflight/article/details/8578348

UVA 专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一种基于输入的洗牌映射进行扑克牌重新排序的算法实现。通过读取用户输入的洗牌方式，该程序能够准确地将扑克牌从初始状态调整到指定的顺序，并以清晰易读的形式输出每张牌的面值和花色。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<cstdio>
#include<cstring>

int map[110][60];
char suit[10][20] = {"Clubs","Diamonds","Hearts","Spades"};
char value[15][10] = {"2","3","4","5","6","7","8","9","10","Jack","Queen","King","Ace"};
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= 52; j++)
scanf("%d",&map[i][j]);
getchar();
char t1[10];
int pk1[60],pk2[60];
for(int i = 1; i <=52; i++)
pk1[i] = pk2[i] = i;
while(gets(t1))
{
if(strcmp(t1,"")==0) break;
int t2;
sscanf(t1,"%d",&t2);
for(int i = 1; i <= 52; i++)
pk2[i] = pk1[map[t2][i]];
memcpy(pk1,pk2,sizeof(pk2));
}
for(int i = 1; i <= 52; i++)
{
int x = (pk1[i]-1) % 13;
int y = (pk1[i]-1) / 13;
printf("%s of %s\n",value[x],suit[y]);
}
if(t) printf("\n");
memset(map,0,sizeof(map));
}
return 0;
}