Cod sursa(job #1905690)
| Utilizator | Data | 6 martie 2017 10:19:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[101][101], n, i, j, k, x, y;
int main()
{
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(a[i][k] !=0 && a[k][j] != 0 && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0) && 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";
}
return 0;
}
