Pagini recente » Cod sursa (job #1863967) | Cod sursa (job #2172793) | Cod sursa (job #1290365) | Cod sursa (job #2501895) | Cod sursa (job #1346539)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N, a[105][105];
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
for (int j=1; j<=N; ++j)
f>>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 && a[i][k]*a[k][j] && (a[i][j]==0 || a[i][j]>a[i][k]+a[k][j]))
a[i][j]=a[i][k]+a[k][j];
for (int i=1; i<=N; ++i && g<<'\n')
for (int j=1; j<=N; ++j)
g<<a[i][j]<<' ';
return 0;
}