Pagini recente » Cod sursa (job #436632) | Cod sursa (job #1623206) | Cod sursa (job #111738) | Cod sursa (job #917548) | Cod sursa (job #2425218)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int M[101][101];
int main()
{
int N;
fin>>N;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
fin>>M[i][j];
for (int k = 0; k < N; k++)
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
if (M[i][j] > M[i][k] + M[k][j])
M[i][j] = M[i][k] + M[k][j];
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
fout<<M[i][j]<<" ";
fout<<"\n";
}
return 0;
}