Cod sursa(job #525571)
Utilizator | Data | 25 ianuarie 2011 15:38:08 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream.h>
#include<fstream.h>
int main()
{int i,j,a[200][200],k,n;
ifstream f("royfloyd.in");
ofstream h("royfloyd.out");
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]&&i!=k&&j!=k&&a[i][k]!=0&&a[k][j]!=0)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
h<<a[i][j]<<" ";
h<<endl;}
return 0;}