Pagini recente » Borderou de evaluare (job #1133981) | Cod sursa (job #3230011) | Cod sursa (job #2507901) | Borderou de evaluare (job #2220105) | Cod sursa (job #2320644)
#include <iostream>
#include <fstream>
using namespace std;
int d[102][102];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n; f >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
f >> d[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
g << d[i][j] << " ";
g << '\n';
}
f.close();
g.close();
return 0;
}