Cod sursa(job #1552971)
Utilizator | Data | 18 decembrie 2015 23:41:13 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int v[1010][1010],i,j,k,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>v[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[i][k] && v[k][j] && (v[i][j] > v[i][k] + v[k][j] || !v[i][j]) && i != j)
v[i][k]=v[i][j]+v[j][k];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<v[i][j]<<' ';
g<<'\n';
}
}