Pagini recente » Cod sursa (job #3150161) | Cod sursa (job #826175) | Cod sursa (job #40383) | Cod sursa (job #529908) | Cod sursa (job #2443416)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int Nmax = 100 + 5;
int dp[Nmax][Nmax], n;
int main()
{
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
fin >> dp[i][j];
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
{
if(i == j || !dp[i][k] || !dp[k][j])continue;
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
for(int i = 1; i <= n; ++i, fout << '\n')
for(int j = 1; j <= n; ++j)
fout << dp[i][j] << ' ';
return 0;
}