Pagini recente » Cod sursa (job #1279269) | Cod sursa (job #1924828) | Cod sursa (job #2726344) | Cod sursa (job #1271000) | Cod sursa (job #1240028)
#include <fstream>
using namespace std;
ifstream is ("royfloyd.in");
ofstream os ("royfloyd.out");
int n, a[101][101];
void Read();
void RoyFloyd();
void Write();
int main()
{
Read();
RoyFloyd();
Write();
is.close();
os.close();
return 0;
}
void Read()
{
is >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
is >> a[i][j];
}
void Write()
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
os << a[i][j] << ' ';
os << '\n';
}
}
void RoyFloyd()
{
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
}