next_permutation() 牛逼
~~
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string>
using namespace std;
string s[100];
//char p[10]={'c','b','b','a','a'};
string p;
char test[55];
int main()
{
// freopen("input.txt","r",stdin);
while(cin>>p)
{
if(p[0]=='#')return 0;
for(int i=0;i<p.length();i++)
{
test[i]=p[i];
}
if(next_permutation(test,test+p.length())==false) cout<<"No Successor\n";
else {for(int i=0;i<p.length();i++)
cout<<test[i];
cout<<endl;}
}
}