#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3+5;
long long a[maxn][maxn] , n , m;
int main ()
{
	scanf("%lld%lld" , &n , &m);
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			a[i][j]=2147483647;
		}
	}
	for (int i = 1; i <= m; i++)
	{
		int u , v , w;
		scanf("%d%d%d" , &u , &v , &w);
		a[u][v]=min(a[u][v] , 1ll*w);
		a[v][u]=min(a[v][u] , 1ll*w);
		a[i][i]=0;
	}
	for (int k = 1; k <= n; k++)
	{
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				if (k != i && k != j && i != j && a[i][j] > a[i][k] + a[k][j])
				{
					a[i][j] = a[i][k] + a[k][j];
				}
			}
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			printf("%lld " , a[i][j]);
		}
		printf("\n");
	}
	return 0;
}

我这个哪里有问题