Submission #9728

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9728	2014-09-28T08:24:54 Z	dominyellow	Veni, vidi, vici (kriii2_V)	C++	4 / 4	0 ms	1676 KB

V

#include <stdio.h>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <vector>

using namespace std;

int main(void){
	int n;
	scanf("%d", &n);

	char input_str[2000];

	while(scanf("%s", input_str) != -1){
		string full_str = input_str;
		string res_str;

		if(full_str.length()%2 == 1){
			full_str = full_str.substr(0, full_str.length()-1);
		}
		while(!full_str.empty()){
			int first, end;
			first = full_str[0] - 'a';
			end = full_str[1] - 'a';
			full_str = full_str.substr(2);

			int modu = (26+first+end-n)%26;
			printf("%c", 'a'+modu);
		}
		printf(" ");
	}
	printf("\n");
	return 0;
}

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	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

Subtask #2

3.0 / 3.0

#	Verdict	Execution time	Memory	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