题目描述
某蒟蒻(是我没错)迷上了“小书童”,有一天登陆时忘记密码了(他没绑定邮箱or手机),于是便把问题抛给了神犇(zlsnb!)。
输入
1
qwe
输出
rxf
个人思路:
约瑟夫环原理循环求解
代码如下
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
string a;
int n;
char word[26] = {'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'};
cin >> n;
cin >> a;
if(n == 0){
cout << a;
return 0;
}
else if(n >= 26) n = n % 26;
for(int i = 0;i < a.length();i ++){
a[i] = word[(a[i] - 'a' + n) % 26];
cout << a[i];
}
return 0;
}