Cod sursa(job #2490563)
| Utilizator | Data | 10 noiembrie 2019 14:56:38 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<fstream>
#define nmax 108
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.in");
int a[nmax][nmax],i,j,n,k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i!=j && a[i][k]!=0 && a[k][j]!=0)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
}
