Codeforces Round #194 (Div. 2) A. Candy Bags

#include<stdio.h>
#include<iostream>
using namespace std;
int a[1000000];
int main()
{
    int n;
    cin>>n;
    int t=n*n,j=1,k,l,m=t;

    for(int i=1;i<=n*n;i++)
        a[i]=i;

            for(j=1;j<=(n*(n-1)/2+1);j=j+n/2)
         {
             int k=j,h=n/2;
             while(h--)
             {
                 cout<<a[k++] <<" " ;


             }
             h=n/2;
             l=m-n/2+1;
             while(h--)
             {
                 cout<<a[l++]<<" " ;
                 m--;
             }
             cout<<endl;

         }


         return 0;
}