# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
19071 |
2016-02-18T02:39:46 Z |
Namnamseo |
뚊 (kriii3_EE) |
C++14 |
|
0 ms |
1084 KB |
#include <cstdio>
char data[11][22];
char buf[22];
int main()
{
int n,m;
int i,j;
scanf("%d%d",&n,&m);
for(i=0;i<n;++i) scanf("%s",data+i);
bool nodab = false;
for(i=0;i<n;++i){
scanf("%s",buf);
for(j=0;j<2*m;++j){
if(data[i][j/2]!=buf[j]) nodab=true;
}
}
if(nodab) printf("Not "); puts("Eyfa");
return 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 |
# |
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 |