Cod sursa(job #1127119)

Utilizator rekingCretu Bogdan reking Data 27 februarie 2014 11:14:44
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <iostream>
#include <fstream>
#define NMax 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[NMax][NMax],n;
int minim(int a,int b)
{
    if (a>b) return b;
    else return a;
}
int main ()
{
    int i,j,k;
    f>>n;
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            f>>a[i][j];
    for (k=1;k<=n;k++)
        for (i=1;i<=n;i++)
            for (j=1;j<=n;j++)
                a[i][j]=min(a[i][k]+a[k][j],a[i][j]);
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            g<<a[i][j]<<" ";
        }
        g<<endl;
    }
}