题解 | #杨辉三角#
杨辉三角
https://www.nowcoder.com/practice/e671c6a913d448318a49be87850adbcc
#include <stdio.h>
int com(int n, int k)
{
if (k == 0 || k == n)
return 1;
else
return com(n - 1, k - 1) + com(n - 1, k);
}
void trg(int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= i; j++)
{
printf("%5d", com(i, j));
}
printf("\n");
}
}
int main()
{
int n = 0;
scanf("%d", &n);
trg(n);
return 0;
}
学而思开奖45人在聊
