Cod sursa(job #2169298)

Utilizator DovlecelBostan Andrei Dovlecel Data 14 martie 2018 14:38:57
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <fstream>
#include <string.h>
#include <iostream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N=101;
const int INF=100000000;
int a[N][N],n,d[N][N];
int main()
{
    int i,j,k;
    in>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            in>>a[i][j];
            if(a[i][j]==0 && i!=j)
                d[i][j]=INF;
            else if(a[i][j])
                d[i][j]=a[i][j];
        }
    for(k=1;k<=n;k++)
    {
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++)
            out<<d[i][j]<<' ';
        out<<'\n';
    }
    return 0;
}