Cod sursa(job #2497022)
Utilizator | Data | 21 noiembrie 2019 22:49:36 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int v[100][100];
int n,i,j,k;
int main()
{
f>>n;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
f>>v[i][j];
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(i!=j&&(v[i][j]>v[i][k]+v[k][j]||!v[i][j])&&v[i][k]&&v[k][j])
v[i][j]=v[i][k]+v[k][j];
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
g<<v[i][j]<<" ";
g<<endl;
}
}