abc391_b求条
  • 板块灌水区
  • 楼主AIregister
  • 当前回复1
  • 已保存回复1
  • 发布时间2025/2/1 20:40
  • 上次更新2025/2/1 20:43:39
查看原帖
abc391_b求条
947200
AIregister楼主2025/2/1 20:40
#include <bits/stdc++.h>
using namespace std;
char a[1001][1001];
char b[1001][1001];
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> b[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			bool flag = 1;
			for (int k = 1; k <= n; k++) {
				for (int l = 1; k <= n; l++) {
					if (flag == 0) {
						break;
					}
					if (a[i + k - 1][j + l - 1] != b[k][l]) {
						flag = 0;
						break;
					}
				}
			}
			if(flag==1){
				cout << i << " " << j;
				return 0;
			}
		}
	}
	return 0;
}
2025/2/1 20:40
加载中...