#include <stdio.h>
#include <string>
using namespace std;
int main()
{
int N;
scanf("%d",&N);
char buf[200];
while(scanf("%s",buf)!=-1)
{
string str = buf;
string res = "";
if(str.length()%2 == 1)
{
str = str.substr(0,str.length()-1);
}
while(!str.empty())
{
char y = str[0] - 'a';
char z = str[1] - 'a';
str = str.substr(2);
char x ='a'+ (26+y+z-N)%26;
res.push_back(x);
}
printf("%s ",res.c_str());
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1236 KB |
Output is correct |
2 |
Correct |
0 ms |
1236 KB |
Output is correct |
3 |
Correct |
0 ms |
1236 KB |
Output is correct |
4 |
Correct |
0 ms |
1236 KB |
Output is correct |
5 |
Correct |
0 ms |
1236 KB |
Output is correct |
6 |
Correct |
0 ms |
1236 KB |
Output is correct |
7 |
Correct |
0 ms |
1236 KB |
Output is correct |
8 |
Correct |
0 ms |
1236 KB |
Output is correct |
9 |
Correct |
0 ms |
1236 KB |
Output is correct |
10 |
Correct |
0 ms |
1236 KB |
Output is correct |
11 |
Correct |
0 ms |
1236 KB |
Output is correct |
12 |
Correct |
0 ms |
1236 KB |
Output is correct |
13 |
Correct |
0 ms |
1236 KB |
Output is correct |
14 |
Correct |
0 ms |
1236 KB |
Output is correct |
15 |
Correct |
0 ms |
1236 KB |
Output is correct |
16 |
Correct |
0 ms |
1236 KB |
Output is correct |
17 |
Correct |
0 ms |
1236 KB |
Output is correct |
18 |
Correct |
0 ms |
1236 KB |
Output is correct |
19 |
Correct |
0 ms |
1236 KB |
Output is correct |
20 |
Correct |
0 ms |
1236 KB |
Output is correct |
21 |
Correct |
0 ms |
1236 KB |
Output is correct |
22 |
Correct |
0 ms |
1236 KB |
Output is correct |
23 |
Correct |
0 ms |
1236 KB |
Output is correct |
24 |
Correct |
0 ms |
1236 KB |
Output is correct |
25 |
Correct |
0 ms |
1236 KB |
Output is correct |
26 |
Correct |
0 ms |
1236 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1236 KB |
Output is correct |
2 |
Correct |
0 ms |
1236 KB |
Output is correct |
3 |
Correct |
0 ms |
1236 KB |
Output is correct |
4 |
Correct |
0 ms |
1236 KB |
Output is correct |
5 |
Correct |
0 ms |
1236 KB |
Output is correct |
6 |
Correct |
0 ms |
1236 KB |
Output is correct |
7 |
Correct |
0 ms |
1236 KB |
Output is correct |
8 |
Correct |
0 ms |
1236 KB |
Output is correct |
9 |
Correct |
0 ms |
1236 KB |
Output is correct |
10 |
Correct |
0 ms |
1236 KB |
Output is correct |
11 |
Correct |
0 ms |
1236 KB |
Output is correct |
12 |
Correct |
0 ms |
1236 KB |
Output is correct |
13 |
Correct |
0 ms |
1236 KB |
Output is correct |
14 |
Correct |
0 ms |
1236 KB |
Output is correct |
15 |
Correct |
0 ms |
1236 KB |
Output is correct |
16 |
Correct |
0 ms |
1236 KB |
Output is correct |
17 |
Correct |
0 ms |
1236 KB |
Output is correct |
18 |
Correct |
0 ms |
1236 KB |
Output is correct |
19 |
Correct |
0 ms |
1236 KB |
Output is correct |
20 |
Correct |
0 ms |
1236 KB |
Output is correct |
21 |
Correct |
0 ms |
1236 KB |
Output is correct |
22 |
Correct |
0 ms |
1236 KB |
Output is correct |
23 |
Correct |
0 ms |
1236 KB |
Output is correct |
24 |
Correct |
0 ms |
1236 KB |
Output is correct |
25 |
Correct |
0 ms |
1236 KB |
Output is correct |
26 |
Correct |
0 ms |
1236 KB |
Output is correct |