Cod sursa(job #1841132)
| Utilizator | Data | 5 ianuarie 2017 13:01:01 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[102][102];
int main()
{ int i,j,k;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&k!=i&&k!=j)
if((a[i][k]&&a[k][j])&&a[i][j]>a[i][k]+a[k][j]||a[i][j]==0) a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}
