Cod sursa(job #2488488)
| Utilizator | Data | 6 noiembrie 2019 23:00:41 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[105][105];
int main(){
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
fin>>a[i][j];
if(a[i][j]==0)
a[i][j]=2000000000;
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j&&a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
if(a[i][j]==2000000000)
fout<<0<<" ";
else
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}
