Pagini recente » Cod sursa (job #1667052) | Cod sursa (job #1520106) | Cod sursa (job #284020) | Statistici Darie Stefan (DarieStefan) | Cod sursa (job #1815000)
#include <iostream>
#include <fstream>
#define FOR(i,k,v) for( i = k; i <= v;i++)
using namespace std;
int n, t[101][101],k,i,j;
ifstream be("royfloyd.in");
ofstream ki("royfloyd.out");
void beolvas()
{
be>>n;
FOR(i,1,n)
FOR(j,1,n)
be>>t[i][j];
}
void royfloyd()
{
FOR(k,1,n)
FOR(i,1,n)
FOR(j,1,n)
if(i != j and t[i][k] and t[k][j] and (t[i][j] > t[i][k] + t[k][j] or !t[i][j]))
t[i][j] = t[i][k] + t[k][j];
}
void kiir()
{
FOR(i,1,n)
{
FOR(j,1,n)
ki<<t[i][j]<<" ";
ki<<"\n";
}
}
int main()
{
beolvas();
royfloyd();
kiir();
return 0;
}