UVA 146 - ID Codes

Problem PDF

Solution:

#include
#include
#include
#include
using namespace std;
int main()
{
    char s[100];
    while(gets(s))
    {
        if(s[0]=='#')
        break;
        int l=strlen(s);
        if(next_permutation(s,s+l))
        puts(s);
        else
        printf("No Successor\n");

    }
    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/146/146.cpp