Pascal triangle (杨辉三角)制表符
来源:互联网 发布:js字符串除法 编辑:程序博客网 时间:2024/05/09 00:16
Description:
By using two-dimensional array, write C program to display a table that represents a Pascal triangle of any size. In Pascal triangle, the first and the second rows are set to 1. Each element of the triangle (from the third row downward) is the sum of the element directly above it and the element to the left of the element directly above it. See the example Pascal triangle(size=5) below:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
#include<stdio.h>int a[101][101] = {0};// 先初始化数组全为0void printPascalTr(int size) { printf("1\t\n"); // 先打印第一行的1,不然会少一行超惨 a[1][1] = 1; // 初始已知第一行第一列是1 int i, j; // 下面用两个for循环打表,外层控制行,内层控制列 for (i = 2; i <= size; i++) { for (j = 1; j <= i; j++) { a[i][j] = a[i - 1][j] + a[i - 1][j - 1]; // 这个数是它左上方和头顶的和 printf("%d\t", a[i][j]); } printf("\n"); // 注意一行打完之后换行 }}int main() { int size; printf("Enter Pascal triangle size:"); scanf("%d", &size); printPascalTr(size); getchar(); return 0;}
0 0
- Pascal triangle (杨辉三角)制表符
- 杨辉三角(pascal's triangle)
- 【LeetCode】Pascal's Triangle II (杨辉三角)
- LeetCode | Pascal's Triangle(杨辉三角)
- LeetCode OJ 之 Pascal's Triangle(杨辉三角)
- 输出Pascal's Triangle(杨辉三角)
- Leetcode - Array - 118. Pascal's Triangle(杨辉三角)
- 118. Pascal's Triangle (杨辉三角)
- 杨辉三角(Pascal's Triangle)- LeetCode118-119
- leetcode 118. Pascal's Triangle(杨辉三角)
- 【LeetCode】Pascal's Triangle (杨辉三角)
- 【LeetCode】Pascal's Triangle (杨辉三角)
- 杨辉三角生成 Pascal's Triangle
- Pascal's Triangle -- 生成杨辉三角
- (LeetCode)Pascal's Triangle --- 杨辉三角
- Leetcode118. Pascal's Triangle (杨辉三角)
- 118. Pascal's Triangle 杨辉三角
- Pascal's Triangle:杨辉三角
- Android图文详解属性动画
- HDU 3926 Hand in Hand(判断同构)
- Android启动出现白屏的解决办法(theme)
- bcache配置方法 - Linux内核之bcache 1.1
- Java @SuppressWarnings
- Pascal triangle (杨辉三角)制表符
- Java回炉之IO流(二)使用规律
- 用IDEA打成可执行jar包时遇到的问题
- hdu1203 I NEED A OFFER!
- 排序算法
- java RMI 注册服务
- hdu 1874 畅通工程续(最短路)
- 斯普瑞斯奥特莱斯斯普瑞斯奥特莱斯董事长栾少梅欠债不还
- 根activity的启动过程--控制转移