Pagini recente » Cod sursa (job #85056) | Cod sursa (job #1338084) | Cod sursa (job #2303150) | Cod sursa (job #1717846) | Cod sursa (job #1602263)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int c[101][101], n, nmax=1000000;
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
f>>c[i][j];
if(!c[i][j])
c[i][j]=nmax;
}
}
void roy()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j && c[i][j]>c[i][k]+c[k][j])
c[i][j]=c[i][k]+c[k][j];
}
void afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
if(c[i][j]==nmax)
g<<0<<" ";
else g<<c[i][j]<<" ";
g<<"\n";
}
}
int main()
{
citire();
roy();
afisare();
return 0;
}