Pagini recente » Cod sursa (job #2397424) | Cod sursa (job #2539956) | Cod sursa (job #822548) | Cod sursa (job #11791) | Cod sursa (job #1575769)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("floyd.in");
ofstream g("floyd.out");
int v[102][102];
int n,i,j,k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>v[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[i][j]>v[i][k]+v[k][j])
v[i][j]=v[i][k]+v[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<v[i][j]<<' ';
g<<endl;
}
f.close();
g.close();
return 0;
}