Pagini recente » Cod sursa (job #2765351) | Monitorul de evaluare | Cod sursa (job #392590) | Cod sursa (job #1684921) | Cod sursa (job #2365285)
#include <bits/stdc++.h>
#define INF 1005
using namespace std;
int i, j, k, n, v[105][105];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for(i = 1; i <= n; i ++)
for(j = 1; j <= n; j ++)
{
f >> v[i][j];
if(v[i][j] == 0)v[i][j] = INF;
}
for(i = 1; i <= n; i ++)
for(j = 1; j <= n; j ++)
for(k = 1; k <= n; k ++)
if(v[i][j] > v[i][k] + v[k][j])v[i][j] = v[i][k] + v[k][j];
for(i = 1; i <= n; i ++)
{
for(j = 1; j <= n; j ++)
if(v[i][j] == INF || i == j)g << "0" << " ";
else g << v[i][j] << " ";
g << "\n";
}
return 0;
}