Pagini recente » Cod sursa (job #3031696) | Cod sursa (job #2718347) | Cod sursa (job #932373) | Cod sursa (job #703105) | Cod sursa (job #2424860)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
const int inf = 1e6;
int main()
{
fin>>N;
vector<vector<int> > d(N+1, vector<int> (N+1, 0));
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
fin>>d[i][j];
if(d[i][j]==0 && i!=j)
d[i][j] = 1e6;
}
}
fin.close();
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
fout<<d[i][j]<<' ';
}
fout<<endl;
}
fout.close();
return 0;
}