| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 15058 |
2015-07-11T07:51:48 Z |
xhae |
뚊 (kriii3_EE) |
C++14 |
|
0 ms |
1720 KB |
#include <iostream>
#include <string>
using namespace std;
string orig[10], db[10];
int n, m;
int main(void) {
cin >> n >> m;
for(int i = 0; i < n; i++) cin >> orig[i];
for(int i = 0; i < n; i++) cin >> db[i];
bool isAns = true;
for(int i = 0; i < n; i++)
for(int j = 0; j < m * 2; j++)
if(orig[i][j / 2] != db[i][j])
isAns = false;
if(isAns) cout << "Eyfa\n";
else cout << "Not Eyfa\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1720 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1720 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1720 KB |
Output is correct |
