51Nod 1384 全排列(next-permutation)

题目链接

#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<queue>using namespace std;int main(){char s[11];cin>>s;int a[20],len=strlen(s);for(int i=0;i<len;i++) a[i]=s[len-i-1]-'0';sort(a,a+len); do{for(int i=0;i<len;i++) cout<<a[i];cout<<endl;}while(next_permutation(a,a+len));return 0;}