Card Trick
时间限制:
1000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
The magician shuffles a small pack of cards, holds it face down and performs the following procedure:
- The top card is moved to the bottom of the pack. The new top card is dealt face up onto the table. It is the Ace of Spades.
- Two cards are moved one at a time from the top to the bottom. The next card is dealt face up onto the table. It is the Two of Spades.
- Three cards are moved one at a time…
- This goes on until the nth and last card turns out to be the n of Spades.
This impressive trick works if the magician knows how to arrange the cards beforehand (and knows how to give a false shuffle). Your program has to determine the initial order of the cards for a given number of cards, 1 ≤ n ≤ 13.
-
输入
- On the first line of the input is a single positive integer k, telling the number of test cases to follow. 1 ≤ k ≤ 10 Each case consists of one line containing the integer n. 1 ≤ n ≤ 13 输出
- For each test case, output a line with the correct permutation of the values 1 to n, space separated. The first number showing the top card of the pack, etc… 样例输入
-
245
样例输出
-
2 1 4 33 1 4 5 2
来源
- 第六届河南省程序设计大赛 上传者
- ACM_赵铭浩
参考:点击打开链接
代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int a[15];
void mov(int bot,int top,int n){
while(n--){
int t=a[top],tt;
for(int i=bot;i<=top;i++){
tt=a[i];
a[i]=t;
t=tt;
}
}
}
int main(){
int t,n,top,bot;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++)a[i]=i;
top=bot=n;
for(int i=n;i>=1;i--){
mov(bot,top,i%(top-bot+1));
bot--;
}
for(int i=1;i<=n;i++){
printf("%d ",a[i]);
}
printf("\n");
}
}