Pagini recente » Cod sursa (job #2636064) | Cod sursa (job #951187) | Cod sursa (job #1633148) | Cod sursa (job #1185246) | Cod sursa (job #2865732)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 105;
const int INF = 2e7;
int n;
int dp[NMAX][NMAX];
void print()
{
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
fout << (dp[i][j] == INF ? 0 : dp[i][j]) << ' ';
fout << '\n';
}
}
void read()
{
fin >> n;
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++){
fin >> dp[i][j];
if(dp[i][j] == 0)
dp[i][j] = INF;
}
}
void solve()
{
for(int k = 1 ; k <= n ; k++)
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
if(dp[i][k] + dp[k][j] < dp[i][j] && i != j)
dp[i][j] = dp[i][k] + dp[k][j];
}
int main()
{
read();
solve();
print();
return 0;
}