oj.uz

Submission #9627

# Submission time Handle Problem Language Result Execution time Memory
9627 2014-09-28T07:44:10 Z silas Veni, vidi, vici (kriii2_V) C++
4 / 4
 0 ms 1676 KB 
#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>

using namespace std;

#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
 
using namespace std;
 
 
int main()
{
    char ar[100000];
    int n;
    char a = -1, b = -1, ans;
    scanf("%d\n", &n);
    gets(ar);
    int i = 0;
    while(1){
        b = ar[i++];
        if (b == NULL)
            break;
        else if (b == ' ' || b == '\n'){
            printf(" ");
            a = -1;
        }
        else if (a == EOF)
            a = b;
        else{
			ans = (a - 'a' + b - 'a' - n + 26) % 26 + 'a';
            printf("%c",ans);
            a=-1;
        }  
    }
    printf("\n");
    return 0;
}


/*
int main()
{
    int n;
	string k;
    cin >> n;
    cin >> k;
	
	for(int i = 0; i < k.size() ; i += 2) {
        if (i == k.size() - 1)
            break;
        char ascii = (k[i] - 'a' + k[i + 1] - 'a' - n + 26) % 26 + 'a';
        printf("%c", ascii);
    }
}
int main()
{
    int n;
    cin >> n;
	bool first = true;
    while(getchar() != EOF ) {
        string k;
        cin >> k;
		if (!first) {
			cout << " ";
		}
		first = false;
        for(int i = 0; i < k.size() ; i += 2) {
            if (i == k.size() - 1)
                break;
            char ascii = (k[i] - 'a' + k[i + 1] - 'a' - n + 26) % 26 + 'a';
            printf("%c", ascii);
        }
	}
}
*/

Subtask #1
1.0 / 1.0

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

Subtask #2
3.0 / 3.0

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