Pagini recente » Cod sursa (job #2133724) | Cod sursa (job #332613) | Cod sursa (job #2423514) | Cod sursa (job #2333876) | Cod sursa (job #1922374)
#include <iostream>
#include <fstream>
#include <cstring>
#include <limits.h>
using namespace std;
int n;
int a[100][100];
int dist[100][100];
#define INF INT_MAX
void floyd()
{
memcpy(dist, a, sizeof(a));
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(dist[i][k]!=0 && dist[k][j]!= 0 && dist[i][j]!=0)
if(dist[i][k] + dist[k][j] < dist[i][j])
dist[i][j] = dist[i][k] + dist[k][j];
}
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
f >> a[i][j];
floyd();
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
g << dist[i][j] << ' ';
g << '\n';
}
return 0;
}