Pagini recente » Cod sursa (job #1125776) | Cod sursa (job #293197) | Cod sursa (job #2880565) | Cod sursa (job #2372537) | Cod sursa (job #936245)
Cod sursa(job #936245)
#include <fstream>
using namespace std;
int mat[101][101];
int n , m;
ifstream input("royfloyd.in");
ofstream output("royfloyd.out");
const static int infinit = 0;
int main()
{
input >> n;
for (int i =1;i<=n;i++)
for (int j = 1;j<=n;j++)
{
input >> mat[i][j];
}
for (int k =1;k<=n;k++)
for (int i =1;i<=n;i++)
for (int j= 1;j<=n;j++)
if ((mat[i][j] > mat[i][k] + mat[k][j] || !mat[i][j]) && i != j && mat[i][k] && mat[k][j])
{
mat[i][j] = mat[i][k] + mat[k][j];
}
for (int i =1;i<=n;i++)
{
for (int j = 1;j<=n;j++)
{
output << mat[i][j] << " ";
}
output << "\n";
}
return 0;
}