蛇形矩阵

#include
using namespace std;
void snake(int n)
{
int current_column=0;
int first_num=1,first_d=0;
int a=0,b=0;
for (int i=0;i!=n;i++)
{
current_column=n-i;
first_num+=i;//首元素
cout<<first_num<<’ ‘;
int b=first_num;
first_d=i+1+1;//初始行间隔
for (int j=1;j!=current_column;j++)
{
a=b+first_d;
if(j!=current_column-1)
cout<<a<<’ ';
else
cout<<a;
b=a;
first_d++;
}
cout<<endl;
}
}

int main()
{
int ro;
cin>>ro;
snake(ro);
return 0;
}