Pagini recente » Cod sursa (job #1958874) | Cod sursa (job #1958853) | Cod sursa (job #881347) | Cod sursa (job #1238456) | Cod sursa (job #3325467)
#include <iostream>
#include <fstream>
using namespace std;
const int INF = 1e9;
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int N;
in >> N;
int graph[105][105];
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
in >> graph[i][j];
if(graph[i][j] == 0 && i != j)
graph[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(graph[i][k] + graph[k][j] < graph[i][j])
{
graph[i][j] = graph[i][k] + graph[k][j];
}
}
}
}
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
if(graph[i][j] == INF)
graph[i][j] = 0;
out << graph[i][j] << " ";
}
out << "\n";
}
return 0;
}