| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 17505 | kdh9949 | 뚊 (kriii3_EE) | C++98 | 0 ms | 1148 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>
char a[11][2010], b[11][4010];
int n, m;
int main(){
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++){
scanf("%s", a[i]);
}
for(int i = 0; i < n; i++){
scanf("%s", b[i]);
}
bool flag = false;
for(int i = 0; i < n; i++){
for(int j = 0; j < 2 * m; j++){
if(b[i][j] != a[i][j / 2]){
flag = true;
printf("Not ");
break;
}
}
if(flag) break;
}
puts("Eyfa");
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
