题解 | 杨辉三角

#include <stdio.h>

int main() {
	int n = 0;
	int arr1[34] = { 1 };
	int arr2[34] = { 1 };
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		if (i % 2) {
			for (int j = 0; j < i; j++) {
				printf("%d ", arr1[j]);
				arr2[j + 1] = arr1[j] + arr1[j + 1];

			}
		}
		else {
			for (int j = 0; j < i; j++) {
				arr1[j + 1] = arr2[j] + arr2[j + 1];
				printf("%d ", arr2[j]);
			}
		}
		printf("\n");
	}
	return 0;
}