显示原始代码
#include <stdio.h>
int main() {
int N, M, n, m, i, count, j, k, l, o, poi;
int pd;
scanf("%d", &count);
for (i = 0; i < count; i++) {
poi = 0;
scanf("%d %d", &N, &M);
char mot[N][M];
for (j = 0; j < N; j++) {
scanf("%s", &mot[j]);
}
scanf("%d %d", &n, &m);
char flo[n][m];
for (j = 0; j < n; j++) {
scanf("%s", &flo[j]);
}
for (j = 0; j < N; j++) {
for (k = 0; k < M; k++) {
pd = 1;
for (l = 0; l < n; l++) {
for (o = 0; o < m; o++) {
if (flo[l][o] == '#' && mot[j - (n - 1) / 2 + l][k - (m - 1) / 2 + o] == '#') {
pd = 0;
break;
}
}
if (pd == 0) {
break;
}
}
if (pd == 1) {
poi++;
}
}
}
printf("%d\n", poi);
}
return 114514;
}