Pagini recente » Cod sursa (job #115667) | Cod sursa (job #3185951) | Cod sursa (job #1270271) | Cod sursa (job #1386995) | Cod sursa (job #1123107)
#include<fstream>
using namespace std;
int a[105][105];
int main()
{
int n,i,j,k;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
f>>a[i][j];
}
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][k]+a[k][j]||!a[i][j])&&i!=j)
a[i][j]=a[i][k]+a[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
g<<a[i][j]<<" ";
}
g<<"\n";
}
f.close();
g.close();
return 0;
}