Pagini recente » Cod sursa (job #3220125) | Cod sursa (job #2062254) | Cod sursa (job #1961412) | Cod sursa (job #1556711) | Cod sursa (job #1778937)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define MAX 102
int w[MAX][MAX];
int main()
{
int n, i, j, k;
fin >> n;
for(i = 1 ; i <= n ; i++)
{
for(j = 1 ; j <= n ; j++)
{
fin >> w[i][j];
}
}
for(k = 1 ; k <= n ; k++)
{
for(i = 1 ; i <= n ; i++)
{
for(j = 1 ; j <= n ; j++)
{
if(i != j && w[i][k] && w[k][j] && w[i][k] + w[k][j] < w[i][j])
{
w[i][j] = w[i][k] + w[k][j];
}
}
}
}
for(i = 1 ; i <= n ; i++)
{
for(j = 1 ; j <= n ; j++)
{
fout << w[i][j] << " ";
}
fout << "\n";
}
}