Mai intai trebuie sa te autentifici.

Cod sursa(job #1300614)

Utilizator Teodora_GidiutaTeodora Gidiuta Teodora_Gidiuta Data 24 decembrie 2014 17:35:42
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
#define NMax 1001
using namespace std;
int n,a[101][101];
void royfloyd()
{int k,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];
}
int main()
{int i,j;
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f>>n;
    for(i=1;i<=n;i++)
       for(j=1;j<=n;j++)
          f>>a[i][j];
    royfloyd();
    for(i=1;i<=n;i++)
    {
       for(j=1;j<=n;j++)
          g<<a[i][j]<<" ";
    g<<"\n";
    }
    f.close();
    g.close();
}