Cod sursa(job #2215890)
Utilizator | Ayy LMAO TheNextGeneration | Data | 24 iunie 2018 09:11:56 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int v[105][105];
int main()
{
int n;
in >> n;
for (int i = 1; i<=n; i++)
for (int j = 1; j<=n; j++)
in >> v[i][j];
for (int i = 1; i<=n; i++)
for (int j = 1; j<=n; j++)
for (int k = 1; k<=n; k++)
{
if (i == j)
continue;
v[i][j] = min(v[i][j],v[i][k]+v[k][j]);
}
for (int i = 1; i<=n; i++, out << "\n")
for (int j = 1; j<=n; j++)
out << v[i][j] << " ";
}