Pagini recente » Cod sursa (job #382112) | Cod sursa (job #2235759) | Cod sursa (job #252890) | Cod sursa (job #2568757) | Cod sursa (job #1645076)
#include <fstream>
using namespace std;
int d[105][105];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n; f >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
f >> d[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 && d[i][k] && d[k][j]) {
if(!d[i][j]) d[i][j] = d[i][k] + d[k][j];
else d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= n; j ++) g << d[i][j] << " ";
g << "\n";
}
return 0;
}