Pagini recente » Cod sursa (job #3126921) | Cod sursa (job #2229396) | Atasamentele paginii Clasament tema_vacanta_iarna | Cod sursa (job #301791) | Cod sursa (job #941365)
Cod sursa(job #941365)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
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];
}
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][k]!=0 && a[k][j]!=0)
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++)
out<<a[i][j]<<' ';
out<<"\n";
}
}