Cod sursa(job #1087659)
| Utilizator | Data | 19 ianuarie 2014 18:16:58 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
fstream f("royfloyd.in",ios::in);
fstream g("royfloyd.out",ios::out);
int n,i,j,k,a[110][110];
void floyd()
{
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]==0)||(a[i][j]>a[i][k]+a[k][j]))&&(i!=j)) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
f>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
f>>a[i][j];
floyd();
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++) g<<a[i][j]<<" ";
g<<'\n';
}
f.close();
g.close();
return 0;
}
