oj.uz

답안 #9195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
9195 2014-09-28T04:31:37 Z corea Veni, vidi, vici (kriii2_V) C++14
4 / 4
 0 ms 1676 KB 
#include <cstdio>
#include <string>
#include <sstream>
#include <vector>
#include <iostream>

using namespace std;

int n;
vector<string> a;

void go() {
	int P[26][26];
	for(int x = 0; x < 26; ++ x) {
		for(int y = 0; y < 26; ++ y) {
			for(int z = 0; z < 26; ++ z) {
				if(x % 26 == (y + z - n + 26) % 26) {
					P[y][z] = x;
				}
			}
		}
	}
	for(string &s : a) {
		for(int i=0; i+1<(int) s.length(); i += 2) {
			int y = s[i] - 'a';
			int z = s[i+1] - 'a';
			int x = P[y][z];
			printf("%c", x + 'a');
		}
		printf(" ");
	}
}

int main() {
	while(cin >> n) {
		string s;
		while(cin >> s) {
			a.push_back(s);
		}
		go();
	}
	return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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