Pagini recente » Cod sursa (job #1189332) | Cod sursa (job #997933) | Cod sursa (job #3350068) | Cod sursa (job #136520) | Cod sursa (job #3302999)
#include <fstream>
#include <climits>
#include <set>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
long long 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];
if(d[i][j] == 0)
d[i][j] = LONG_MAX-1;
}
}
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)
{
if(d[i][j] == LONG_MAX - 1)
d[i][j] = 0;
cout<<d[i][j]<<" ";
}
cout<<"\n";
}
return 0;
}