답안 #8407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
8407	2014-09-13T17:03:31 Z	ainta	Veni, vidi, vici (kriii2_V)	C++	4 / 4	0 ms	1096 KB

V

#include<stdio.h>
int n, i, c, ck;
char p[11000];
int main()
{
	scanf("%d", &n);
	gets(p);
	gets(p);
	for (i = 0; p[i]; i++){
		if (p[i] == ' '){
			c = ck = 0;
			printf(" ");
			continue;
		}
		p[i] -= 'a';
		if (ck){
			printf("%c", (c + p[i] - n + 26) % 26 + 'a');
			ck = c = 0;
		}
		else{
			ck = 1, c = p[i];
		}
	}
}

Subtask #1

1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1096 KB	Output is correct
2	Correct	0 ms	1096 KB	Output is correct
3	Correct	0 ms	1096 KB	Output is correct
4	Correct	0 ms	1096 KB	Output is correct
5	Correct	0 ms	1096 KB	Output is correct
6	Correct	0 ms	1096 KB	Output is correct
7	Correct	0 ms	1096 KB	Output is correct
8	Correct	0 ms	1096 KB	Output is correct
9	Correct	0 ms	1096 KB	Output is correct
10	Correct	0 ms	1096 KB	Output is correct
11	Correct	0 ms	1096 KB	Output is correct
12	Correct	0 ms	1096 KB	Output is correct
13	Correct	0 ms	1096 KB	Output is correct
14	Correct	0 ms	1096 KB	Output is correct
15	Correct	0 ms	1096 KB	Output is correct
16	Correct	0 ms	1096 KB	Output is correct
17	Correct	0 ms	1096 KB	Output is correct
18	Correct	0 ms	1096 KB	Output is correct
19	Correct	0 ms	1096 KB	Output is correct
20	Correct	0 ms	1096 KB	Output is correct
21	Correct	0 ms	1096 KB	Output is correct
22	Correct	0 ms	1096 KB	Output is correct
23	Correct	0 ms	1096 KB	Output is correct
24	Correct	0 ms	1096 KB	Output is correct
25	Correct	0 ms	1096 KB	Output is correct
26	Correct	0 ms	1096 KB	Output is correct

Subtask #2

3.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1096 KB	Output is correct
2	Correct	0 ms	1096 KB	Output is correct
3	Correct	0 ms	1096 KB	Output is correct
4	Correct	0 ms	1096 KB	Output is correct
5	Correct	0 ms	1096 KB	Output is correct
6	Correct	0 ms	1096 KB	Output is correct
7	Correct	0 ms	1096 KB	Output is correct
8	Correct	0 ms	1096 KB	Output is correct
9	Correct	0 ms	1096 KB	Output is correct
10	Correct	0 ms	1096 KB	Output is correct
11	Correct	0 ms	1096 KB	Output is correct
12	Correct	0 ms	1096 KB	Output is correct
13	Correct	0 ms	1096 KB	Output is correct
14	Correct	0 ms	1096 KB	Output is correct
15	Correct	0 ms	1096 KB	Output is correct
16	Correct	0 ms	1096 KB	Output is correct
17	Correct	0 ms	1096 KB	Output is correct
18	Correct	0 ms	1096 KB	Output is correct
19	Correct	0 ms	1096 KB	Output is correct
20	Correct	0 ms	1096 KB	Output is correct
21	Correct	0 ms	1096 KB	Output is correct
22	Correct	0 ms	1096 KB	Output is correct
23	Correct	0 ms	1096 KB	Output is correct
24	Correct	0 ms	1096 KB	Output is correct
25	Correct	0 ms	1096 KB	Output is correct
26	Correct	0 ms	1096 KB	Output is correct