Pagini recente » Cod sursa (job #2767043) | Cod sursa (job #3144128) | Cod sursa (job #3214709) | Cod sursa (job #3128605) | Cod sursa (job #3302149)
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
vector<vector<int>> d(n, vector<int>(n, 1e9));
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
fin >> d[i][j];
}
}
for (int k=0; k<n; ++k)
{
for (int i=0; i<n; ++i)
{
for (int j=0; j<n; ++j)
{
if (d[i][k] + d[k][j] < d[i][j])
{
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (d[i][j] == 1e9)
{
fout << "0 ";
}
else
{
fout << d[i][j] << " ";
}
}
fout << endl;
}
return 0;
}