题解 | #牛牛的平面向量#

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

typedef struct node {
    int x, y;
} Vector;

Vector AddVector(Vector* arr, int n) {
    Vector ans = {0, 0};
    for (int i = 0; i < n; i++) {
        ans.x += (arr + i) -> x;
        ans.y += (arr + i) -> y;
    }
    return ans;
}

int main() {
    int n;
    scanf("%d", &n);
    Vector* array = (Vector*)malloc(n * sizeof(Vector));
    for (int i = 0; i < n; i++) {
        scanf("%d %d", & (array + i)->x, & (array + i)->y);
    }
    Vector ans = AddVector(array, n);
    printf("%d %d", ans.x, ans.y);
    return 0;
}