Pagini recente » Cod sursa (job #1333779) | Cod sursa (job #118487) | Cod sursa (job #491197) | Cod sursa (job #233137) | Cod sursa (job #2865719)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 105;
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] << ' ';
fout << '\n';
}
}
void read()
{
fin >> n;
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= n ; j++)
fin >> dp[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(dp[i][k] + dp[k][j] < dp[i][j])
dp[i][j] = dp[i][k] + dp[k][j];
}
int main()
{
read();
solve();
print();
return 0;
}