Cod sursa(job #1779477)

Utilizator sebinechitasebi nechita sebinechita Data 15 octombrie 2016 13:08:01
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define MAX 102
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[MAX][MAX];

int main()
{
    int n, i, j, k;
    fin >> n;
    for(i = 1 ; i <= n ; i++)
    {
        for(j = 1 ; j <= n ; j++)
        {
            fin >> a[i][j];
        }
    }
    for(k = 1 ; k <= n ; k++)
        for(i = 1 ; i <= n ; i++)
            for(j = 1 ; j <= n ; j++)
                if(i != j && (a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0) && a[i][k] && a[k][j])
                    a[i][j] = a[i][k] + a[k][j];
    for(i = 1 ; i <= n ; i++)
    {
        for(j = 1 ; j <= n ; j++)
        {
            fout << a[i][j] << " ";
        }
        fout << "\n";
    }
}