Pagini recente » Cod sursa (job #1260272) | Cod sursa (job #1363646) | Cod sursa (job #2237360) | Cod sursa (job #1061812) | Cod sursa (job #1871292)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int inf = 1e9;
long long dp[102][102];
int n;
int min(int a, int b)
{
if (a > b) return b;
return a;
}
void roy_floyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
}
int main()
{
int i, j;
f >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
f >> dp[i][j];
//cout << endl;
roy_floyd();
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
g << dp[i][j] << " ";
g << endl;
}
}