Cod sursa(job #2978988)
| Utilizator | Data | 14 februarie 2023 18:22:36 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int NMAX=105,INF=1e9;
int c[NMAX][NMAX];
int main()
{
int i,j,k,n;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
c[i][j]=INF;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>c[i][j];
for(k=1; k<=n; ++k)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
c[i][j]=min(c[i][j],c[i][k]+c[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(c[i][j]<INF)
cout<<c[i][j]<< ' ';
else cout<<"0 ";
cout<<'\n';
}
return 0;
}
