1042. Shuffling Machine (20)

#define  _CRT_SECURE_NO_WARNINGS 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream> 
#include<algorithm>
#include<stdio.h> 
using namespace std; 
int main()
{  
string ori[55]; 
for (int i = 1; i <= 52; i++)

int chose =( i-1) / 13;
string stmp;
switch  (chose)
{
case 0:
stmp = "S";
break;
case 1:
stmp = "H";
break;
case 2:
stmp = "C";
break;
case 3:
stmp = "D";
break;
}


char tmp[5];
int inum = i % 13;
if (inum == 0)
inum = 13;
sprintf(tmp, "%s%d", stmp.c_str(), inum);
ori[i] = tmp;
}
ori[53] = "J1"; ori[54] = "J2";
int N;
cin >> N;
int *order = new int[55];
for (int i = 1; i < 55; i++)
scanf("%d",&order[i]);
string latter[55];
bool chose = false;
while (N>0)
{
if (!chose)
{
for (int i = 1; i < 55; i++)
{
latter[order[i]] = ori[i];
}
chose = true;
}
else
{
for (int i = 1; i < 55; i++)
{
ori[order[i]] = latter[i];
}
chose = false;
}
N--;
}
if (chose)
{
cout << latter[1];
for (int i = 2; i < 55; i++)
{
cout<<" "<<latter[i];
}
}
else
{
cout << ori[1];
for (int i = 2; i < 55; i++)
{
cout << " " << ori[i];
}
}
return 0;
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值