Cod sursa(job #3224783)
Utilizator | Ruxandra Vasilescu Ruxandra009 | Data | 16 aprilie 2024 10:52:37 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[105][105], n;
int main()
{
f >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
f >> a[i][j];
for(int k = 1; k <= n; k ++)
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for(int i = 1; i <= n; i ++, g << '\n')
for(int j = 1; j <= n; j ++)
g << a[i][j] << " ";
return 0;
}