Pagini recente » Cod sursa (job #1102041) | Cod sursa (job #741503) | Cod sursa (job #2279623) | Cod sursa (job #699536) | Cod sursa (job #2417819)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
int n;
in >> n;
vector<vector<int>> v(n,vector<int>(n));
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++) in >> v[i][j];
vector<vector<int>> d(v);
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(i != j && k != i && k != j)
if(d[i][k] && d[k][j]) d[i][j] = (d[i][j] == 0 ? d[i][k]+d[k][j] : min(d[i][j],d[i][k]+d[k][j]));
for(int i = 0; i < n; i++, out << '\n')
for(int j = 0; j < n; j++) out << d[i][j] << ' ';
return 0;
}