Cod sursa(job #3186490)
Utilizator | Data | 23 decembrie 2023 13:51:45 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n,i,j,k,a[101][101];
int main()
{
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
for(k=1;k<=n;k++) // consideram nodul k ca fiind nodul intermediar dintre nodul i si nodul j
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
if(i!=j&&k!=i&&k!=j&&(a[i][j]>a[i][k]+a[k][j]||a[i][j]==0))
a[i][j]=a[i][k]+a[k][j];
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<'\n';
}
return 0;
}