UVA - 10098 Generating Fast

最新推荐文章于 2020-07-27 19:43:35 发布

苏摩夜

最新推荐文章于 2020-07-27 19:43:35 发布

阅读量5.8k

点赞数

CC 4.0 BY-SA版权

分类专栏：第 7 章暴力求解法文章标签： UVA - 10098 Generati

本文链接：https://blog.youkuaiyun.com/zz_FreeSky/article/details/40091199

第 7 章暴力求解法专栏收录该内容

14 篇文章

订阅专栏

本文详细介绍了如何使用next_permutation()函数求解字符串的全排列问题，包括输入处理、排序和全排列输出。适用于计算机科学领域的算法学习。

摘要生成于 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

Sample Output

ab
ba

abc
acb
bac
bca
cab
cba

abc
acb
bac
bca
cab

cba

题意：

求字符串的全排列；

依旧利用next_permutation()这一个函数；

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;

int n;

int main () {
	cin >> n;
	while (n--) {
		string str;
		cin >> str;
		sort(str.begin(),str.end());
		cout <<str<<endl;
		while (next_permutation(str.begin(),str.end())) {
			cout << str<<endl;	
		}

		//if (n)
			cout <<endl;
	}

	return 0;
}