Pagini recente » Cod sursa (job #899693) | Cod sursa (job #112917) | Cod sursa (job #179206) | Cod sursa (job #2669604) | Cod sursa (job #2417813)
#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 i = 0; i < n; i++)
for(int j = 0; j < n; j++)
for(int k = 0; k < n; k++)
{
if(d[i][k] && d[k][j]) d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
if(d[j][k] && d[k][i]) d[j][i] = min(d[j][i],d[j][k]+d[k][i]);
}
for(int i = 0; i < n; i++, out << '\n')
for(int j = 0; j < n; j++) out << d[i][j] << ' ';
return 0;
}