Cod sursa(job #1949941)

Utilizator NineshadowCarapcea Antonio Nineshadow Data 2 aprilie 2017 15:58:03
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>
#define MAXN 102
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int G[MAXN][MAXN],n,dist[MAXN][MAXN];
void royfloyd()
{
    for(int i=1;i<=n;++i)
        memset(dist[i],INT_MAX,MAXN);
    for(int i=1;i<=n;++i)
        dist[i][i]=0;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            if(G[i][j])dist[i][j]=G[i][j];
    for(int k=1;k<=n;++k)
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                if(i!=j && i!=k && j!=k && dist[i][j] > dist[i][k]+dist[k][j])
                    dist[i][j]=dist[i][k]+dist[k][j];
}
int main()
{
    in>>n;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            in>>G[i][j];
    royfloyd();
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j)
            out<<dist[i][j]<<' ';
        out<<'\n';
    }
    return 0;
}