poj1731 Orders

暴力解直接用next_permutation()列举全部

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
	string s,c;
	cin>>s;
	sort(s.begin(),s.end());
	c=s;
	while(1)
	{
		cout<<s<<endl;
		next_permutation(s.begin(),s.end());
		if(s==c)break;
	}
}