Submission #162121

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>

using namespace std;

const int INF = 1 << 29;
typedef pair<int, int> P;

string n;

int main(void)
{
	while (cin >> n && n != "")
	{
		if (n.size() != 1)
		{
			n.erase(n.end() - 1);
			cout << n << endl;
		}
		else
		{
			if (n[0] != 'a')
			{
				n[0]--;
				cout << n << endl;
			}
			else
			{
				cout << "-1" << endl;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result