Cod sursa(job #2566851)
| Utilizator | Data | 3 martie 2020 13:25:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,a[110][110],d[110][110];
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(a[i][j]==0)a[i][j]=INT_MAX/2;
d[i][j]=a[i][j];
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(i!=j)g<<d[i][j]<<" ";
else g<<0<<" ";
g<<'\n';
}
return 0;
}
