Pagini recente » Cod sursa (job #1131732) | Cod sursa (job #2225663) | Cod sursa (job #2464239) | Cod sursa (job #923680) | Cod sursa (job #2643528)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("roy-floyd.in");
ofstream fout("roy-floyd.out");
int n, m, i, j, c, a[200][200], inf = 99999999;
void roys()
{
int k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
fin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j] = inf;
while (fin >> i >> j >> c)
a[i][j] = c;
roys();
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i == j)
fout << "0" << " ";
else if (a[i][j] == inf)
fout << "-1" << " ";
else
fout << a[i][j] << " ";
}
fout << endl;
}
}