Cod sursa(job #523419)
| Utilizator | Data | 17 ianuarie 2011 22:51:51 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream.h>
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[101][101];
int main()
{f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) f>>a[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int 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(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++) g<<a[i][j]<<" ";
g<<"\n";
}
g.close();
f.close();
}