Cod sursa(job #2105718)
| Utilizator | Data | 14 ianuarie 2018 00:03:12 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int mv[105][105];
int main(){
int n,i,k,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>mv[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(mv[i][k] && mv[k][j] && i!=j && (mv[i][j]>mv[i][k]+mv[k][j] || !mv[i][j]))
mv[i][j]=mv[i][k]+mv[k][j];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
fout<<mv[i][j]<<" ";
fout<<"\n";
}
return 0;
}
