oj.uz

Submission #9487

# Submission time Handle Problem Language Result Execution time Memory
9487 2014-09-28T06:47:37 Z effserv Veni, vidi, vici (kriii2_V) C++
0 / 4
 0 ms 1088 KB 
/* 문제


*/


// 2014.

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <string>
#include <map>

using namespace std;

int n;

char str[200];
char ans[200];

int main()
{

	scanf("%d", &n);
	
	while (~scanf("%s", str))
	{
		int len = strlen(str);
		int pos = 0;

		for (int i = 0; i < len/2; i++)
		{
			ans[pos++] = ((str[i * 2 + 0] - 'a' + str[i * 2 + 1] - 'a') - n) % 26 + 'a';
		}
		
		printf("%s ", ans);
	}

	return 0;
}

Subtask #1
0.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Incorrect 0 ms 1088 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -