//第k層的數(shù) void PascaltriangleKth(int k) { vector<int> result(k,0); int tmp1,tmp; for(int i=0;i<k;i++) { for(int j=0;j<=i;j++) { if(j==0 || j==i) { tmp = 0; tmp1 = 1; result[j]=1; } else { tmp = result[j]; result[j] += tmp1; tmp1 = tmp; } } } for(int j=0;j<result.size();j++) cout<<result[j]<<" "; cout<<endl; }