| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 151040 | 韩立鹏 | 杨辉三角 | C++ | Accepted | 100 | 0 MS | 240 KB | 325 | 2024-06-11 13:34:21 |
#include<bits/stdc++.h> using namespace std;int n,i,j,k; int a[15][15]; int main() { cin>>n; a[1][1]=1;a[2][1]=1;a[2][2]=1; cout<<"1\n1 1\n"; for(i=3;i<=n;i++){ for(j=1;j<=i;j++){ if(j>1&&j<i) a[i][j]=a[i-1][j-1]+a[i-1][j]; else a[i][j]=1; cout<<a[i][j]<<" "; } cout<<endl; } return 0; }