Pagini recente » Cod sursa (job #2842830) | Cod sursa (job #2574253) | Cod sursa (job #745831) | Cod sursa (job #1684103) | Cod sursa (job #2023088)
#include <iostream>
#include <fstream>
using namespace std;
const int INF = 1 << 29;
int N, c[101][101];
void citire()
{
ifstream f("royfloyd.in");
f >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
{
f >> c[i][j];
if(!c[i][j] && i != j) c[i][j] = INF;
}
f.close();
}
void royfloyd()
{
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
{
int cost = c[i][k] + c[k][j];
c[i][j] = min(cost, c[i][j]);
}
}
void afisare()
{
ofstream g("royfloyd.out");
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
g << c[i][j] << ' ';
g << '\n';
}
g.close();
}
int main()
{
citire();
royfloyd();
afisare();
return 0;
}