Pagini recente » Cod sursa (job #3161368) | Cod sursa (job #2131633) | Cod sursa (job #3264474) | Monitorul de evaluare | Cod sursa (job #941782)
Cod sursa(job #941782)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101],i ,j, k, n;
int main()
{
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
in>>a[i][j];
if(a[i][j]==0) a[i][j]=10000000;
}
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])&&(b[i][k]+b[j][k]>b[i][j]))
{
b[i][j]=b[i][k]+b[j][k];
}*/
if(a[i][k]+a[k][j]<a[i][j])
{
a[i][j]=a[i][k]+a[k][j];
// b[i][j]=b[i][k]+b[k][j];
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][j]==10000000){out<<"0 ";}
else out<<a[i][j]<<" ";
}
out<<"\n";
}
/* for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++) out<<b[i][j]<<" ";
out<<"\n";
}*/
return 0;
}