oj.uz

Submission #15127

# Submission time Handle Problem Language Result Execution time Memory
15127 2015-07-11T12:35:45 Z progressive 뚊 (kriii3_EE) C++14
20 / 20
 0 ms 1088 KB 
#include<cstdio>
char js[50][50];
char mag[50][50];
int main()
{
	int N,M;
	scanf("%d%d",&N,&M);
	for(int i=0;i<N;i++) scanf("%s",js[i]);
	for(int i=0;i<N;i++) scanf("%s",mag[i]);
	for(int i=0;i<N;i++)
		for(int j=0;j<2*M;j++)
		{
			if(mag[i][j]!=js[i][j/2])
			{
				puts("Not Eyfa");
				return 0;
			}
		}
	puts("Eyfa");
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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