# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
15134 |
2015-07-11T13:41:47 Z |
skeksk91 |
뚊 (kriii3_EE) |
C++ |
|
0 ms |
1084 KB |
#include <stdio.h>
#include <string.h>
int main() {
int n, m, f;
char arr[12][12], arr2[30][30];
scanf("%d%d", &n, &m);
getchar();
for (int i = 0; i < n; i++) {
scanf("%s", arr[i]);
getchar();
}
for (int i = 0; i < n; i++) {
scanf("%s", arr2[i]);
getchar();
}
f = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (arr[i][j] != arr2[i][2 * j] || arr[i][j] != arr2[i][2 * j + 1]) {
printf("Not Eyfa\n"); f = 0;
break;
}
}
if (f == 0) break;
}
if (f == 1) {
printf("Eyfa");
}
}
# |
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 |
# |
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 |