Submission #13559

#	Time	Username	Problem	Language	Result	Execution time	Memory
13559		baneling100	Veni, vidi, vici (kriii2_V)	C++98	4 / 4	0 ms	1084 KiB

V

#include <stdio.h>
#include <string.h>
#define L_MAX 101
#define MOD 26

int N, L;
char S[L_MAX+1];

int mod(int num) {

    while(num<0) num+=MOD;
    while(num>=MOD) num-=MOD;
    return num;
}

int main(void) {

    int i;

    scanf("%d",&N);
    while(scanf("%s",S)==1) {
        L=strlen(S);
        for(i=0 ; i<L ; i++) S[i]-='a';
        if(L%2) L--;
        for(i=0 ; i<L ; i+=2) printf("%c",mod(S[i]+S[i+1]-N)+'a');
        printf(" ");
    }
    return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3