Pagini recente » Diferente pentru probleme-de-taietura intre reviziile 41 si 42 | Borderou de evaluare (job #440616) | Cod sursa (job #156842) | Cod sursa (job #179950) | Cod sursa (job #899439)
Cod sursa(job #899439)
#include <fstream>
#define INF (1<<30)-1
#define nmax 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[nmax][nmax];
int main()
{
int n,i,j,k;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(i!=j && !a[i][j]) a[i][j]=INF;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][j]==INF) g<<0<<' ';
else g<<a[i][j]<<' ';
}
g<<'\n';
}
}