Cod sursa(job #1446944)

Utilizator banamaria95Borcea Ana-Maria banamaria95 Data 3 iunie 2015 11:17:17
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>
using namespace std;

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