oj.uz

Submission #9316

# Submission time Handle Problem Language Result Execution time Memory
9316 2014-09-28T05:33:22 Z kkjjkk Veni, vidi, vici (kriii2_V) C++
4 / 4
 0 ms 1576 KB 
#include <cstdio>
#include <cstring>
char h[100005], h3[100];
int h2[100005];
int main()
{
    for(int i = 0; i < 26; i++) { h3[i] = 'a' + i; }//printf("%c\n", h3[i]); }
    int n, m, t = 0;
    scanf("%d", &n);
    while(1) {
         if(-1 == scanf("%s", h)) break;
         m = strlen(h); //printf("%s\n", h);
         for(int i = 0; i < m; i++) {
              if(i == m - 1) break;
              //else if(h[i] == ' ') { h2[t] = 0; t++; }
              //else if(h[i + 1] == ' ') continue;
              else {
                    //h2[t] = (h[i] + h[i + 1] - 'a' - 'a' - n + 26) % 26;
                    h2[t] = (h[i] + h[i + 1] - 'a' - 'a' - n + 78) % 26;
                    //printf("%d\n", h2[t]);
                    t++; i++;
              }
         }
         h2[t] = -1; t++;
         //for(int i = 0; i < t; i++) printf("(%d)", h2[i]);
    }
    for(int i = 0; i < t - 1; i++) {
         if(h2[i] == -1) printf(" ");
         else printf("%c", h3[h2[i]]);
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
3.0 / 3.0

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