Cod sursa(job #3270953)
| Utilizator | Data | 24 ianuarie 2025 21:43:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <bits/stdc++.h>
using namespace std;
int v[1005][1005];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
f >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <=n ; j++)
{
f >> v[i][j];
}
}
for(int k = 1; k <= n; k ++)
{
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= n; j ++)
{
if(v[i][j] > v[i][k] + v[k][j])
v[i][j] = v[i][k] + v[k][j];
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <=n ; j++)
{
g << v[i][j] << " ";
}
g << '\n';
}
return 0;
}
