#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);
string tmp_str;
cin>>tmp_str;
char input_str[200];
gets(input_str);
string full_str = tmp_str + input_str;
while(true){
if(full_str.length() <= 1){
break;
}
if(full_str[1] == ' '){
printf(" ");
full_str = full_str.substr(2);
continue;
}
if(full_str[0] == ' '){
printf(" ");
full_str = full_str.substr(1);
continue;
}
int first, end;
first = full_str[0] - 'a';
end = full_str[1] - 'a';
int modu = (first+end-n)%26;
printf("%c", 'a'+modu);
full_str = full_str.substr(2);
}
printf("\n");
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1676 KB |
Output is correct |
2 |
Correct |
0 ms |
1676 KB |
Output is correct |
3 |
Correct |
0 ms |
1676 KB |
Output is correct |
4 |
Correct |
0 ms |
1676 KB |
Output is correct |
5 |
Correct |
0 ms |
1676 KB |
Output is correct |
6 |
Correct |
0 ms |
1676 KB |
Output is correct |
7 |
Incorrect |
0 ms |
1676 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Halted |
0 ms |
0 KB |
- |