oj.uz

답안 #15110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15110 2015-07-11T10:31:42 Z cki86201 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1084 KB 
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
char p[12][12], q[12][24];
bool F;
int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++)scanf("%s", p[i]);
	for (int i = 0; i < n; i++)scanf("%s", q[i]);
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m + m; j++){
			if (q[i][j] != p[i][j / 2])F = 1;
		}
	}
	printf("%s", F ? "Not Eyfa" : "Eyfa");
	return 0;
}

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