oj.uz

Submission #9232

# Submission time Handle Problem Language Result Execution time Memory
9232 2014-09-28T04:55:44 Z moonrabbit2 Veni, vidi, vici (kriii2_V) C++
4 / 4
 0 ms 1096 KB 
#include <cstdio>
#include <cstring>
char s[10005];
int n,len;
int f(int y,int z)
{
    for(int x=0;x<26;x++){
        if((y+z-n-x)%26==0)return x;
    }
    return 0;
}
bool checkblank(int x)
{
    for(int i=x+1;i<len;i++){
        if(s[i]==' ')
            return true;
    }
    return false;
}
int main()
{
    scanf("%d\n",&n);
    gets(s);
    len=strlen(s);
    int i;
    for(i=0;i<len;i+=2){
        if(s[i+1]==' '){
            printf(" ");
            continue;
        }
        int a=s[i]-'a',b=s[i+1]-'a';
        printf("%c",f(a,b)+'a');
        if(s[i+2]==' '){
            printf(" ");
            i+=1;
        }
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct
11 Correct 0 ms 1096 KB Output is correct
12 Correct 0 ms 1096 KB Output is correct
13 Correct 0 ms 1096 KB Output is correct
14 Correct 0 ms 1096 KB Output is correct
15 Correct 0 ms 1096 KB Output is correct
16 Correct 0 ms 1096 KB Output is correct
17 Correct 0 ms 1096 KB Output is correct
18 Correct 0 ms 1096 KB Output is correct
19 Correct 0 ms 1096 KB Output is correct
20 Correct 0 ms 1096 KB Output is correct
21 Correct 0 ms 1096 KB Output is correct
22 Correct 0 ms 1096 KB Output is correct
23 Correct 0 ms 1096 KB Output is correct
24 Correct 0 ms 1096 KB Output is correct
25 Correct 0 ms 1096 KB Output is correct
26 Correct 0 ms 1096 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1096 KB Output is correct
2 Correct 0 ms 1096 KB Output is correct
3 Correct 0 ms 1096 KB Output is correct
4 Correct 0 ms 1096 KB Output is correct
5 Correct 0 ms 1096 KB Output is correct
6 Correct 0 ms 1096 KB Output is correct
7 Correct 0 ms 1096 KB Output is correct
8 Correct 0 ms 1096 KB Output is correct
9 Correct 0 ms 1096 KB Output is correct
10 Correct 0 ms 1096 KB Output is correct
11 Correct 0 ms 1096 KB Output is correct
12 Correct 0 ms 1096 KB Output is correct
13 Correct 0 ms 1096 KB Output is correct
14 Correct 0 ms 1096 KB Output is correct
15 Correct 0 ms 1096 KB Output is correct
16 Correct 0 ms 1096 KB Output is correct
17 Correct 0 ms 1096 KB Output is correct
18 Correct 0 ms 1096 KB Output is correct
19 Correct 0 ms 1096 KB Output is correct
20 Correct 0 ms 1096 KB Output is correct
21 Correct 0 ms 1096 KB Output is correct
22 Correct 0 ms 1096 KB Output is correct
23 Correct 0 ms 1096 KB Output is correct
24 Correct 0 ms 1096 KB Output is correct
25 Correct 0 ms 1096 KB Output is correct
26 Correct 0 ms 1096 KB Output is correct