Pagini recente » Cod sursa (job #40032) | Cod sursa (job #682432) | Cod sursa (job #1767115) | Borderou de evaluare (job #2293670) | Cod sursa (job #884182)
Cod sursa(job #884182)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int dist[101][101];
int main()
{
int N; in >> N;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
in >> dist[i][j];
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][k] + dist[k][j] < dist[i][j] || !dist[i][j]) && 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++)
out << dist[i][j] << ' ';
out << '\n';
}
return 0;
}