Pagini recente » Cod sursa (job #2049332) | Cod sursa (job #1199197) | Cod sursa (job #2593080) | Cod sursa (job #1668600) | Cod sursa (job #1382591)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int a[101][101];
int c[101][101];
int n;
int main()
{
is >> n;
for(int i= 1 ; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
is >> a[i][j];
c[i][j] = a[i][j];
}
}
for(int k = 1; k <= n; ++k)
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
//if(c[i][k] && c[k][j] && (c[i][j] > c[i][k] + c[k][j] || !c[i][j]) && i != j)
if(i != j && c[i][k] + c[k][j] < c[i][j])
c[i][j] = c[i][k] + c[k][j];
}
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
os << c[i][j] << ' ';
}
os << '\n';
}
is.close();
os.close();
return 0;
}