UVA-10098-Generating Fast

最新推荐文章于 2020-03-10 16:22:37 发布

weixin_34343000

最新推荐文章于 2020-03-10 16:22:37 发布

阅读量118

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/deadacm/archive/2011/12/13/2286945.html

本文介绍了如何通过排序和全排列算法，高效地生成给定字符串的所有可能有序排列。包括输入解析、排序过程及输出格式说明，特别关注了样例输入和输出分析，确保算法的正确性和效率。

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

一、题目

Problem C
Generating Fast, Sorted Permutation

Input: Standard Input

Output: Standard Output

Generating permutation has always been an important problem in computer science. In this problem you will have to generate the permutation of a given string in ascending order. Remember that your algorithm must be efficient.

Input

The first line of the input contains an integer n, which indicates how many strings to follow. The next n lines contain n strings. Strings will only contain alpha numerals and never contain any space. The maximum length of the string is 10.

Output

For each input string print all the permutations possible in ascending order. Not that the strings should be treated, as case sensitive strings and no permutation should be repeated. A blank line should follow each output set.

Sample Input

3
ab
abc
bca

二、分析

利用函数，先对字母进行排序，然后全排列顺序输出。

注意此题uva较狠指出在于最后有一行空行，A blank line should follow each output set.

小弟习惯性的处理掉了，结果WA了3次，看来画蛇添足了啊……

三、AC源代码

View Code

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <string>
 4 using namespace std;
 5 int main()
 6 {
 7     int n;
 8     string str;
 9     cin>>n;
10     while(n--)
11     {
12         cin>>str;
13         sort(str.begin(),str.end());
14         do
15         {
16             cout<<str<<endl;
17         }while(next_permutation(str.begin(),str.end()));
18         
19         cout<<endl;
20     }
21     return 0;
22 }