#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[100][100];
int main()
{
	int n , len = 1;
	cin >> n;
	for(int i = 1 ;i <= n ;i ++)
	{
		for(int j= 1; j <= n ; j++)
		{
			a[i][j] = len++;
		}
	}
	for(int i = 1 ; i <=n ;i++)
	{
		for(int j = 1; j <= n ; j++)
			cout << a[j][i] << " ";
		cout << endl;
	}
	return 0;
}

Copy