| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 15029 |
2015-07-11T03:08:29 Z |
sujin |
뚊 (kriii3_EE) |
C++ |
|
0 ms |
1084 KB |
#include <stdio.h>
int main(){
int N, M;
while(~scanf("%d %d", &N, &M)){
char I1[10][10];
char I2[10][20];
for(int i = 0; i < N; i++)
for(int j = 0; j < M; j++)
scanf(" %c", &I1[i][j]);
for(int i = 0; i < N; i++)
for(int j = 0; j < 2 * M; j++)
scanf(" %c", &I2[i][j]);
for(int i = 0; i < N; i++){
for(int j = 0; j < M; j++){
if(I1[i][j] != I2[i][j * 2] || I1[i][j] != I2[i][j * 2 + 1]){
printf("Not ");
goto end;
}
}
}
end:
printf("Eyfa\n");
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
| # |
결과 |
실행 시간 |
메모리 |
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 |
