| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 146695 | 李明秦 | 打印杨辉三角 | C++ | Wrong Answer | 0 MS | 276 KB | 304 | 2026-01-29 17:01:36 |
#include<bits/stdc++.h> using namespace std; int main(){ int n,a[31][31]={0}; cin>>n; a[1][1]=1; for(int i=2;i<=n;i++){ for(int j=1;j<=n;j++){ a[i][j]=a[i-1][j-1]+a[i-1][j]; } } for(int i=2;i<=n;i++){ for(int j=1;j<=n;j++){ cout<<a[i][j]; } } return 0; }
------Input------
26
------Answer-----
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1 1 7 21 35 35 21 7 1 1 8 28 56 70 56 28 8 1 1 9 36 84 126 126 84 36 9 1 1 10 45 120 210 252 210 120 45 10 1 1 11 55 165 330 462 462 330 165 55 11 1 1 12 66 220 495 792 924 792 495 220 66 12 1 1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1 1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1 1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1 1 16 120 560 1820 4368 8008 11440 12870 11440 8008 4368 1820 560 120 16
------Your output-----
11000000000000000000000000121000000000000000000000001331000000000000000000000014641000000000000000000000151010510000000000000000000016152015610000000000000000000172135352171000000000000000000182856705628810000000000000000019368412612684369100000000000000001104512021025221012045101000000000000000111551653304624623301655511100000000000000112662204957929247924952206612100000000000001137828671512871716171612877152867813100000000000011491364100120023003343230032002100136491141000000000001151054551365