金字塔数组

#include <iostream>#include <cmath>#include <iomanip>using namespace std;int main(){int m,k;int n=0;    int h=0;cin>>m;k=m;for(;n<k;n++){     int x=0;     m--;int i=m-1;int t=h;for(;i>-1;i--){cout<<"     "; }  for(;x<=n;x++) { cout<<right;  cout<<setw(5)<<pow(2,x); } for(;t>0;t--) { cout<<right; cout <<setw(5)<<pow(2,t-1);}h++;cout <<endl;}return 0;}