Cod sursa(job #2318914)
Utilizator | Papadia Mortala dacianoua | Data | 13 ianuarie 2019 18:33:15 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[105][105];
int main()
{
int n, i, j, k;
f >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
f >> 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] > 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++)
g<< a[i][j]<<" ";
g<<"\n";
}
}