Cod sursa(job #1010852)

Utilizator shagarthAladin shagarth Data 15 octombrie 2013 20:14:04
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#define NMAX=105
using namespace std; 
ifstream f("royfloyd.in");
ofstream f("royfloyd.out"); 
int n,a[NMAX][NMAX];
 
void citire()
{
    f>>n;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
            f>>a[i][j];
    }
}
 
void royfloyd()
{
    for (int k=1; k<=n; k++)
    {
        for (int i=1; i<=n; i++)
        {
            for (int j=1; j<=n; j++)
            {
                if (a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)
                    a[i][j]=a[i][k]+a[k][j];
            }
        }
    }
}
 
void afisare()
{
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
            g<<a[i][j]<<" ";
        g<<"\n";
    }
}
 
int main ()
{
    citire();
    royfloyd();
    afisare();

    f.close();
    g.close();
    return 0;
}