Pagini recente » Cod sursa (job #545999) | Cod sursa (job #3268349) | Cod sursa (job #491786) | Cod sursa (job #2614177) | Cod sursa (job #2364905)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int i, j, m[101][101], n, k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>m[i][j];
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;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=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<m[i][j]<<" ";
g<<'\n';
}
return 0;
}