# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9180 | hodduc | Veni, vidi, vici (kriii2_V) | C++98 | 0 ms | 1088 KiB |
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>
#include<string.h>
int N;
char buf[105];
char newbuf[105];
int main()
{
scanf("%d",&N);
while(scanf("%s", buf) == 1){
int k = 0, x;
int len = strlen(buf);
for(int i = 1; i < len; i+=2){
x = (int(buf[i]) + buf[i-1] - N -'a' - 'a') % 26;
newbuf[k] = x + 'a';
k++;
newbuf[k] = 0;
}
printf("%s ",newbuf);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |