Pagini recente » Cod sursa (job #902157) | Cod sursa (job #2584161) | Cod sursa (job #914668) | Cod sursa (job #2786730) | Cod sursa (job #2793144)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
long long n, a[110][110];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
fin >> a[i][j];
if(a[i][j] == 0)
a[i][j] == 999999999;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
if(i != k)
for(int j = 1; j <= n; j++)
if(i != j && j != k && i != k)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(a[i][j] == 999999999)
fout << "0 ";
else fout << a[i][j] << " ";
}
fout << "\n";
}
return 0;
}