杨辉三角
2014-03-26 19:23
274 查看
输入n,打印n行的杨辉三角。
比如:
输入:5
输出:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
#include <stdio.h>
int main(int argc,
const char * argv[])
{
int a[10][10] = {0};
int n,i,j;
printf("输入要打印的行数:\n");
scanf("%d",&n);
for (i = 0; i < n; i++) {
for (j = 0; j <= i; j++) {
if ( i == j || j == 0) {
a[i][j] = 1;
printf("%d ",a[i][j]);
}else{
a[i][j] = a[i-1][j-1] + a[i-1][j];
printf("%d ",a[i][j]);
}
}
printf("\n");
}
printf("Hello, World!\n");
return 0;
}
比如:
输入:5
输出:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
#include <stdio.h>
int main(int argc,
const char * argv[])
{
int a[10][10] = {0};
int n,i,j;
printf("输入要打印的行数:\n");
scanf("%d",&n);
for (i = 0; i < n; i++) {
for (j = 0; j <= i; j++) {
if ( i == j || j == 0) {
a[i][j] = 1;
printf("%d ",a[i][j]);
}else{
a[i][j] = a[i-1][j-1] + a[i-1][j];
printf("%d ",a[i][j]);
}
}
printf("\n");
}
printf("Hello, World!\n");
return 0;
}