Pagini recente » Cod sursa (job #1339257) | Cod sursa (job #1319794) | Cod sursa (job #1484819) | Cod sursa (job #2492626) | Cod sursa (job #3245531)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[105][105], sol[105][105];
int main()
{
f >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
{
f >> a[i][j];
if(a[i][j] == 0)
sol[i][j] = 10000;
else
sol[i][j] = a[i][j];
}
for(int i = 1; i <= n; i ++)
sol[i][i] = 0;
for(int k = 1; k <= n; k ++)
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
if(sol[i][j] > sol[i][k] + sol[k][j])
sol[i][j] = sol[i][k] + sol[k][j];
for(int i = 1; i <= n; i ++, g << '\n')
for(int j = 1; j <= n; j ++)
if(sol[i][j] == 10000)
g << 0 << " ";
else
g << sol[i][j] << " ";
return 0;
}