oj.uz

Submission #15067

# Submission time Handle Problem Language Result Execution time Memory
15067 2015-07-11T08:24:44 Z gs14004 뚊 (kriii3_EE) C++14
20 / 20
 0 ms 1084 KB 
#include <cstdio>

int n, m;
char str[30][30];
char str2[30][30];

int main(){
	scanf("%d %d",&n,&m);
	for(int i=0; i<n; i++){
		scanf("%s",str[i]);
	}
	for(int i=0; i<n; i++){
		scanf("%s",str2[i]);
		for(int j=0; j<m; j++){
			if(str2[i][2*j] != str2[i][2*j+1]){
				puts("Not Eyfa");
				return 0;
			}
			if(str2[i][2*j] != str[i][j]){
				puts("Not Eyfa");
				return 0;
			}
		}
	}
	puts("Eyfa");
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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