oj.uz

답안 #17505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17505 2015-12-22T06:06:14 Z kdh9949 뚊 (kriii3_EE) C++
20 / 20
 0 ms 1148 KB 
#include <cstdio>

char a[11][2010], b[11][4010];
int n, m;

int main(){
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; i++){
        scanf("%s", a[i]);
    }
    for(int i = 0; i < n; i++){
        scanf("%s", b[i]);
    }
    bool flag = false;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 2 * m; j++){
            if(b[i][j] != a[i][j / 2]){
                flag = true;
                printf("Not ");
                break;
            }
        }
        if(flag) break;
    }
    puts("Eyfa");
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1148 KB Output is correct
2 Correct 0 ms 1148 KB Output is correct
3 Correct 0 ms 1148 KB Output is correct
4 Correct 0 ms 1148 KB Output is correct
5 Correct 0 ms 1148 KB Output is correct
6 Correct 0 ms 1148 KB Output is correct
7 Correct 0 ms 1148 KB Output is correct
8 Correct 0 ms 1148 KB Output is correct
9 Correct 0 ms 1148 KB Output is correct
10 Correct 0 ms 1148 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1148 KB Output is correct
2 Correct 0 ms 1148 KB Output is correct
3 Correct 0 ms 1148 KB Output is correct
4 Correct 0 ms 1148 KB Output is correct
5 Correct 0 ms 1148 KB Output is correct
6 Correct 0 ms 1148 KB Output is correct
7 Correct 0 ms 1148 KB Output is correct
8 Correct 0 ms 1148 KB Output is correct
9 Correct 0 ms 1148 KB Output is correct
10 Correct 0 ms 1148 KB Output is correct