Cod sursa(job #2538313)
| Utilizator | Data | 4 februarie 2020 17:34:24 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define inf 200000000
using namespace std;
int a[101][101], n, i, j, k;
int main()
{
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
fin>>n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
fin>>a[i][j];
if (a[i][j]==0 && i!=j)
a[i][j]=inf;
}
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
for (k=1; k<=n; k++)
if (a[j][k]>a[j][i]+a[i][k])
a[j][k]=a[j][i]+a[i][k];
for (i=1; i<=n; i++, fout<<"\n")
for (j=1;j<=n;j++)
fout<<a[i][j]<<" ";
}
