Cod sursa(job #2166384)
Utilizator | Damian Robert DamianRobert | Data | 13 martie 2018 16:51:01 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
int main()
{
int n, i, j, k;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin>>n;
int A[n][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 ((A[i][k]+A[k][j]<A[i][j])&&(i!=j))
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";
}
}