Pagini recente » Cod sursa (job #875737) | Rating Stiuj Emanuel-Stefan (em_7s) | Cod sursa (job #874013) | Cod sursa (job #2198165) | Cod sursa (job #2829160)
#include <iostream>
#include <fstream>
#define infinit 10000000000
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n, ma[100][100];
void afisareMa()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
fout << ma[i][j] << ' ';
fout << endl;
}
}
void royFloyd()
{
int i, j, k;
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if((ma[i][k] != infinit) && (ma[k][j] != infinit))
if(ma[i][j] > ma[i][k] + ma[k][j])
ma[i][j] = ma[i][k] + ma[k][j];
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> ma[i][j];
royFloyd();
afisareMa();
return 0;
}