oj.uz

Submission #15035

# Submission time Handle Problem Language Result Execution time Memory
15035 2015-07-11T06:01:20 Z kipa00 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1084 KB 
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

char a[10][11], b[10][21];

int main() {
	int N, M, i, j;
	scanf("%d%d", &N, &M);
	for (i=0; i<N; ++i) {
		scanf("%s", a[i]);
	}
	for (i=0; i<N; ++i) {
		scanf("%s", b[i]);
	}
	for (i=0; i<N; ++i) {
		for (j=0; j<2 * M; ++j) {
			if (a[i][j / 2] != b[i][j]) {
				printf("Not Eyfa\n");
				return 0;
			}
		}
	}
	puts("Eyfa");
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct