This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <iostream>
#include <fstream>
#include <deque>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
#include <queue>
#include <string>
using namespace std;
#define in cin
#define out cout
#define PII pair<int, int>
#define x first
#define y second
#define pi 3.14159265358979323846
#define REP(i, v) for(int i=0; i<v; i++)
#define REPEQ(i, s, e) for(int i=s; i<=e; i++)
#define REPRV(i, s, e) for(int i=s; i>=e; i--)
#define all(v) v.begin(), v.end()
#define long long int int64
#define BIG(a, b) ( (a>b?a:b) )
int main()
{
//freopen("in.txt", "r+", stdin);
ios::sync_with_stdio(false);
int n; in >> n;
char al[] = "abcdefghijklmnopqrstuvwxyz";
string str;
while( in >> str )
{
int len = str.size();
REP(i, len/2)
{
char a = str[i*2];
char b = str[i*2+1];
//out << ( ((a - 'a') + (b - 'a')) - n) + 26 % 26 << endl;
out << al[(( ((a - 'a') + (b - 'a')) - n) + 26) % 26];
} out << " ";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |