Pagini recente » Cod sursa (job #2709988) | Cod sursa (job #1914467) | Cod sursa (job #2838797) | Cod sursa (job #449907) | Cod sursa (job #898468)
Cod sursa(job #898468)
#include <iostream>
#include <fstream>
using namespace std;
int N, w[101][101], i, j, k;
void royFloyd ()
{
for(k = 1; k <= N; k++)
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
if ((w[i][j] > w[i][k] + w[k][j] || !w[i][j]) && i!=j && w[i][k] && w[k][j])
w[i][j] = w[i][k] + w[k][j];
}
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
in >> N;
for(i = 1; i <= N; i++)
for(j = 1; j <= N; j++)
in >> w[i][j];
royFloyd();
for(i = 1; i <= N; i++)
{
for(j = 1; j <= N; j++)
out << w[i][j] << " ";
out << "\n";
}
return 0;
}