杨辉三角
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52666 Accepted Submission(s): 21922
Problem Description
还记得中学时候学过的杨辉三角吗?具体的定义这里不再描述,你可以参考以下的图形:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
Input
输入数据包含多个测试实例,每个测试实例的输入只包含一个正整数n(1<=n<=30),表示将要输出的杨辉三角的层数。
Output
对应于每一个输入,请输出相应层数的杨辉三角,每一层的整数之间用一个空格隔开,每一个杨辉三角后面加一个空行。
Sample Input
2 3
Sample Output
1 1 1 1 1 1 1 2 1
Author
lcy
水题.....水得不知道该说什么......
#include<iostream>
#include<cstdio>
#include<string>
#include<sstream>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<deque>
#include<cmath>
#include<climits>
#include<list>
#include<utility>
#include<memory>
#include<cstddef>
#include<iterator>
using namespace std;
typedef long long LL;
const double pi = acos(-1.0);
///
///
int main(int argc, char**argv) {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int vec[31][31];
vec[1][1] = 1;
for (int i = 2; i <= 30; i++) {
for (int j = 1; j <= i; j++) {
if (j >= 2 && j <= i - 1) vec[i][j] = vec[i - 1][j - 1] + vec[i - 1][j];
else vec[i][j] = 1;
}
}
int num;
while (cin >> num) {
for (int i = 1; i <= num; i++) {
for (int j = 1; j <= i; j++) {
cout << vec[i][j];
if (j != i) cout << " ";
}
cout << endl;
}
cout << endl;
}
//system("pause");
return 0;
}