Cod sursa(job #1977127)

Utilizator GeoeyMexicanuBadita George GeoeyMexicanu Data 5 mai 2017 00:28:01
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include <iostream>
#include <fstream>
#define N 200

using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int a[N][N],i,j,n,m,k,t,p,r;

int main()
{
    f>>n;
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
        f>>a[i][j];
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    for(k=1;k<=n;k++)
    if(a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) && i!=j)
        a[i][j]=a[i][k]+a[k][j];
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            g<<a[i][j]<<' ';
        g<<'\n';
    }
}