oj.uz

답안 #9500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
9500 2014-09-28T06:52:22 Z effserv Veni, vidi, vici (kriii2_V) C++
1 / 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];
bool tmp = false;

int main()
{

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

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

	return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 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 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct
21 Correct 0 ms 1088 KB Output is correct
22 Correct 0 ms 1088 KB Output is correct
23 Correct 0 ms 1088 KB Output is correct
24 Correct 0 ms 1088 KB Output is correct
25 Correct 0 ms 1088 KB Output is correct
26 Correct 0 ms 1088 KB Output is correct

Subtask #2
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1088 KB Output isn't correct
2 Halted 0 ms 0 KB -