Pagini recente » Cod sursa (job #1505423) | Cod sursa (job #2688287) | Borderou de evaluare (job #2560147) | Cod sursa (job #2752240) | Cod sursa (job #2668793)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int inf = 1e9;
int G[105][105];
int N;
void RF()
{
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
}
int main()
{
in >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
{
in >> G[i][j];
if(i != j && G[i][j] == 0)
G[i][j] = inf;
}
RF();
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
if(i != j && G[i][j] != inf)
out << G[i][j] << ' ';
else
out << '0' << ' ';
out << '\n';
}
}