#include <stdio.h>
#include<stdlib.h>
int main() {
int m, n;
scanf("%d %d", &m, &n);
int **a, **b, **c;
a=(int **)malloc(sizeof(int*)*m);
for (int k = 0; k < m; k++)
a[k] = (int*)malloc(sizeof(int)*n);
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
scanf("%d", &a[i][j]);
}
printf("\n");
b = (int **)malloc(sizeof(int*)*m);
for (int k = 0; k < m; k++)
b[k] = (int*)malloc(sizeof(int)*n);
for (int i = 0; i<m; i++)
{
for (int j = 0; j<n; j++)
scanf("%d", &b[i][j]);
}
printf("\n");
for (int i = 0; i<m; i++)
{
for (int j = 0; j<n; j++)
{
a[i][j] = a[i][j] - b[i][j];
printf("%d ", a[i][j]);
}
printf("\n");
}
for (int i = 0; i < m; i++)
{
free(a[i]);
free(b[i]);
}
free(a);
free(b);
system("pause");
return 0;
}
#include<stdio.h>
int main()
{
int a[200][200],b[200][200];
int m, n;
scanf_s("%d%d", &m, &n);
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)scanf_s("%d", &a[i][j]);
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)scanf_s("%d", &b[i][j]);
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)printf_s("%d ", a[i][j]-b[i][j]);
printf_s("\n");
}
return 0;
}
题目解法很简单,金额有点高,是不是哪里有问题
#include<stdio.h>
int main()
{
int a[100][100],b[100][100];
int m, n;
scanf("%d%d", &m, &n);
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)
scanf("%d", &a[i][j]);
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)
scanf("%d", &b[i][j]);
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)
printf("%d ", a[i][j]-b[i][j]);
printf("\n");
}
}