Pagini recente » Cod sursa (job #672773) | Cod sursa (job #590722) | Cod sursa (job #1077272) | Istoria paginii runda/haicasepoate | Cod sursa (job #1450237)
#include <fstream>
using namespace std;
int a[100][100],i,j,n,k;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
void citire()
{
in>>n;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
in>>a[i][j];
}
void roy_floyd()
{
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;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(i=0;i<n;i++)
{
for(j=0;j<n;j++)
out<<a[i][j]<<" ";
out<<endl;
}
}
int main()
{
citire();
roy_floyd();
afisare();
return 0;
}