oj.uz

Submission #16611

# Submission time Handle Problem Language Result Execution time Memory
16611 2015-08-29T14:11:44 Z eaststar 뚊 (kriii3_EE) C++14
20 / 20
 0 ms 1084 KB 
#include <stdio.h>
char a[11][11],b[11][21];
int main(){
    int i,j,n,m;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)scanf("%s",a+i);
    for(i=1;i<=n;++i)scanf("%s",b+i);
    for(i=1;i<=n;++i){
        for(j=0;j<m&&a[i][j]==b[i][j*2]&&a[i][j]==b[i][j*2+1];++j);
        if(j<m){
            printf("Not ");
            break;
        }
    }
    puts("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