Pagini recente » Cod sursa (job #1807668) | Cod sursa (job #290713) | Cod sursa (job #685867) | Cod sursa (job #2408099) | Cod sursa (job #1378971)
#include <fstream>
using namespace std;
#define NMax 105
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int M[NMax][NMax];
int main()
{
f>>n;
for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) f>>M[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 && M[i][k] && M[k][j] && (M[i][j] > M[i][k] + M[k][j] || !M[i][j]))
M[i][j] = M[i][k] + M[k][j];
for(int i=1;i<=n;++i) {for(int j=1;j<=n;++j) g<<M[i][j]<<" "; g<<"\n";}
f.close();
g.close();
return 0;
}