Cod sursa(job #1424249)

Utilizator lraduRadu Lucut lradu Data 23 aprilie 2015 19:44:56
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream>
#include <fstream>
#define LL long long
using namespace std;

int a[1024][1024];
int n;

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

    f>>n;
    for(int i=0; i<n;  i++)
    {
        for (int j=0; j<n; j++)
        {
            f>>a[i][j];
        }
    }

    for (int k=0; k<n; k++)
        for (int i=0; i<n; i++)
            for (int j=0; j<n; j++)
        {
            if(a[i][j]>a[i][k]+a[k][j])
                a[i][j]=a[i][k]+a[k][j];
        }
    for(int i=0; i<n;  i++)
    {
        for (int j=0; j<n; j++)
        {
            g<<a[i][j]<<" ";
        }
        g<<'\n';
    }


    return 0;
}