oj.uz

Submission #15050

# Submission time Handle Problem Language Result Execution time Memory
15050 2015-07-11T07:30:02 Z myungwoo 뚊 (kriii3_EE) C++14
20 / 20
 0 ms 1740 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long lld;

int N, M;
char A[99][99], B[99][99];

int main()
{
	scanf("%d%d", &N, &M);
	for (int i=1;i<=N;i++) scanf("%s", A[i]);
	for (int i=1;i<=N;i++) scanf("%s", B[i]);
	for (int i=1;i<=N;i++){
		for (int j=0;j<M+M;j++) if (B[i][j] != A[i][j/2]){
			puts("Not Eyfa");
			return 0;
		}
	}
	puts("Eyfa");
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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