next_permutation全排序

#include<bits/stdc++.h>   //next_permutation全排序 
using namespace std;
int main()
{
    int n,len=0;
    cin>>n;
    int a[10005]={0};
    while(n)
    {
        a[len]=n%10;
        len++;
        n/=10;
    }
    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;
}

 #include<bits/stdc++.h>   //next_permutation全排序 
using namespace std;
int main()
{
    string s;
    cin>>s;
    set<string>ans;
    sort(s.begin(),s.end());
    do
    {
        ans.insert(s);
    }while(next_permutation(s.begin(),s.end()));
    for(set<string>::iterator it=ans.begin();it!=ans.end();it++)
    {
        cout<<*it<<endl;
     } 
     return 0;
} 
```cpp   
-#include<bits/stdc++.h>   //next_permutation全排序 
using namespace std;
int main()
{
    string str;
    cin>>str;
    sort(str.begin(),str.end());
    do{
        cout<<str<<endl;
    }while(next_permutation(str.begin(),str.end()));
    return 0;
}