Pagini recente » Cod sursa (job #325374) | Cod sursa (job #3143165) | Cod sursa (job #2826267) | Cod sursa (job #2511236) | Cod sursa (job #3041654)
#include <iostream>
#include <fstream>
std::ifstream in("royfloyd.in");
std::ofstream out("royfloyd.out");
int oo = 1e9;
int n, adj[100][100], d[100][100];
int main()
{
in>>n;
for(int i = 0;i < n;i++)
for(int j = 0;j < n;j++)
{
in >> adj[i][j];
if (!adj[i][j])
adj[i][j] = oo;
d[i][j] = adj[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][j] > d[i][k] + d[k][j] && 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] != oo)
out<<d[i][j]<<' ';
else
out<<0<<' ';
}
out<<'\n';
}
return 0;
}