L1-2 倒数第N个字符串 (15 分)

题目链接

转化成26进制，例如28的话，先减去1，变成27，然后把27转化成26进制，即11，然后把原本的字符串“zzz”按位减去就行了，最后就变成zyy

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

stack<int> st;
stack<int> e;

int main(int argc, char const *argv[]) {
    int n, m;
    cin >> n >> m;
    string s = "";
    for (int i = 0; i < n; i++) s += "z";
    m--;
    while (m) {
        st.push(m % 26);
        m /= 26;
    }
    while (!st.empty()) {
        e.push(st.top());
        st.pop();
    }
    int i = n - 1;
    while (!e.empty()) {
        s[i] -= e.top();
        e.pop();
        i--;
    }
    cout << s << endl;
    return 0;
}