Pagini recente » Cod sursa (job #855444) | Cod sursa (job #402808) | Cod sursa (job #1950191) | Cod sursa (job #1057439) | Cod sursa (job #1452589)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i, j, n, k, m[101][101]={0};
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
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] && i!=j && (m[i][j]>m[i][k]+m[k][j] || !m[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";
}
}