Pagini recente » Cod sursa (job #2460648) | Cod sursa (job #2102322) | Cod sursa (job #548405) | Cod sursa (job #1518794) | Cod sursa (job #1012878)
#include <fstream>
using namespace std;
int a[105][105];
int main()
{
int i, j, n, k;
ifstream fin("royfloyd.in");
fin>>n;
ofstream fout("royfloyd.out");
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin>>a[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}