oj.uz

답안 #15041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15041 2015-07-11T06:26:25 Z hongjun7 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1084 KB 
#include <cstdio>
int n, m;
char A[11][22], B[11][22];
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%s", A[i] + 1);
	for (int i = 1; i <= n; i++) scanf("%s", B[i] + 1);
	int res = 1;
	for (int i = 1; i <= n; i++) {
		int k = 1;
		for (int j = 1; j <= m; j++) {
			if (A[i][j] == B[i][k] && A[i][j] == B[i][k + 1])
				k += 2;
			else
				res = 0;
		}
	}
	puts(res ? "Eyfa" : "Not Eyfa");
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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