#include <stdio.h>
#include <string.h>
char S[20010];
int N,K;
int main()
{
int i,a,b,c;
scanf("%d ",&K);
gets(S);
N=strlen(S);
for(i=0;i<N;i++){
if(S[i]==' '){
printf(" ");
continue;
}
else if(S[i+1]==' ')continue;
else if(S[i+1]==0)break;
a=S[i]-'a';b=S[i+1]-'a';
c=a+b-K;
if(c<0)c+=26;
c=c%26+'a';
printf("%c",c);
i++;
}
printf("\n");
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1108 KB |
Output is correct |
2 |
Correct |
0 ms |
1108 KB |
Output is correct |
3 |
Correct |
0 ms |
1108 KB |
Output is correct |
4 |
Correct |
0 ms |
1108 KB |
Output is correct |
5 |
Correct |
0 ms |
1108 KB |
Output is correct |
6 |
Correct |
0 ms |
1108 KB |
Output is correct |
7 |
Correct |
0 ms |
1108 KB |
Output is correct |
8 |
Correct |
0 ms |
1108 KB |
Output is correct |
9 |
Correct |
0 ms |
1108 KB |
Output is correct |
10 |
Correct |
0 ms |
1108 KB |
Output is correct |
11 |
Correct |
0 ms |
1108 KB |
Output is correct |
12 |
Correct |
0 ms |
1108 KB |
Output is correct |
13 |
Correct |
0 ms |
1108 KB |
Output is correct |
14 |
Correct |
0 ms |
1108 KB |
Output is correct |
15 |
Correct |
0 ms |
1108 KB |
Output is correct |
16 |
Correct |
0 ms |
1108 KB |
Output is correct |
17 |
Correct |
0 ms |
1108 KB |
Output is correct |
18 |
Correct |
0 ms |
1108 KB |
Output is correct |
19 |
Correct |
0 ms |
1108 KB |
Output is correct |
20 |
Correct |
0 ms |
1108 KB |
Output is correct |
21 |
Correct |
0 ms |
1108 KB |
Output is correct |
22 |
Correct |
0 ms |
1108 KB |
Output is correct |
23 |
Correct |
0 ms |
1108 KB |
Output is correct |
24 |
Correct |
0 ms |
1108 KB |
Output is correct |
25 |
Correct |
0 ms |
1108 KB |
Output is correct |
26 |
Correct |
0 ms |
1108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1108 KB |
Output is correct |
2 |
Correct |
0 ms |
1108 KB |
Output is correct |
3 |
Correct |
0 ms |
1108 KB |
Output is correct |
4 |
Correct |
0 ms |
1108 KB |
Output is correct |
5 |
Correct |
0 ms |
1108 KB |
Output is correct |
6 |
Correct |
0 ms |
1108 KB |
Output is correct |
7 |
Correct |
0 ms |
1108 KB |
Output is correct |
8 |
Correct |
0 ms |
1108 KB |
Output is correct |
9 |
Correct |
0 ms |
1108 KB |
Output is correct |
10 |
Correct |
0 ms |
1108 KB |
Output is correct |
11 |
Correct |
0 ms |
1108 KB |
Output is correct |
12 |
Correct |
0 ms |
1108 KB |
Output is correct |
13 |
Correct |
0 ms |
1108 KB |
Output is correct |
14 |
Correct |
0 ms |
1108 KB |
Output is correct |
15 |
Correct |
0 ms |
1108 KB |
Output is correct |
16 |
Correct |
0 ms |
1108 KB |
Output is correct |
17 |
Correct |
0 ms |
1108 KB |
Output is correct |
18 |
Correct |
0 ms |
1108 KB |
Output is correct |
19 |
Correct |
0 ms |
1108 KB |
Output is correct |
20 |
Correct |
0 ms |
1108 KB |
Output is correct |
21 |
Correct |
0 ms |
1108 KB |
Output is correct |
22 |
Correct |
0 ms |
1108 KB |
Output is correct |
23 |
Correct |
0 ms |
1108 KB |
Output is correct |
24 |
Correct |
0 ms |
1108 KB |
Output is correct |
25 |
Correct |
0 ms |
1108 KB |
Output is correct |
26 |
Correct |
0 ms |
1108 KB |
Output is correct |