Pagini recente » Cod sursa (job #893625) | Cod sursa (job #1189402) | Cod sursa (job #2079675) | Cod sursa (job #3002369) | Cod sursa (job #2168198)
#include <iostream>
#include <fstream>
using namespace std;
int n;
int x[105][105];
//int y[100][100];
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> n;
for(int i = 1 ; i <= n; ++i)
{
for(int j = 1 ; j <= n; ++j)
fin >> x[i][j];
}
for(int k = 1; k <= n; ++k)
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
if( i != j && x[i][k] && x[k][j] && ( x[i][j] > x[i][k] + x[k][j] || !x[i][j] ))
x[i][j] = x[i][k] + x[k][j];
}
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
fout << x[i][j] << " " ;
}
fout << endl;
}
fin.close();
fout.close();
return 0;
}