题解 | 凯撒加密
凯撒加密
https://www.nowcoder.com/practice/006b7917d3784371a43cfbae01a9313d
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
cin>>n;
cin>>s;
//取余取到26以内
int new_n=n%26;
for(int i=0;i<s.size();i++){
//过头的循环
if(s[i]+new_n>122) s[i]=s[i]-26+new_n;
//不过头的后移
else s[i]=s[i]+new_n;
cout<<s[i];
}
}
