Cod sursa(job #917849)

Utilizator adasarcaAda Sarca adasarca Data 18 martie 2013 13:28:56
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include<fstream>
using namespace std;

#define N 101

int c[N][N];
int n;

int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    
    int i, j, k;
    
    f>>n;    
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            f>>c[i][j];
            
    for (k = 1; k <= n; k++)
        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++)
                if ((c[i][k] + c[k][j] < c[i][j] || !c[i][j]) && c[i][k] && c[k][j] && i!=j)
                            c[i][j] = c[i][k] + c[k][j];
    
    for (i = 1; i <= n; i++)
    {
        for (j = 1; j <= n; j++)
            g<<c[i][j]<<" ";
        g<<"\n";    
    }
    
    f.close();
    g.close();
    return 0;
}