Pagini recente » Cod sursa (job #3161399) | Cod sursa (job #2962111) | Clasament FMI No Stress 2012 | Cod sursa (job #2506505) | Cod sursa (job #2518642)
#include <bits/stdc++.h>
#define infile "royfloyd.in"
#define outfile "royfloyd.out"
#define NMAX 105
using namespace std;
int n, dp[NMAX][NMAX];
int main()
{
ifstream f(infile);
ofstream g(outfile);
f >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
f >> 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 (dp[i][k] && dp[k][j] && (dp[i][j] > dp[i][k] + dp[k][j] || !dp[i][j]) && i != j)
{
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
g << dp[i][j] << " ";
}
g << '\n';
}
f.close();
g.close();
return 0;
}