# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
15080 |
2015-07-11T09:15:41 Z |
ztehgns |
뚊 (kriii3_EE) |
C++ |
|
0 ms |
1724 KB |
#include <stdio.h>
#include <vector>
#include <iostream>
using namespace std;
int main(){
int n, m;
scanf("%d%d",&n, &m);
char tmp = 10;
bool chk = true;
vector<vector<char> > str, str2;
str.resize(n);
for(int i=0;i<n;i++){
str[i].resize(m);
for(int j=0;j<m;j++){
while((tmp = getchar()) < 35);
str[i][j] = tmp;
}
}
tmp = 10;
str2.resize(n);
for(int i=0;i<n;i++){
str2[i].resize(2*m);
for(int j=0;j<2*m;j++){
while((tmp = getchar()) < 35);
str2[i][j] = tmp;
if(str2[i][j] != str[i][j/2])
chk = false;
}
}
if(chk)
printf("Eyfa\n");
else
printf("Not Eyfa\n");
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1724 KB |
Output is correct |
2 |
Correct |
0 ms |
1724 KB |
Output is correct |
3 |
Correct |
0 ms |
1724 KB |
Output is correct |
4 |
Correct |
0 ms |
1724 KB |
Output is correct |
5 |
Correct |
0 ms |
1724 KB |
Output is correct |
6 |
Correct |
0 ms |
1724 KB |
Output is correct |
7 |
Correct |
0 ms |
1724 KB |
Output is correct |
8 |
Correct |
0 ms |
1724 KB |
Output is correct |
9 |
Correct |
0 ms |
1724 KB |
Output is correct |
10 |
Correct |
0 ms |
1724 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1724 KB |
Output is correct |
2 |
Correct |
0 ms |
1724 KB |
Output is correct |
3 |
Correct |
0 ms |
1724 KB |
Output is correct |
4 |
Correct |
0 ms |
1724 KB |
Output is correct |
5 |
Correct |
0 ms |
1724 KB |
Output is correct |
6 |
Correct |
0 ms |
1724 KB |
Output is correct |
7 |
Correct |
0 ms |
1724 KB |
Output is correct |
8 |
Correct |
0 ms |
1724 KB |
Output is correct |
9 |
Correct |
0 ms |
1724 KB |
Output is correct |
10 |
Correct |
0 ms |
1724 KB |
Output is correct |