UVa-146(ID Codes)

 

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    string str,rev;

    while(cin>>str)

    {

        if(str=="#") break;

        rev=str;

        sort(rev.begin(),rev.end());

        reverse(rev.begin(),rev.end());

        if(str==rev) cout<<"No Successor"<<endl;

        else

        {

            next_permutation(str.begin(),str.end());

            cout<<str<<endl;

        }

    }

    return 0;

}

///Alhamdulillah

Problem Link:https://onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&category=0&problem=82&mosmsg=Submission+received+with+ID+27532500