Pagini recente » Cod sursa (job #2755374) | Cod sursa (job #846142) | Cod sursa (job #1052554) | Cod sursa (job #2167684) | Cod sursa (job #941082)
Cod sursa(job #941082)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
int a[101][101],n;
f>>n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++) f>>a[i][j];
for (int k=1; k<=n; k++)
for (int i=1; i<=k; i++)
for (int j=1; j<=n; j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j]=a[i][k]+a[k][j];
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++) g<<a[i][j]<<' '; g<<'\n';
}
f.close(); g.close();
return 0;
}