Cod sursa(job #2575700)
| Utilizator | Data | 6 martie 2020 15:05:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define inf 1000000001
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[101][101];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
{
f>>a[i][j];
}
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
for(int k=1;k<=n;++k)
if(a[i][k] && a[k][j])a[i][j] = min(a[i][j],a[i][k]+a[k][j]);
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
g<<a[i][j]<<" ";
g<<'\n';
}
return 0;
}
