Cod sursa(job #1959872)

Utilizator amaliarebAmalia Rebegea amaliareb Data 9 aprilie 2017 23:54:18
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,v[101][101],newcost;

int main()
{
    f>>n;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++) f>>v[i][j];
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            for(k=1;k<=n;k++)
            {
                if(v[i][k]>0 && v[k][j])
                {
                    newcost=v[i][k]+v[k][j];
                    if((!v[i][j] || v[i][j]>newcost) && i!=j) v[i][j]=newcost;
                }
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++) g<<v[i][j]<<' ';
        g<<'\n';
    }
    return 0;
}