Submission #9601

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9601	2014-09-28T07:34:18 Z	sior	Veni, vidi, vici (kriii2_V)	C++	4 / 4	0 ms	1676 KB

V

#include <iostream>
#include <stdio.h>
#include <string>
#include <stdlib.h>
#include <string.h>

using namespace std;

int main()
{
	int n;
	
	char buf[100 * 101 + 1];

	scanf("%d ", &n);
	gets(buf);

	int len = strlen(buf);
	
	char first;
	char second;	
	bool isFirst = true;
	string str_ret;
	int count = 0;

	for (int i = 0; i < len; i++)
	{
		count++;
	
		if (buf[i] == ' ')
		{
			str_ret += " ";
			count = 0;
			isFirst = true;
			continue;
		}
		
		if (isFirst == true)
		{
			first = buf[i] - 'a';
			isFirst = false;
		}
		else
		{
			second = buf[i] - 'a';
			isFirst = true;
		}

		if (count % 2 == 0)
			str_ret += (char)((first + second - n + 26) % 26) + 'a';


	}

	cout << str_ret << endl;
}

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