Pagini recente » Cod sursa (job #1602163) | Cod sursa (job #2287413) | Cod sursa (job #941199) | Cod sursa (job #216348) | Cod sursa (job #1961212)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i, j, k, N;
int m[103][103];
int main()
{
fin>>N;
for(i = 0; i < N; ++i)
{
for(j = 0; j < N; ++j)
{
fin>>m[i][j];
}
}
for(k = 0; k < N; ++k)
{
for(i = 0; i < N; ++i)
{
for(j = 0; j < N; ++j)
{
if(m[i][k] && m[k][j] && (m[i][j] > m[i][k] + m[k][j] || !m[i][j]) && i != j)
{
m[i][j] = m[i][k] + m[k][j];
}
}
}
}
for(i = 0; i < N; ++i)
{
for(j = 0; j < N; ++j)
{
fout<<m[i][j]<<" ";
}
fout<<endl;
}
return 0;
}