Pagini recente » Cod sursa (job #1192969) | Diferente pentru info-oltenia-2018/individual/clasament/11-12 intre reviziile 2 si 3 | Cod sursa (job #2783195) | Cod sursa (job #2489746) | Cod sursa (job #941366)
Cod sursa(job #941366)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int INF = 1000000000;
int a[101][101],n,i,j;
void citire()
{
in>>n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
in>>a[i][j];
if(i!=j && a[i][j]==0)
a[i][j] = INF;
}
}
void lungime_drumuri()
{
int i,j,k;
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
citire();
lungime_drumuri();
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
if(a[i][j]!=INF) out<<a[i][j]<<' ';
else out<<"0 ";
out<<"\n";
}
}