Pagini recente » Cod sursa (job #2028123) | Cod sursa (job #880486) | Cod sursa (job #1085509) | Cod sursa (job #1696411) | Cod sursa (job #2256014)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, m[101][101];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1;j <= n; j++)
fin >> 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(m[i][k] && m[k][j] && i!=j)
if(!m[i][j] || m[i][j] > m[i][k] + m[k][j])
m[i][j] = m[i][k] + m[k][j];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j<= n; j++)
fout << m[i][j] << " ";
fout << '\n';
}
return 0;
}