Pagini recente » Cod sursa (job #330487) | Cod sursa (job #245139) | Cod sursa (job #96094) | Cod sursa (job #843760) | Cod sursa (job #2422717)
#include <fstream>
#define INF (1 << 30)
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int AP[105][105];
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
fin >> AP[i][j];
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(AP[i][j] == 0)
AP[i][j] = INF;
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(AP[i][k] != INF && AP[k][j] != INF && i != j)
AP[i][j] = min(AP[i][j], AP[i][k] + AP[k][j]);
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
{
if(AP[i][j] == INF)
AP[i][j] = 0;
fout << AP[i][j] << " \n"[j == n];
}
return 0;
}