Cod sursa(job #2039545)

Utilizator DavidLDavid Lauran DavidL Data 14 octombrie 2017 17:16:14
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <fstream>
#define MAX 105
#define INF 1000000
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");

int n,D[MAX][MAX];
int main()
{
    fi>>n;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            fi>>D[i][j];

    for (int k=1; k<=n; k++)
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                D[i][j]=min(D[i][j],D[i][k]+D[k][j]);

    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
            fo<<D[i][j]<<" ";
        fo<<"\n";
    }

    return 0;
}