Cod sursa(job #1918473)

Utilizator BenosuCusniriuc Beniamin Benosu Data 9 martie 2017 15:32:22
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <iostream>
#include <fstream>
using namespace std;
int a[110][110],n;
void royd()
{
    int i , j , k ;
    for ( k = 1 ; k <= n ; k++ )
        for ( i = 1 ; i <= n ; i++ )
            for ( j = 1 ; j<= n ; j++ )
                if ( ( a[i][j] > a[i][k] + a[k][j] || !a[i][j] ) && i-j && a[i][k] && a[k][j])
                   a[i][j]=a[i][k]+a[k][j];
}
int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f>>a[i][j];
    royd();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
            g<<a[i][j]<<" ";
        g<<"\n";
    }

    return 0;
}