Submission #9201

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9201	2014-09-28T04:36:32 Z	myungwoo	Veni, vidi, vici (kriii2_V)	C++	4 / 4	0 ms	1196 KB

V

#include<stdio.h>

char str[111111];
int n;

int main(){
	int i;
	scanf("%d\n", &n);
	gets(str);
	for(i=0;; i+=2){
		if(str[i] == 0 || str[i+1] == 0)break;
		if(str[i] == ' '){
			printf(" ");
			i--;
		}
		else if(str[i+1] == ' ')printf(" ");
		else printf("%c", (str[i]+str[i+1]-2*'a'-n+26)%26 + 'a');
	}
	return 0;
}

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1196 KB	Output is correct
2	Correct	0 ms	1196 KB	Output is correct
3	Correct	0 ms	1196 KB	Output is correct
4	Correct	0 ms	1196 KB	Output is correct
5	Correct	0 ms	1196 KB	Output is correct
6	Correct	0 ms	1196 KB	Output is correct
7	Correct	0 ms	1196 KB	Output is correct
8	Correct	0 ms	1196 KB	Output is correct
9	Correct	0 ms	1196 KB	Output is correct
10	Correct	0 ms	1196 KB	Output is correct
11	Correct	0 ms	1196 KB	Output is correct
12	Correct	0 ms	1196 KB	Output is correct
13	Correct	0 ms	1196 KB	Output is correct
14	Correct	0 ms	1196 KB	Output is correct
15	Correct	0 ms	1196 KB	Output is correct
16	Correct	0 ms	1196 KB	Output is correct
17	Correct	0 ms	1196 KB	Output is correct
18	Correct	0 ms	1196 KB	Output is correct
19	Correct	0 ms	1196 KB	Output is correct
20	Correct	0 ms	1196 KB	Output is correct
21	Correct	0 ms	1196 KB	Output is correct
22	Correct	0 ms	1196 KB	Output is correct
23	Correct	0 ms	1196 KB	Output is correct
24	Correct	0 ms	1196 KB	Output is correct
25	Correct	0 ms	1196 KB	Output is correct
26	Correct	0 ms	1196 KB	Output is correct

Subtask #2

3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1196 KB	Output is correct
2	Correct	0 ms	1196 KB	Output is correct
3	Correct	0 ms	1196 KB	Output is correct
4	Correct	0 ms	1196 KB	Output is correct
5	Correct	0 ms	1196 KB	Output is correct
6	Correct	0 ms	1196 KB	Output is correct
7	Correct	0 ms	1196 KB	Output is correct
8	Correct	0 ms	1196 KB	Output is correct
9	Correct	0 ms	1196 KB	Output is correct
10	Correct	0 ms	1196 KB	Output is correct
11	Correct	0 ms	1196 KB	Output is correct
12	Correct	0 ms	1196 KB	Output is correct
13	Correct	0 ms	1196 KB	Output is correct
14	Correct	0 ms	1196 KB	Output is correct
15	Correct	0 ms	1196 KB	Output is correct
16	Correct	0 ms	1196 KB	Output is correct
17	Correct	0 ms	1196 KB	Output is correct
18	Correct	0 ms	1196 KB	Output is correct
19	Correct	0 ms	1196 KB	Output is correct
20	Correct	0 ms	1196 KB	Output is correct
21	Correct	0 ms	1196 KB	Output is correct
22	Correct	0 ms	1196 KB	Output is correct
23	Correct	0 ms	1196 KB	Output is correct
24	Correct	0 ms	1196 KB	Output is correct
25	Correct	0 ms	1196 KB	Output is correct
26	Correct	0 ms	1196 KB	Output is correct