#include <string>
#include <cstring>
#include <iostream>
#include <cstdio>
using namespace std;
int n;
char en(char a,char b)
{
int t = (int)(a + b - 'a'-'a') - n + 26;
t %= 26;
return (char)t + 'a';
}
int main()
{
scanf("%d\n",&n);
char str[10000];
gets(str);
for(int i = 0;i < strlen(str); i++)
{
if(str[i] == ' ')
{
printf(" ");
i++;
}
if(i + 1 >= strlen(str))
{
break;
}
if(str[i+1] == ' '){
continue;
}
printf("%c",en(str[i],str[i + 1]));
i++;
}
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 |
Correct |
0 ms |
1676 KB |
Output is correct |
8 |
Correct |
0 ms |
1676 KB |
Output is correct |
9 |
Correct |
0 ms |
1676 KB |
Output is correct |
10 |
Correct |
0 ms |
1676 KB |
Output is correct |
11 |
Correct |
0 ms |
1676 KB |
Output is correct |
12 |
Correct |
0 ms |
1676 KB |
Output is correct |
13 |
Correct |
0 ms |
1676 KB |
Output is correct |
14 |
Correct |
0 ms |
1676 KB |
Output is correct |
15 |
Correct |
0 ms |
1676 KB |
Output is correct |
16 |
Correct |
0 ms |
1676 KB |
Output is correct |
17 |
Correct |
0 ms |
1676 KB |
Output is correct |
18 |
Correct |
0 ms |
1676 KB |
Output is correct |
19 |
Correct |
0 ms |
1676 KB |
Output is correct |
20 |
Correct |
0 ms |
1676 KB |
Output is correct |
21 |
Correct |
0 ms |
1676 KB |
Output is correct |
22 |
Correct |
0 ms |
1676 KB |
Output is correct |
23 |
Correct |
0 ms |
1676 KB |
Output is correct |
24 |
Correct |
0 ms |
1676 KB |
Output is correct |
25 |
Correct |
0 ms |
1676 KB |
Output is correct |
26 |
Correct |
0 ms |
1676 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
1676 KB |
Output is correct |
2 |
Correct |
4 ms |
1676 KB |
Output is correct |
3 |
Correct |
4 ms |
1676 KB |
Output is correct |
4 |
Correct |
4 ms |
1676 KB |
Output is correct |
5 |
Correct |
4 ms |
1676 KB |
Output is correct |
6 |
Correct |
0 ms |
1676 KB |
Output is correct |
7 |
Correct |
4 ms |
1676 KB |
Output is correct |
8 |
Correct |
0 ms |
1676 KB |
Output is correct |
9 |
Correct |
4 ms |
1676 KB |
Output is correct |
10 |
Correct |
4 ms |
1676 KB |
Output is correct |
11 |
Correct |
4 ms |
1676 KB |
Output is correct |
12 |
Correct |
4 ms |
1676 KB |
Output is correct |
13 |
Correct |
4 ms |
1676 KB |
Output is correct |
14 |
Correct |
0 ms |
1676 KB |
Output is correct |
15 |
Correct |
0 ms |
1676 KB |
Output is correct |
16 |
Correct |
4 ms |
1676 KB |
Output is correct |
17 |
Correct |
4 ms |
1676 KB |
Output is correct |
18 |
Correct |
4 ms |
1676 KB |
Output is correct |
19 |
Correct |
4 ms |
1676 KB |
Output is correct |
20 |
Correct |
0 ms |
1676 KB |
Output is correct |
21 |
Correct |
4 ms |
1676 KB |
Output is correct |
22 |
Correct |
4 ms |
1676 KB |
Output is correct |
23 |
Correct |
4 ms |
1676 KB |
Output is correct |
24 |
Correct |
4 ms |
1676 KB |
Output is correct |
25 |
Correct |
4 ms |
1676 KB |
Output is correct |
26 |
Correct |
4 ms |
1676 KB |
Output is correct |