Pagini recente » Borderou de evaluare (job #130003) | Cod sursa (job #2512026) | Cod sursa (job #478116) | Cod sursa (job #458937) | Cod sursa (job #2302773)
#include <iostream>
#include <fstream>
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] == 1003;
}
}
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++)
if(d[i][j] || (d[i][k] && d[k][j]))
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
afisare();
return 0;
}