Pagini recente » Cod sursa (job #357659) | Cod sursa (job #2198711) | Cod sursa (job #498860) | Cod sursa (job #2312459) | Cod sursa (job #3302984)
#include <fstream>
#include <queue>
#include <set>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int d[101][101], n;
int main()
{
cin>>n;
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
cin>>d[i][j];
}
for(int m = 1; m <= n; ++m)
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
if(i == j)
continue;
if(d[i][m] + d[m][j] < d[i][j])
d[i][j] = d[i][m] + d[m][j];
}
}
}
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
cout<<d[i][j]<<" ";
cout<<"\n";
}
return 0;
}