Cod sursa(job #2296683)
| Utilizator | Data | 4 decembrie 2018 22:17:15 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[300][300]={0};
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&&i!=j)
a[i][j]=1000000;
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(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++)
fout<<a[i][j]<<" ";
fout<<endl;
}
return 0;
}
