Submission #2403445

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PA;
typedef priority_queue<int, vector<int>, greater<int> > GQint;
typedef priority_queue<int> PQint;
typedef priority_queue<PA, vector<PA>, greater<PA> > GQpair;
typedef priority_queue<PA> PQpair;
typedef	set<int> Sint;
typedef	set<PA> SPA;
typedef map<int, int> MAP;
#define REP(i, a, n) for(ll i = (ll) a;i < (ll) n;i++)
#define fi first
#define se second
#define pb push_back
#define INF 1000000009
#define MOD 100000
#define MAXN 102
#define MAXR 51
#define MAXC 51

string s;

int main()
{
    cin >> s;
    if(s.size() == 1 && s[0] == 'a'){
        cout << -1 << endl;
        return 0;
    }
    REP(i, 0, s.size()){
        if(i == s.size() - 1){
            if(s[i] != 'a'){
                cout << (char)(s[i] - 1) << endl;
                return 0;
            }
        }
        else{
            cout << s[i];
        }
    }cout << endl;

    return 0;
}

/*













*/

Submission Info

Judge Result