Pagini recente » Cod sursa (job #942052) | Clasament testeaza | Cod sursa (job #1327615) | Cod sursa (job #2408854) | Cod sursa (job #1778121)
#include <iostream>
#include<fstream>
using namespace std;
int n,i,j,k,d[101][101];
int main()
{
ifstream f("royfloyd.in");
f>>n;for(i=0;i<n;++i)for(j=0;j<n;++j)f>>d[i+1][j+1];
f.close();
for(k=0;k<n;++k)
{
for(i=0;i<n;++i)
for(j=0;j<n;++j)
{
if(d[i+1][j+1]>d[i+1][k+1]+d[k+1][j+1])
{
d[i+1][j+1]=d[i+1][k+1]+d[k+1][j+1];
}
}
}
ofstream g("royfloyd.out");
for(i=0;i<n;++i)
{
for(j=0;j<n;++j)g<<d[i+1][j+1]<<" ";
g<<'\n';
}
g.close();
return 0;
}