Submission #2909496

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;

signed main(){
    int a;
    cin >> a;
    string s;
    cin >> s;
    int n = s.size();
    vector<int> d(n), tmp;
    int len = n;
    rep(i, 0, n) d[i] = s[i] - 'a' + 1;
    tmp = d;
    for(int i = n - 1; i > 0; i--){
        d[i - 1] += d[i] * a;
        d[i] = 0;
        for(int j = i - 1; j > 0; j--){
            if(d[j] <= 26){
                break;
            }
            if((d[j] - 26) * a > 26){
                d[0] = INF; break;
            }
            d[j - 1] += (d[j] - 26) * a;
            d[j] = 26;
        }
        if(d[0] > 26){
            break;
        }
        len = i;
        tmp = d;
    }
    d = tmp;
    for(int i = len - 1; i > 0; i--){
        tmp = d;
        while(1){
            d[i - 1] += a;
            d[i]--;
            for(int j = i - 1; j > 0; j--){
                if(d[j] <= 26){
                    break;
                }
                if((d[j] - 26) * a > 26){
                    d[0] = INF; break;
                }
                d[j - 1] += (d[j] - 26) * a;
                d[j] = 26;
            }
            if(d[0] > 26) break;
            tmp = d;
        }
        d = tmp;
    }
    rep(i, 0, len){
        char c = 'a' + d[i] - 1;
        cout << c;
    }
    cout << endl;
}

Submission Info

Judge Result