Cod sursa(job #885939)

Utilizator paul_danutDandelion paul_danut Data 22 februarie 2013 15:39:34
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void transformare(int a[][101],int n)
{
    int k,i,j;
    for(k=1;k<=n;k++)
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                if(i!=k&&j!=k&&i!=j)
                     if(a[i][k]+a[k][j]<a[i][j])
                         a[i][j]=a[i][k]+a[k][j];
}
int main()
{
    int a[101][101],n,i,j;
    f>>n;
    for(i=1;i<=n;i++)
       for(j=1;j<=n;j++)
           f>>a[i][j];
    transformare(a,n);
    for(i=1;i<=n;i++)
       {for(j=1;j<=n;j++)
          g<<a[i][j]<<' ';
       g<<'\n';}
}