STEED Cards（打表金马五校赛-东华大学）

最新推荐文章于 2018-05-07 23:02:00 发布

原创最新推荐文章于 2018-05-07 23:02:00 发布 · 446 阅读

0 ·

CC 4.0 BY-SA版权

------题解------ 专栏收录该内容

179 篇文章

订阅专栏

本文介绍了一个关于单词“STEED”所有可能排列的问题，并通过编程的方式解决了如何获取这些排列并按字典序排序的问题。文章提供了一个完整的C++程序示例，该程序能够根据输入的整数N返回“STEED”的第N个排列。

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

Problem A : STEED Cards

From: DHUOJ, 2017060301

&lt;a type="button" class="btn btn-default" href="/solution/submit.html?problemId=5284"&gt;Submit&lt;/a&gt; (Out of Contest)

Time Limit: 1 s

Description

Corn does not participate the STEED contest, but he is interested in the word "STEED". So, Corn writes all permutations of the word "STEED" on different cards and gets 60 cards finally.

Corn sorts these cards in lexicographical order, and marks them from 1 to 60.

Now, Corn gives you a integer N (1 ≤ N ≤ 60), could you tell him the word on the N^th card?

Input

There are multiple test cases (no more than 60).
For each test case, there is one integer N (1 ≤ N ≤ 60) in a line.

Output

For each test case, you should output one line with the word on the N^th card.

Sample Input

Sample Output

DEEST
DEETS
DESET
DESTE
STEDE
STEED
TDEES

Author: Corn

#include<iostream>
#include<cstdio>
using namespace std;
 
char s[60][6]={"DEEST","DEETS","DESET","DESTE","DETES",
"DETSE","DSEET","DSETE","DSTEE","DTEES","DTESE","DTSEE","EDEST",
"EDETS","EDSET","EDSTE","EDTES","EDTSE","EEDST","EEDTS","EESDT","EESTD",
"EETDS","EETSD","ESDET","ESDTE","ESEDT","ESETD","ESTDE","ESTED","ETDES","ETDSE",
"ETEDS","ETESD","ETSDE","ETSED","SDEET","SDETE","SDTEE","SEDET","SEDTE",
"SEEDT","SEETD","SETDE","SETED","STDEE","STEDE","STEED","TDEES","TDESE",
"TDSEE","TEDES","TEDSE","TEEDS","TEESD","TESDE","TESED","TSDEE","TSEDE","TSEED"
};
int main()
{
    int n;
    while(cin>>n){
        cout<<s[n-1]<<endl; 
    }
    return 0;
}