Pagini recente » Cod sursa (job #2793833) | Cod sursa (job #3033494) | Cod sursa (job #148168) | Cod sursa (job #2911817) | Cod sursa (job #1163965)
#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit (1<<18)
#define inf 1000000
#define N 1100
#define mod 1000000007
#define inu "royfloyd.in"
#define outu "royfloyd.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int a[N][N],n;
int main ()
{
f>>n;
FOR(i,1,n)
FOR(j,1,n)
{
f>>a[i][j];
if(!a[i][j])
a[i][j]=inf;
}
FOR(k,1,n)
FOR(i,1,n)
if(i!=k)
FOR(j,1,n)
if(i!=j&&j!=k)
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
FOR(i,1,n)
{
FOR(j,1,n)
{
if(a[i][j]>=inf)
a[i][j]=0;
g<<a[i][j]<<" ";
}
g<<"\n";
}
return 0;
}