Pagini recente » Cod sursa (job #2266000) | Cod sursa (job #3003667) | Cod sursa (job #819816) | Borderou de evaluare (job #1567986) | Cod sursa (job #2739391)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
//const int inf = 0x3f3f3f3f;
int main()
{
int n;
fin >> n;
int** a = new int*[n];
for (int i = 0; i < n; ++i)
a[i] = new int[n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
{
fin >> a[i][j];
//if(a[i][j] == 0)
//a[i][j] = inf;
}
for (int k = 0; k < n; ++k)
{
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
for (int i = 0; i < n; ++i, fout << '\n')
{
for (int j = 0; j < n; ++j)
{
// if(a[i][j] != inf && i != j)
fout << a[i][j] << ' ';
// else
// fout << "0 ";
}
}
return 0;
}