51Nod 1384 全排列

#include <iostream>
#include <cstring>
#include <algorithm> 
using namespace std;
int main()
{
	int len,j,k;
	char a[233];
	cin>>a;
	len=strlen(a);
	sort(a,a+len);
	do{
		cout<<a<<endl;
	}while(next_permutation(a,a+len)); 
	return 0;
 } 

STL 感觉打开了潘多拉魔盒