Cod sursa(job #1127308)
Utilizator | Cretu Bogdan reking | Data | 27 februarie 2014 11:57:36 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#define NMax 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[NMax][NMax],n;
int main ()
{
int i,j,k;
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][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;
}
}