Pagini recente » Cod sursa (job #412459) | Cod sursa (job #2681088) | Cod sursa (job #1197077) | Cod sursa (job #1008105) | Cod sursa (job #3198935)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
const int INF = 1000000;
int m[101][101];
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
in >> m[i][j];
if(m[i][j] == 0 && i != j)
{
m[i][j] = INF;
}
}
}
for(int k = 1; k <= n; k++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
int drum_nou = m[i][k] + m[k][j];
if(i != k && j != k && i != j && m[i][k] != 0 && m[k][j] != 0 && drum_nou < m[i][j])
{
m[i][j] = drum_nou;
}
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
out << m[i][j] << " ";
}
out << "\n";
}
return 0;
}