Pagini recente » Cod sursa (job #1125554) | Cod sursa (job #1311863) | Cod sursa (job #2205946) | Profil ZeKalanga | Cod sursa (job #1915889)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, G[105][105];
void RoyFloyd()
{
short i, j, k;
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(G[i][k] && G[k][j] && ( G[i][j] > G[i][k] + G[k][j] || !G[i][j]) && i != j )
G[i][j] = G[i][k] + G[k][j];
}
void citire()
{
fin >> n;
short i, j;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
fin >> G[i][j];
}
void Afisare()
{
short i, j;
for(i = 1; i <= n; fout <<'\n' i++)
for(j = 1; j <= n; fout << G[i][j++]);
}
int main()
{
citire();
RoyFloyd();
Afisare();
fin.close();
fout.close();
return 0;
}