编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
---|---|---|---|---|---|---|---|---|
#21725 | #1010. J. 团队配置,新奇的面试题 | Compile Error | 0 | 0 ms | 0 K | C++ / 904 B | 电类904-穆琳杰 | 2020-02-09 23:01:52 |
#include <iostream>
#include <cstring>
using namespace std;
char a[50][50], b[50][50];
bool flag;
int sum = 0;
int main() {
int T;
cin >> T;
for (int i = 1; i <= T; i++) {
sum = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int M, N;
scanf("%d%d", &N, &M);
for (int i = 0; i < N; i++) cin >> a[i];
int m, n, mm, nn;
scanf("%d%d", &n, &m);
mm = (m - 1) / 2;
nn = (n - 1) / 2; //计算员工地图的中点坐标
for (int i = 0; i < n; i++) cin >> b[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++) //依次中心坐标在原地图的各个点;
{
flag = 1; //归1
for (int s = -nn; s <= nn; s++)
for (int k = -mm; k <= mm; k++) //把员工地图的各个点同原图比较
if ((i + s) >= 0 && (i + s) < N && (j + k) >= 0 && (j + k) < M)
if (b[nn + s][mm + k] == '#' && a[i + s][j + k] == '#') //只考虑落在原地图上的点
flag = 0;
if (flag)
sum++;
}
printf("%d\n", sum);
}
return 0;
}
编译信息
/sandbox/1/a.cpp: In function 'int main()':
/sandbox/1/a.cpp:15:2: error: 'scanf' was not declared in this scope
scanf("%d%d",&N,&M);
^~~~~
/sandbox/1/a.cpp:15:2: note: suggested alternative: 'wscanf'
scanf("%d%d",&N,&M);
^~~~~
wscanf
/sandbox/1/a.cpp:34:2: error: 'printf' was not declared in this scope
printf("%d\n",sum);
^~~~~~
/sandbox/1/a.cpp:34:2: note: 'printf' is defined in header '<cstdio>'; did you forget to '#include <cstdio>'?
/sandbox/1/a.cpp:3:1:
+#include <cstdio>
using namespace std;
/sandbox/1/a.cpp:34:2:
printf("%d\n",sum);
^~~~~~