Pagini recente » Cod sursa (job #2318936) | Cod sursa (job #1774934) | Cod sursa (job #560902) | Cod sursa (job #1807386) | Cod sursa (job #1580950)
#include <fstream>
using namespace std;
ifstream fin("royfloid.in");
ofstream fout("royfloid.out");
int n, a[1010][1010];
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[j][k] && (a[i][j] > a[i][k] + a[k][j] || i != j))
a[i][j] = a[i][k] + a[k][j];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
fin >> a[i][j];
fout << '\n';
}
return 0;
}