Pagini recente » Cod sursa (job #271064) | Cod sursa (job #2743099) | Cod sursa (job #1765178) | Cod sursa (job #1780559) | Cod sursa (job #2302777)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int d[105][105], n;
void citire()
{
f >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
f >> d[i][j];
if(d[i][j] == 0)
d[i][j] = INT_MAX;
}
}
void afisare()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
g << d[i][j] << ' ';
g << '\n';
}
}
int main()
{
citire();
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
afisare();
return 0;
}