Cod sursa(job #365408)
| Utilizator | Data | 18 noiembrie 2009 16:57:34 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f1 ("royfloyd.in");
ofstream f2 ("royfloyd.out");
int n, a[110][110];
int main()
{
f1>>n;
int i,j,k;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++) f1>>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++)
f2<<a[i][j]<<" ";
f2<<"\n";
}
return 0;
}