题解 | #牛牛的平面向量#
牛牛的平面向量
https://www.nowcoder.com/practice/0e0d472d6a30469ab90d8b0aef7f81fe
#include <stdio.h>
#include<malloc.h>
int main() {
int n;
scanf("%d", &n);
int** arr = malloc(n * sizeof(int) * 2);
for (int i = 0; i < n; i++)arr[i] = malloc(2 * sizeof(int));
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
scanf("%d %d", &arr[i][0], &arr[i][1]);
a += arr[i][0];
b += arr[i][1];
}
printf("%d %d", a, b);
return 0;
}
#C#0基础学C 文章被收录于专栏
0基础学C,从算法开始
查看3道真题和解析