题解 | #牛牛的新数组求和#

#include <stdio.h>
#include<malloc.h>

int cal(int* arr, int n) {
    int sum = 0;
    int i;
    for (i = 0; i < n; i++) {
        sum += arr[i];
    }
    return sum;
}


int main() {
    int n, i;
    scanf("%d", &n);
    int* arr = (int*)malloc(n * sizeof(int));
    for (i = 0; i < n; i++)
        scanf("%d", &arr[i]);
    printf("%d", cal(arr, n));
}