Pagini recente » Cod sursa (job #2220474) | Cod sursa (job #1463468) | Cod sursa (job #1963809) | Cod sursa (job #2132553) | Cod sursa (job #715733)
Cod sursa(job #715733)
#include <fstream>
using namespace std;
long M[101][101];
long minim(long a,long b)
{
return (a < b) ? a : b;
}
int main(void)
{
fstream fin("royfloyd.in",ios::in);
fstream fout("royfloyd.out",ios::out);
long N,k,i,j;
fin >> N;
for (i = 0;i < N;i += 1)
{
for (j = 0;j < N;j += 1)
{
fin >> M[i][j];
}
}
for (k = 0;k < N;k += 1)
{
for (i = 0;i < N;i += 1)
{
for (j = 0;j < N;j += 1)
{
M[i][j] = minim(M[i][j],M[i][k] + M[k][j]);
}
}
}
for (i = 0;i < N;i += 1)
{
for (j = 0;j < N;j += 1)
{
fout << M[i][j] << " ";
}
fout << "\n";
}
fin.close();
fout.close();
return 0;
}