Pagini recente » Clasament ojiliis | Cod sursa (job #2600233) | Cod sursa (job #2281769) | Cod sursa (job #2828825) | Cod sursa (job #693897)
Cod sursa(job #693897)
#include <fstream>
using namespace std;
int a[100][100],i,j,k,n;
int main ()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';}
f.close(); g.close();
return 0;
}