| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 18442 | chan492811 | 뚊 (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 <cstdio>
int n,m;
char arr[30][30],arr2[30][30];
int main(){
int i,j,flag=1;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++) scanf("%s",arr[i]);
for(i=0;i<n;i++) scanf("%s",arr2[i]);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
if(arr[i][j]!=arr2[i][j*2] || arr[i][j]!=arr2[i][j*2+1]) flag=0;
}
}
if(flag) printf("Eyfa");
else printf("Not Eyfa");
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
