Cod sursa(job #3215722)
Utilizator | Radu Pelea radu._.21 | Data | 15 martie 2024 12:09:39 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int n,a[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
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]=1000000000;}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(i!=j)
if(a[i][k]+a[k][j]<a[i][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<<'\n';
}
return 0;
}