这道题的范围很小,可以直接硬肝

话不多说,直接上代码

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    if(n % 26 == 1) cout << "BCDEFGHIJKLMNOPQRSTUVWXYZA";
    if(n % 26 == 2) cout << "CDEFGHIJKLMNOPQRSTUVWXYZAB";
    if(n % 26 == 3) cout << "DEFGHIJKLMNOPQRSTUVWXYZABC";
    if(n % 26 == 4) cout << "EFGHIJKLMNOPQRSTUVWXYZABCD";
    if(n % 26 == 5) cout << "FGHIJKLMNOPQRSTUVWXYZABCDE";
    if(n % 26 == 6) cout << "GHIJKLMNOPQRSTUVWXYZABCDEF";
    if(n % 26 == 7) cout << "HIJKLMNOPQRSTUVWXYZABCDEFG";
    if(n % 26 == 8) cout << "IJKLMNOPQRSTUVWXYZABCDEFGH";
    if(n % 26 == 9) cout << "JKLMNOPQRSTUVWXYZABCDEFGHI";
    if(n % 26 == 10) cout << "KLMNOPQRSTUVWXYZABCDEFGHIJ";
    if(n % 26 == 11) cout << "LMNOPQRSTUVWXYZABCDEFGHIJK";
    if(n % 26 == 12) cout << "MNOPQRSTUVWXYZABCDEFGHIJKL";
    if(n % 26 == 13) cout << "NOPQRSTUVWXYZABCDEFGHIJKLM";
    if(n % 26 == 14) cout << "OPQRSTUVWXYZABCDEFGHIJKLMN";
    if(n % 26 == 15) cout << "PQRSTUVWXYZABCDEFGHIJKLMNO";
    if(n % 26 == 16) cout << "QRSTUVWXYZABCDEFGHIJKLMNOP";
    if(n % 26 == 17) cout << "RSTUVWXYZABCDEFGHIJKLMNOPQ";
    if(n % 26 == 18) cout << "STUVWXYZABCDEFGHIJKLMNOPQR";
    if(n % 26 == 19) cout << "TUVWXYZABCDEFGHIJKLMNOPQRS";
    if(n % 26 == 20) cout << "UVWXYZABCDEFGHIJKLMNOPQRST";
    if(n % 26 == 21) cout << "VWXYZABCDEFGHIJKLMNOPQRSTU";
    if(n % 26 == 22) cout << "WXYZABCDEFGHIJKLMNOPQRSTUV";
    if(n % 26 == 23) cout << "XYZABCDEFGHIJKLMNOPQRSTUVW";
    if(n % 26 == 24) cout << "YZABCDEFGHIJKLMNOPQRSTUVWX";
    if(n % 26 == 25) cout << "ZABCDEFGHIJKLMNOPQRSTUVWXY";
    if(n % 26 == 26) cout << "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    return 0;
}

只有26个英文字母,所以直接26个分支,学过周期问题的朋友应该知道分支的原理的