Pagini recente » Cod sursa (job #1470413) | Cod sursa (job #1616356) | Cod sursa (job #1169485) | Cod sursa (job #2521078) | Cod sursa (job #1580952)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
int main()
{
int i, j, k;
fin >> n;
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';
}
return 0;
}