Pagini recente » Cod sursa (job #3340630) | Cod sursa (job #2174298) | Cod sursa (job #2414864) | Cod sursa (job #664651) | Cod sursa (job #2130997)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
int n,i,j,k,dmin[100][100];
f>>n;
for(i = 1;i <= n;i++)
for(j = 1;j <= n;j++)
{
f>>dmin[i][j];
}
for(k = 1;k <= n;k++)
for(i = 1;i <=n;i++)
for(j = 1;j <= n;j++)
{
if((dmin[i][j] > dmin[i][k] + dmin[k][j]) && i != j && dmin[i][k] && dmin[j][k])
{
dmin[i][j] = dmin[i][k] + dmin[k][j];
}
}
for(i = 1;i <= n;i++)
{
if(i != 1)
g<<endl;
for(j = 1;j <= n;j++)
{
g<<dmin[i][j]<<" ";
}
}
return 0;
}