Cod sursa(job #675758)

Utilizator Cantor_paulCantor Paul Dan Cantor_paul Data 8 februarie 2012 08:32:05
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.6 kb
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
    int a[100][100],i,j,k,n;
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for(i=1;1<=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][k]&&a[k][j]&&(a[i][k]+a[k][j]<a[i][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<<"\n";
       }
       return 0;
       }