Cod sursa(job #1809226)
Utilizator | Data | 18 noiembrie 2016 18:48:45 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[102][102],i,j,k;
int main()
{ f>>n;
for( i=1;i<=n;i++)
for( j=1;j<=n;j++)
f>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&a[i][k]!=0&&a[k][j]!=0)a[i][j]=min(a[i][k]+a[k][j],a[i][j]);
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';}
}