Uva 146 - ID Codes

 

 ID Codes 

题目链接：

 

 

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=107&page=show_problem&problem=82

初学者用STL明显的就会让大脑迟钝，一个next_permutation()搞定了

详情请看刘汝佳的竞赛入门P120

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
/*    freopen("input.txt", "r", stdin); */
    int n;
    char p[54];
    while(scanf("%s", p) != EOF && strcmp(p, "#") != 0)
    {
        n = strlen(p);
        if(next_permutation(p, p+n))
        {
            printf("%s\n", p);
        }
        else printf("No Successor\n");
    }
    return 0;
}