UVA - 10098 Generating Fast （全排列）

最新推荐文章于 2017-07-29 15:27:53 发布

原创最新推荐文章于 2017-07-29 15:27:53 发布 · 879 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Uva #Generating Fast

暴力求解专栏收录该内容

27 篇文章

订阅专栏

本文介绍了一种使用标准模板库(STL)中的sort和next_permutation函数来高效生成字符串所有升序排列的方法。通过示例代码展示了如何读取多个字符串，并为每个字符串生成并输出其所有不重复的排列。

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

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

Sample Output

ab
ba

abc
acb
bac
bca
cab
cba

abc
acb
bac
bca
cab

cba

解析：生成一个字符串的全排列，直接调用STL就可以轻松解决。

#include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
using namespace std;

int main() {
	int n;
	string str;
	while( cin >> n) {
		for(int i = 0; i < n; i++){
			cin >> str;
			sort(str.begin(),str.end());
			do{
				cout << str << endl;
			}
			while( next_permutation(str.begin(),str.end()) );
			cout << endl;
		}
	}
	return 0;
}