Pagini recente » Cod sursa (job #2408479) | Cod sursa (job #2390739) | Cod sursa (job #1838934) | Cod sursa (job #2424690) | Cod sursa (job #2427347)
#include <iostream>
#include <fstream>
using namespace std;
int dist[10000][10000];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
f >> n;
for(int i=1;i<=n;i++)
for (int j = 1; j <= n; j++)
{
f >> dist[i][j];
if (i != j && dist[i][j] == 0)
dist[i][j] = 100000;
}
for (int i = 1; i <= n; i++)
dist[i][i] = 0;
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (dist[i][k] + dist[k][j] < dist[i][j])
dist[i][j] = dist[i][k] + dist[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << dist[i][j] << " ";
g << "\n";
}
return 0;
}