Pagini recente » Cod sursa (job #349989) | Clasament 9_2 | Cod sursa (job #1927545) | Cod sursa (job #1052671) | Cod sursa (job #917849)
Cod sursa(job #917849)
#include<fstream>
using namespace std;
#define N 101
int c[N][N];
int n;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i, j, k;
f>>n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
f>>c[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if ((c[i][k] + c[k][j] < c[i][j] || !c[i][j]) && c[i][k] && c[k][j] && i!=j)
c[i][j] = c[i][k] + c[k][j];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
g<<c[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}