Cod sursa(job #1277394)

Utilizator stefantrettTrett Stefan stefantrett Data 27 noiembrie 2014 16:54:47
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include <stdio.h>
#include <algorithm>

using namespace std;

int a[102][102];
int n;

int main()
{
    freopen("royfloyd.in", "r", stdin);

    cin >> n;

    for(int i=1; i<=n; ++i)
        for(int j=1; j<=n; ++j)
            cin>>a[i][j];

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

    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=n; ++j)
            cout<<a[i][j]<<" ";
        cout<<endl;
    }
    return 0;
}