Pagini recente » Cod sursa (job #3272027) | Cod sursa (job #2321781) | Cod sursa (job #2166204) | Cod sursa (job #753703) | Cod sursa (job #3166461)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 101;
int dp[NMAX][NMAX];
unsigned int min(unsigned int x, unsigned int y) {
return x < y ? x : y;
}
int main()
{
int n, w;
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
fin >> w;
if (i != j && w == 0)
w = INT_MAX;
dp[i][j] = w;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
dp[i][j] = (int)min(dp[i][j], ((unsigned int) dp[i][k] + dp[k][j]));
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
fout << dp[i][j] << " ";
fout << "\n";
}
return 0;
}