Pagini recente » Cod sursa (job #1436244) | Cod sursa (job #2153046) | Cod sursa (job #787070) | Cod sursa (job #2487666) | Cod sursa (job #2298924)
#include <bits/stdc++.h>
#define pii pair<int,int>
#define fs first
#define sc second
#define pb push_back
#define zeros(x) x&(-x)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define oo 2000000000
#define pii pair<int,int>
#define ll long long
#define ld long double
#define ull unsigned long long
#define mem(a) memset(a,0,sizeof(a))
#define pi 3.14159265359
#define MAXN 100010
using namespace std;
ifstream fin("a.in");
ofstream fout("a.out");
int a[105][105],tata[105][105];
int i,j,k,n;
int main()
{
fin>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
{
fin>>a[i][j];
if(a[i][j] == 0)
a[i][j] = oo;
}
for(k=1; k<=n; ++k)
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
if(i!=j && a[i][k]!=oo && a[k][j]!=oo && a[i][k] + a[k][j] <= a[i][j])
{
a[i][j] = a[i][k] + a[k][j];
tata[i][j] = tata[k][j];
}
for(i=1; i<=n; ++i,fout<<"\n")
for(j=1; j<=n; ++j)
if(a[i][j] == oo) fout<<"0 ";
else fout<<a[i][j]<<" ";
return 0;
}