Pagini recente » Cod sursa (job #2254489) | Cod sursa (job #727845) | Cod sursa (job #891656) | Clasament simulareoji2020 | Cod sursa (job #3286449)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
vector <vector <int>> v;
int main ()
{
fin >> n;
v.resize(n + 1, vector <int> (n + 1, 0));
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> 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][k] && v[k][j] && i != j && (v[i][j] == 0 || 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++)
fout << v[i][j] << ' ';
fout << "\n";
}
return 0;
}