Pagini recente » Cod sursa (job #1073892) | Cod sursa (job #1067566) | Cod sursa (job #1247442) | Cod sursa (job #2001373) | Cod sursa (job #1041818)
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <string>
#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)
#define INF 2147483647
using namespace std;
#ifndef TEST
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
#else
ifstream fin ("input.txt");
ofstream fout ("output.txt");
#endif
#define MAXN 100
int n;
int a[MAXN][MAXN];
void Floyd()
{
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
if (a[i][j]==0)
a[i][j]=INF;
for (int i=0; i<n; i++)
a[i][i]=0;
for (int k=0; k<n; k++)
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
if ((i==j) || (k==i) || (k==j)) continue;
else a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
int main()
{
fin>>n;
for (int i=0; i<n; i++)
for (int j=0; j<n; j++)
fin>>a[i][j];
Floyd();
for (int i=0; i<n; i++)
{
for (int j=0; j<n; j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
return 0;
}