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 <stdio.h>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main(void){
int n;
scanf("%d", &n);
char input_str[2000];
while(scanf("%s", input_str) != -1){
string full_str = input_str;
string res_str;
if(full_str.length()%2 == 1){
full_str = full_str.substr(0, full_str.length()-1);
}
while(!full_str.empty()){
int first, end;
first = full_str[0] - 'a';
end = full_str[1] - 'a';
full_str = full_str.substr(2);
int modu = (26+first+end-n)%26;
printf("%c", 'a'+modu);
}
printf(" ");
}
printf("\n");
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |