Pagini recente » Cod sursa (job #2649657) | Cod sursa (job #2281646) | Cod sursa (job #724450) | Cod sursa (job #886376) | Cod sursa (job #2758495)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n;
int costuri[101][101],vecini[101][101];
int main()
{
f >> n;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
f >> costuri[i][j];
if(!costuri[i][j])
costuri[i][j] = 1001;
}
}
for(int k = 1; k<=n; k++)
{
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
if(i!=k && j != k && i !=j && costuri[i][j]>costuri[i][k] + costuri[k][j])
costuri[i][j] = costuri[i][k] + costuri[k][j];
}
}
}
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
if(costuri[i][j]!=1001)
g << costuri[i][j]<< " ";
else
g << "0 ";
}
g << endl;
}
}