Pagini recente » Cod sursa (job #21182) | Istoria paginii runda/oni_2016_cl10_ziua1/clasament | Cod sursa (job #2257983) | Istoria paginii runda/speed3 | Cod sursa (job #1817727)
#include <fstream>
using namespace std;
#define Nmax 100
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N, a[Nmax][Nmax];
void royfloyd()
{
int i, j, k;
for(k = 0; k < N; k++)
for(i = 0; i < N; i++)
for(j = 0; j < N; j++)
if(i != j && a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
for(i = 0; i < N; i++)
{
for(j = 0; j < N; j++)
g<< a[i][j] << " ";
g<< "\n";
}
}
int main()
{
f>> N;
int i, j;
for(i = 0; i < N; i++)
for(j = 0; j < N; j++)
f>> a[i][j];
royfloyd();
return 0;
}