oj.uz

Submission #18442

# Submission time Handle Problem Language Result Execution time Memory
18442 2016-02-02T08:38:08 Z chan492811 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1084 KB 
#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;
}

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