Pagini recente » Cod sursa (job #1958861) | Cod sursa (job #3244624) | Cod sursa (job #2414663) | Cod sursa (job #1004735) | Cod sursa (job #2191915)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
int A[101][101];
void Read()
{
fin>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
fin>>A[i][j];
}
void Solve()
{
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if (A[i][k] && A[k][j] && i != j && (A[i][j] > A[i][k] + A[k][j] || !A[i][j]))
A[i][j] = A[i][k] + A[k][j];
}
void Print()
{
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
fout<<A[i][j]<<' ';
fout<<'\n';
}
}
int main()
{
Read();
Solve();
Print();
return 0;
}