Cod sursa(job #2298387)
| Utilizator | Data | 8 decembrie 2018 09:35:21 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[400][400];
int main()
{int i,j,k;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
fin>>a[i][j];
if(a[i][j]==0&&j!=i)
a[i][j]=1000000000;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(j!=k&&a[j][k]>a[j][i]+a[i][k])
a[j][k]=a[j][i]+a[i][k];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<'\n';}
}
