Pagini recente » Cod sursa (job #2079609) | Istoria paginii runda/simulare_oni_9_2/clasament | Cod sursa (job #638949) | Cod sursa (job #152061) | Cod sursa (job #941790)
Cod sursa(job #941790)
#include <fstream>
using namespace std;
const int N=101, INF = 1000000000;
int n, d[N][N];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
void citire()
{
int i,j;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
in>>d[i][j];
if(i!=j && d[i][j]==0)
d[i][j] = INF;
}
}
void rf()
{
int k,i,j;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(d[i][k]+d[k][j]<d[i][j])
d[i][j]=d[i][k]+d[k][j];
}
void afisare()
{
int i,j;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
if(d[i][j] != INF) out<<d[i][j]<<" ";
else out<<"0 ";
out<<"\n";
}
}
int main()
{
citire();
rf();
afisare();
return 0;
}