Cod sursa(job #1940702)

Utilizator ticozaurStratila Andrei ticozaur Data 26 martie 2017 19:31:15
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[101][101],n;
int main()
{
    fin >> n;
    for(int i = 0; i<n; i++)
        for(int j = 0; j<n; j++){
            fin >> a[i][j];
            if(i == j)
                a[i][j]=INT_MAX;
        }
    for(int k=0; k<n; k++)
        for(int i = 0; i<n; i++)
            for(int j=0; j<n; j++)
                if(i!=j && j!=k && i!=k)
                    if(a[i][k]+a[k][j]<a[i][j])
                        a[i][j]=a[i][k]+a[k][j];

    for(int i = 0; i<n; i++)
    {
        for(int j = 0; j<n; j++)
            if(a[i][j] == INT_MAX)
                fout<<"0 ";
            else
                fout << a[i][j] << ' ';
        fout<<'\n';
    }
    return 0;
}