Pagini recente » Diferente pentru problema/cmmdc intre reviziile 6 si 7 | Cod sursa (job #1770271) | Cod sursa (job #1491934) | Cod sursa (job #1021664) | Cod sursa (job #1877192)
#include <iostream>
#include <fstream>
#define inf 10000000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,m[102][102],k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>m[i][j];
if(m[i][j]==0 && i!=j)
m[i][j]=inf;
}
for(k=1;k<=n;k++)//nod intermediar
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(m[i][j]>m[i][k]+m[k][j])//daca costul de la i la j prin k este mai mic
m[i][j]=m[i][k]+m[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(m[i][j]==inf)
g<<'0'<<" ";
else g<<m[i][j]<<" ";
g<<"\n";
}
return 0;
}