UVA146生成可重集的下一个排列

懒得写函数调用了，直接调用函数库多省劲。

#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<string>#include<algorithm>#include<map>#include<set>#include<vector>#include<stack>#include<queue>#include<climits>using namespace std;const int N=1e6+10;int main(){    string s;    while(cin>>s&&s!="#")    {         if(next_permutation(s.begin(),s.end()))            cout<<s<<endl;         else            cout<<"No Successor"<<endl;    }    return 0;}