Cod sursa(job #1818338)
| Utilizator | Data | 29 noiembrie 2016 08:41:30 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m,a[101][101];
int main()
{
fin>>n;
for(int i=1;i<=n;i+=1)for(int j=1;j<=n;j+=1)fin>>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+=1)
{
for(int j=1;j<=n;j+=1)fout<<a[i][j]<<' ';
fout<<'\n';
}
return 0;
}
