Pagini recente » Cod sursa (job #299391) | Cod sursa (job #2049314) | Cod sursa (job #92672) | Cod sursa (job #2322475) | Cod sursa (job #1772367)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int d[105][105];
int main()
{
int n, i, j, k;
in >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
in>>d[i][j];
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i!=k && j!=k && i!=j && d[i][k] && d[k][j])
if(d[i][j] == 0 || d[i][k] + d[k][j] < d[i][j])
d[i][j] = d[i][k] + d[k][j];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
out<<d[i][j]<< " ";
out<<"\n";
}
return 0;
}