Pagini recente » Cod sursa (job #2402287) | Cod sursa (job #665680) | Borderou de evaluare (job #1036243) | Cod sursa (job #1099464) | Cod sursa (job #898982)
Cod sursa(job #898982)
#include <fstream>
#define maxn 120
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int a[maxn][maxn];
void read()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>a[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i==j) continue;
else if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] ||a[i][j]==0 )) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
read();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
out<<a[i][j]<<" ";
out<<"\n";
}
return 0;
}