Pagini recente » Cod sursa (job #3221172) | Cod sursa (job #1194914) | Cod sursa (job #200286) | Cod sursa (job #1573532) | Cod sursa (job #2191756)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[105][105];
const int oo = 1e4;
void citire()
{
f >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
f >> a[i][j];
}
void roy_floyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <=n; i++)
for(int j = 1; j <=n ; j++)
if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
g << a[i][j] << " ";
g << "\n";
}
}
int main()
{
citire();
roy_floyd();
afisare();
}