# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
15029 | | sujin | 뚊 (kriii3_EE) | C++98 | | 0 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int main(){
int N, M;
while(~scanf("%d %d", &N, &M)){
char I1[10][10];
char I2[10][20];
for(int i = 0; i < N; i++)
for(int j = 0; j < M; j++)
scanf(" %c", &I1[i][j]);
for(int i = 0; i < N; i++)
for(int j = 0; j < 2 * M; j++)
scanf(" %c", &I2[i][j]);
for(int i = 0; i < N; i++){
for(int j = 0; j < M; j++){
if(I1[i][j] != I2[i][j * 2] || I1[i][j] != I2[i][j * 2 + 1]){
printf("Not ");
goto end;
}
}
}
end:
printf("Eyfa\n");
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |