Pagini recente » Borderou de evaluare (job #2634924) | Cod sursa (job #642047) | Cod sursa (job #635116) | Cod sursa (job #556720) | Cod sursa (job #2856192)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N=101;
int d[N][N];
int main()
{
int n;
in>>n;
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
in>>d[i][j];
}
for (int k=0;k<n;k++)
{
for (int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if (d[i][k]+d[k][j]<d[i][j])
d[i][j]=d[i][k]+d[k][j];
}
}
}
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
{
out<<d[i][j]<<" ";
}
out<<"\n";
}
return 0;
}