#include <iostream>
using namespace std;
int main()
{
int i,t,n,j,k,f;
cin>>t;
while(t--)
{
cin>>n;
for(i=1,j=1;i<=n;cout<<endl,i++,j++)
{
//i=1;
f=i;
//cout<<"nishisb"<<endl;
for(k=1;k<=n;i+=j,k++)
if(k==n) cout<<i;
else
cout<<i<<" ";
i=f;
//cout<<i<<endl; }
}
return 0;
}
//hdu 2123
相关文章
- 07-31HDU 6264 (深搜,数论)
- 07-31HDU 5144 NPY and shot(三分法)
- 07-31[hdu7020]Array
- 07-31HDU7064:Singing Superstar——题解
- 07-31动态规划解决hdu龟兔赛跑
- 07-31[HDU6326]Monster Hunter(贪心)
- 07-31HDU 1702 ACboy needs your help again!(栈和队列的简单应用)
- 07-31HDU 1021 Fibonacci Again
- 07-31hdu 4006 The kth great number
- 07-31HDU - ACboy needs your help again!(链式队列&栈)