POJ 1146 下一个排列

#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
#define nMax 105
char s[nMax];

bool cmp(const char c1,const char c2)
{
	return c1<c2;
}

int main()
{
	while(scanf("%s",s))
	{
		if(strcmp(s,"#")==0)
		{
			break;
		}
		if(next_permutation(s,s+strlen(s),cmp))
		{
			puts(s);
		}
		else
		{
			puts("No Successor");
		}
	}
	return 0;
}