跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0572. Card Trick

  • ID: 578
  • 传统题
  • 1000ms
  • 64MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • 高校与竞赛共享题
  • 英文题面
  • 题目来源
  • 题面语言

Card Trick

题目描述

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, telling the number of test cases to follow. Each case consists of one line containing the integer n.

输出格式

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…

样例 1

输入

2
4
5

输出

2 1 4 3
3 1 4 5 2

题目来源:fps-zjgsu-1016-1019.xml;FPS 共享题包,题包内第 3 题。保留原作者与原赛事署名。