hdu-2319
来源:互联网 发布:srt软件下载 编辑:程序博客网 时间:2024/05/16 08:15
Card Trick
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 168 Accepted Submission(s): 79
Problem Description
The magician shuffles a small pack of cards, holds it face down and performs the following procedure:
1.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.
2.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.
3.Three cards are moved one at a time…
4.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.
1.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.
2.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.
3.Three cards are moved one at a time…
4.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.
Input
On the first line of the input is a single positive integer, telling the number of test cases to follow. Each case consists of one line containing the integer n.
Output
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…
Sample Input
245
Sample Output
2 1 4 33 1 4 5 2
Source
Nordic 2006
代码如下:
#include<stdio.h>#include<queue>using namespace std;int main(){int t,n;int a[20];queue<int>q;scanf("%d",&t);while(t--){scanf("%d",&n); int l,res,k; l=0; for(int i=n;i>=1;i--){ l++; q.push(i); res=i%l; if(res==0)continue; else{ for(int j=1;j<=res;j++){ k=q.front(); q.pop(); q.push(k); } } } int m=0; while(!q.empty()){ a[++m]=q.front(); q.pop(); } for(int i=m;i>=1;i--){ if(i==1){ printf("%d\n",a[i]); } else printf("%d ",a[i]); }}return 0;}
0 0
- hdu-2319
- hdu 2319
- HDU:2319 Card Trick
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- Highcharts 中给图例加百分比
- http header详解
- HTML及css入门知识汇总
- 第四章IOC:DI、DL概念 注入的方法
- java链表实现约瑟夫环
- hdu-2319
- lua table函数
- Time Convertion
- C++学习之多态篇(虚函数和虚析构函数的实现原理--虚函数表)
- YTU 2895: H--唱歌的鸟儿
- JAVA调用动态链接库
- android —— MediaMetadataRetriever获取媒体元数据信息
- 整合UEditor,SSH下
- 计算机图形学进化-Android用户界面人性体验