Pagini recente » Cod sursa (job #2385997) | Cod sursa (job #2499660) | Cod sursa (job #1580349) | Cod sursa (job #435668) | Cod sursa (job #2870657)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, d[101][101];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n;j++)
fin >> d[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if (d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != 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 << '\n';
}
return 0;
}