Cod sursa(job #2174980)
Utilizator | Dumitrescu Andrei dumitrescu_andrei | Data | 16 martie 2018 14:35:17 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[105][105];
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)
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;
}