题解 | 单组_二维数组

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n,m;
    scanf("%d %d\n",&n,&m);
    int **a = (int **)malloc(n * sizeof(int *));
    if(a == NULL){
        printf("Failed malloc!");
        return -1;
    }
    for(int i = 0; i < n; i ++){
        a[i] = (int *)malloc(m * sizeof(int));
        if(a[i] == NULL){
            printf("Failed malloc!");
            return -1;
        }
    }
    long long sum = 0;
    for(int i = 0; i < n; i ++){
        for(int j = 0; j < m; j ++){
            scanf("%d ",a[i] + j);
            sum += a[i][j];
        }
    }
    printf("%lld",sum);
    return 0;
}