Cod sursa(job #891288)

Utilizator ard_procesoareLupicu ard_procesoare Data 25 februarie 2013 15:23:24
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.17 kb
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define NMAX 105
int v[NMAX][NMAX],d[NMAX][NMAX],n;
void read()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>v[i][j];
}
void tipar()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            fout<<v[i][j]<<" ";
        fout<<"\n";
    }
}
int minim(int a,int b)
{
    if(a==0)
        return b;
    if(a<b)
        return a;
    return b;
}
void solve()
{
   // int i, j, k;
   // for (k = 1; k <= n; k++)
   //     for (i = 1; i <= n; i++)
   //         for (j = 1; j <= n; j++)
   // if (v[i][k] && v[k][j] && (v[i][j] > v[i][k] + v[k][j] || !v[i][j]) && i != j) v[i][j] = v[i][k] + v[k][j];


    int i,j,nod;
    for(nod=1;nod<=n;nod++)
    {
        for(i=1;i<=n;i++)
        {
            if(v[i][nod])
            for(j=1;j<=n;j++)
            {
                if(j==i) continue;
                if(v[nod][j])
                    v[i][j] = minim ( v[i][j] , v[i][nod] + v[nod][j]);
            }
        }
    }
}
int main()
{
    read();
    solve();
    tipar();
}