Pagini recente » Cod sursa (job #1114144) | Cod sursa (job #2890858) | Cod sursa (job #210901) | Cod sursa (job #782470) | Cod sursa (job #631057)
Cod sursa(job #631057)
#include<fstream>
#include<algorithm>
#define infinit 1001
using namespace std;
int min(int a, int b)
{
if(a>=b) return b;
return a;
}
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],j,i,k,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(!a[i][j] && i!=j)
a[i][j]=infinit;
}
for(k=1;k<=n;k++)
for(j=1;j<=n;j++)
for(i=1;i<=n;i++)
a[i][j]=min(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]!=infinit) g<<a[i][j]<<" ";
else g<<0<<" ";
g<<endl;
}
return 0;
}