Cod sursa(job #3207535)
Utilizator | Data | 26 februarie 2024 13:02:49 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int v[1005][1005];
int main()
{
int n,i,j;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>v[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if((v[i][k]+v[k][j]<v[i][j] && v[i][k] && v[j][k]))
v[i][j]=v[i][k]+v[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<v[i][j]<<' ';
cout<<endl;
}
return 0;
}