Cod sursa(job #1983916)
Utilizator | Data | 22 mai 2017 20:17:56 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 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 k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(a[i][k] && a[k][j] && (a[i][j] > a[i][k]+a[k][j] || !a[i][j]) && i!=j)
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;
}