Pagini recente » Cod sursa (job #1928396) | Cod sursa (job #1783790) | Cod sursa (job #1998791) | Rating Olteanu Laurentiu (laur4444) | Cod sursa (job #1206196)
#include<fstream>
using namespace std;
int n, rf[105][105];
int main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin >> n;
for (int i = 1; i <= n; i ++)
for (int j = 1; j <= n; j ++)
cin >> rf[i][j];
for (int k = 1; k <= n; k ++)
for (int i = 1; i <= n; i ++)
for (int j = 1; j <= n; j ++)
if ((rf[i][k] + rf[k][j] < rf[i][j] || !rf[i][j]) && rf[i][k] && rf[k][j] && i != j)
rf[i][j] = rf[i][k] + rf[k][j];
for (int i = 1; i <= n; i ++)
{
for (int j = 1; j <= n; j ++)
cout << rf[i][j] << " ";
cout << endl;
}
return 0;
}