Cod sursa(job #798123)

Utilizator VisuianMihaiMihai Visuian VisuianMihai Data 15 octombrie 2012 19:39:42
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n, a[101][101];
void solve()
{
    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][k]+a[k][j]<a[i][j]||!a[i][j]) && i != j )
                {
                    a[i][j] = a[i][k]+a[k][j];
                }
            }
}
int main()
{
    fin >> n;
    for ( int i = 1; i <= n; i++ )
    {
        for (int j = 1; j <= n; j++ )
        {
            fin >> a[i][j];
        }
    }
    solve();
    for ( int i = 1; i <= n; i++ )
    {
        for ( int j = 1; j <= n; j++ )
        {
            fout << a[i][j] << ' ';
        }
        fout << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}