2017年上海金马五校程序设计竞赛：Problem A : STEED Cards

Problem A : STEED Cards

From: DHUOJ, 2017060301

Submit (Out of Contest)

OJ链接

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

1
2
3
4
47
48
49

 

Sample Output

DEEST
DEETS
DESET
DESTE
STEDE
STEED
TDEES

题目意思就是输出STEED的所有全排列，用全排列函数来处理即可

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    string ch[65];
    string s="STEED";
    sort(s.begin(),s.end());
    int count1=0;
    ch[++count1]=s;
    while(next_permutation(s.begin(),s.end()))
    {
        ch[++count1]=s;
        if(count1>60)
            break;
    }
    while(scanf("%d",&n)!=EOF)
    {
       cout<<ch[n]<<endl;
    }
    return 0;
}