146 - ID Codes

풀이

#include <iostream>
#include <algorithm>

using namespace std;

// next_permutaion 을 사용하면 쉽게 풀이 가능
int main() {
    string str;
    while (cin >> str) {
        if (str[0] == '#') {
            break;
        }

        bool val = next_permutation(str.begin(), str.end());
        if (val == false) {
            cout << "No Successor" << endl;
        } else {
            cout << str << endl;
        }

    }
    return 0;
}

참고

• Lexicographically next permutation in C++