浙工大姗姗杯round1 E - Generating Fast UVA - 10098

最新推荐文章于 2018-11-29 23:07:55 发布

lunaArcher

最新推荐文章于 2018-11-29 23:07:55 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/lunaArcher/article/details/75146792

本文介绍了一种高效的字符串全排列算法，使用C++实现，通过next_permutation函数按升序输出所有可能的排列组合。

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

UVA - 10098 - Generating Fast

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 <stdio.h>
#include<algorithm>
#include <string.h>
 
using namespace std;
 
const int N = 10;
char s[N+1];
 
int main()
{
    int t, len;
 
    scanf("%d", &t);
    while(t--) {
        scanf("%s", s);
 
        len = strlen(s);
        sort(s, s + len);
 
        do {
            printf( "%s\n", s);
        } while(next_permutation(s, s + len));
        printf( "\n");
    }
 
    return 0;
}