oj.uz

답안 #18584

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18584 2016-02-09T15:29:36 Z jjhstop 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1084 KB 
#include<stdio.h>

char src[10][10];
char tgt[10][20];

int main()
{
	int N, M;
	//freopen("input.txt", "r", stdin);
	scanf("%d %d ", &N, &M);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			scanf("%c ", &src[i][j]);
		}
	}

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 2*M; j++) {
			scanf("%c ", &tgt[i][j]);
			if (src[i][j / 2] != tgt[i][j]) {
				printf("Not Eyfa");
				return 0;
			}
		}
	}
	printf("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