用递归算法实现杨辉三角

#include <stdio.h> int find(int line,int n); int main(void) { int i,j,temp,n; printf("How many line:"); scanf("%d",&n); for (i=1; i<=n; i++){ for (j=0; j<n-i; j++)

>>阅读原文<<