oj.uz

Submission #15010

# Submission time Handle Problem Language Result Execution time Memory
15010 2015-07-09T21:45:22 Z tncks0121 뚊 (kriii3_EE) C
20 / 20
 0 ms 27060 KB 
int N,M,i,j;char A[5000][0500],B[5000][5000];
main(){scanf("%d%d",&N,&M);
       for( i=0;i<N;i++)scanf("%s",A[i]);
       for( i=0;i<N;i++)scanf("%s",B[i]);
       for( i=0;i<N;i++)for( j=0;j<M+M;j++) if(B[i][j]!=A[i][j/2]) return 0 & puts("Not Eyfa");
         puts("Eyfa");
      }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 27060 KB Output is correct
2 Correct 0 ms 27060 KB Output is correct
3 Correct 0 ms 27060 KB Output is correct
4 Correct 0 ms 27060 KB Output is correct
5 Correct 0 ms 27060 KB Output is correct
6 Correct 0 ms 27060 KB Output is correct
7 Correct 0 ms 27060 KB Output is correct
8 Correct 0 ms 27060 KB Output is correct
9 Correct 0 ms 27060 KB Output is correct
10 Correct 0 ms 27060 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 27060 KB Output is correct
2 Correct 0 ms 27060 KB Output is correct
3 Correct 0 ms 27060 KB Output is correct
4 Correct 0 ms 27060 KB Output is correct
5 Correct 0 ms 27060 KB Output is correct
6 Correct 0 ms 27060 KB Output is correct
7 Correct 0 ms 27060 KB Output is correct
8 Correct 0 ms 27060 KB Output is correct
9 Correct 0 ms 27060 KB Output is correct
10 Correct 0 ms 27060 KB Output is correct