Cod sursa(job #2121245)

Utilizator lorena1999Marginean Lorena lorena1999 Data 3 februarie 2018 14:46:42
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
#define MAX 105
#include <climits>

using namespace std;

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

int n, a[MAX][MAX], inf=INT_MAX;

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