Pagini recente » Cod sursa (job #2647467) | Cod sursa (job #999869) | Cod sursa (job #2483070) | Cod sursa (job #1080995) | Cod sursa (job #2358110)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int INF = 1e9 + 5;
int n;
int m[105][105], path[105][105];
void Read()
{
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> m[i][j];
}
void Roy_Floyd()
{
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(m[i][k] && m[k][j] && (m[i][j] > m[i][k] + m[k][j] || m[i][j] == 0) && i != j)
m[i][j] = m[i][k] + m[k][j];
}
void Print()
{
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
g << m[i][j] <<" \n"[j == n];
}
int main()
{
Read();
Roy_Floyd();
Print();
return 0;
}