Pagini recente » Autentificare | Cod sursa (job #1206914) | Cod sursa (job #701540) | Istoria paginii runda/preoji2012/clasament | Cod sursa (job #2014225)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int INF = 1 << 31;
int C[101][101];
int n, m;
void afis()
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
if(C[i][j] == INF)
g << "0 ";
else
g << C[i][j] << ' ';
g << '\n';
}
}
void citire()
{
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
f >> C[i][j];
}
void Roy_Floyd()
{
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
{
int s = C[i][k] + C[k][j];
if(C[i][j] > s)
C[i][j] = s;
}
}
int main()
{
f >> n;
citire();
Roy_Floyd();
afis();
return 0;
}