Cod sursa(job #3243036)
| Utilizator | Data | 15 septembrie 2024 12:54:28 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
cin>>n;
int d[n+1][n+1];
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
cin>>d[i][j];
if(d[i][j]==0 && i!=j)
d[i][j]=1e9;
}
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
d[i][j]=min(d[i][j], d[i][k]+d[k][j]);
for(int i=1; i<=n; i++, cout<<'\n')
for(int j=1; j<=n; j++)
cout<<d[i][j]<<' ';
return 0;
}
