oj.uz

Submission #9405

# Submission time Handle Problem Language Result Execution time Memory
9405 2014-09-28T06:10:46 Z shashack Veni, vidi, vici (kriii2_V) C++14
4 / 4
 0 ms 1676 KB 
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <sstream>
#include <cstdlib>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <functional>
#include <bitset>
#include <limits.h>

using namespace std;

#define MP make_pair
#define REP(v, repeat) for(int v=0; v<(repeat); ++v)
#define REPD(v, repeat) for(int v=(repeat)-1; v>=0; --v)
#define FOR(v, pos, end) for(int v=(pos); v<=(end); ++v)
#define FORD(v, pos, end) for(int v=(pos); v>=(end); --v)
#define ROUNDING(x, dig) (floor((x) * pow(10, dig) + 0.11f) / pow(10, dig))

typedef pair<int, int> PI;
typedef vector <bool> VB;
typedef vector <int> VI;
typedef vector <VI> VVI;
typedef vector <vector <PI>> ADJ;
typedef vector <string> VS;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
#ifdef _CONSOLE
	freopen("input.txt", "r", stdin);
#endif

	string input;
	int n; scanf("%d", &n);

	while (!(cin>>input).eof())
	{
		int len = input.size() - 1;

		for (int i = 0; i < len; i += 2)
		{
			int a = input[i] - 'a';
			int b = input[i + 1] - 'a';
			int c = (a + b + 26 - n) % 26;
			printf("%c", c + 'a');
		}
		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