uva 10098 Generating Fast

直接应用库函数next_permutation()就行了。

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

char buffer[200];

int cmp(const void *a, const void *b)
{
	return *((char*)a) - *((char*)b);
}

void func()
{
	qsort((void*)buffer, strlen(buffer), sizeof(char), cmp);
	do 
	{
		printf("%s\n", buffer);
	} while (next_permutation(buffer, buffer+strlen(buffer)));
	printf("\n");
}

int main(void)
{
	int n, i;

	//freopen("input.dat", "r", stdin);

	scanf("%d", &n);
	for(i=1; i<=n; i++)
	{
		scanf("%s", buffer);

		func();
	}

	return 0;
}