Pagini recente » Cod sursa (job #60014) | Cod sursa (job #1171693) | Cod sursa (job #2805787) | Cod sursa (job #1888317) | Cod sursa (job #1424254)
#include <iostream>
#include <fstream>
#define LL long long
using namespace std;
int a[100][100];
int n;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(int i=0; i<n; i++)
{
for (int j=0; j<n; j++)
{
f>>a[i][j];
}
}
for (int k=0; k<n; k++)
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
{
if(a[i][j]>a[i][k]+a[k][j] || (a[i][j]==0 && i!=j) && (a[i][k]!=0 && a[k][j]!=0))
a[i][j]=a[i][k]+a[k][j];
}
for(int i=0; i<n; i++)
{
for (int j=0; j<n; j++)
{
g<<a[i][j]<<" ";
}
g<<'\n';
}
return 0;
}