Cod sursa(job #2199315)

Utilizator petrut22Petrut petrut22 Data 27 aprilie 2018 10:57:11
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[105][102],N;
void citire()
{
    f>>N;
    int i,j;
    for(i=1; i<=N; i++)
        for(j=1; j<=N; j++)
            f>>a[i][j];
}
void royfloyd()
{
    int i,j,k;
    for(i=1; i<=N; i++)
        for(j=1; j<=N; j++)
            for(k=1; k<=N; k++)
                if(a[i][k] && a[k][j] && i!=j && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]))
                    a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
    int i,j;
    for(i=1; i<=N; i++)
    {
        for(j=1; j<=N; j++)
            g<<" "<<a[i][j];
        g<<endl;
    }
}

int main()
{
    citire();
    royfloyd();
    afisare();
}