Cod sursa(job #1542799)

Utilizator tudor199G Tudor tudor199 Data 5 decembrie 2015 17:48:50
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int i,j,k,n,v[100][100];

int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>v[i][j];
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(v[i][k] && v[k][j] &&(v[i][k]+v[j][k]<v[i][j] || !v[i][j]) && i!=j)
                    v[i][j]=v[i][k]+v[j][k];
    {
        for(j=1;j<=n;j++)
            fout<<v[i][j]<<" ";
        fout<<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}