题解 | 凯撒加密

#include <iostream>
#include<vector>
using namespace std;

int main() {
    int n;
    string s;
    cin>>n>>s;
    vector<char> letter(26);
    vector<char> letternew(s.size());
    letter={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
    for(int i=0;i<s.size();i++){
        for(int j=0;j<26;j++){
            if(s[i]==letter[j]){
                int newPos = (j + n) % 26;
                letternew[i] = letter[newPos];
                break;
            }
        }
    }
    for(int i=0;i<letternew.size();i++){
        cout<<letternew[i];
    }
}
// 64 位输出请用 printf("%lld")