Submission #62277392

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, M;
    cin >> N >> M;
    vector<string> S(N);
    vector<string> T(M);

    for (int i = 0; i < N; i++) {
        cin >> S[i];
    }
    for (int i = 0; i < M; i++) {
        cin >> T[i];
    }

    for (int i = 0; i < N - M + 1; i++) {
        for (int j = 0; j < N - M + 1; j++) {
            bool ok = true;
            for (int k = 0; k < M; k++) {
                for (int l = 0; l < M; l++) {
                    if (S[i + k][j + l] != T[k][l]) ok = false;
                }
            }
            if (ok) {
                cout << i + 1 << " " << j + 1 << endl;
                return 0;
            }
        }
    }
}

Submission Info

Judge Result