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<stdio.h>
int n;
char dat[200];
int main() {
	scanf("%d", &n);
	while(scanf(" %s", dat) != EOF) {
		for (int i=0; dat[i]; i+=2) {
			if (dat[i+1] == 0) break;
			putchar((dat[i]-'a'+dat[i+1]-'a'+26-n)%26+'a');
		}
		putchar(' ');
	}
	putchar('\n');
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |