Cod sursa(job #2414427)
Utilizator | Data | 24 aprilie 2019 16:12:45 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,dist[110][110];
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>dist[i][j];
if(dist[i][j]==0)
dist[i][j]=1000000;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&j!=k&&k!=i)
dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
if(dist[i][j]<1000000)
g<<dist[i][j]<<' ';
else
g<<0<<' ';
g<<'\n';
}
return 0;
}