# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9304 | levant916 | Veni, vidi, vici (kriii2_V) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <string>
using namespace std;
string key[100];
string solve(string str, int n) {
string ans;
int cnt = str.size();
if (cnt % 2 == 1) cnt--;
for (int i = 0; i < cnt; i+=2) {
ans.push_back((str[i] - 'a' + str[i + 1] - 'a' - n) % 26 + 'a');
}
return ans;
}
int main(void) {
int n;
cin >> n;
char in;
int cnt = 0;
string str;
char str2[101];
char c;
getchar();
do {
c = getchar();
if (c == ' ') {
cnt++;
}else if (c != '\n' ){
key[cnt].push_back(c);
}
} while (c != '\n');
for (int i = 0; i < cnt + 1; i++) {
if (i != 0) cout << ' ';
cout << solve(key[i], n) ;
}
return 0;
}