Pagini recente » Cod sursa (job #210435) | Cod sursa (job #2683269) | Cod sursa (job #1220000) | Cod sursa (job #604690) | Cod sursa (job #2353272)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("roy-floyd.in");
ofstream g("roy-floyd.out");
int n, m, C[101][101];
void citire()
{
f >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
f >> C[i][j];
}
void Roy_Floyd()
{
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];
if(cost < C[i][j])
C[i][j] = cost;
}
}
void afis()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
g << C[i][j] << ' ';
g << '\n';
}
}
int main()
{
citire();
Roy_Floyd();
afis();
return 0;
}