Pagini recente » Cod sursa (job #2403546) | Cod sursa (job #2990898) | Cod sursa (job #2757966) | Cod sursa (job #3162869) | Cod sursa (job #1467037)
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <limits.h>
#include <algorithm>
#include <deque>
#define inf 0x3f3f3f3f
#define mod 1000000007
#define nmax 100010
using namespace std;
int n,t[110][110];
int main() {
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
scanf("%d",&t[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 && t[i][k]>0 && t[k][j]>0) {
if (t[i][j]==0 || t[i][j]>t[i][k]+t[k][j]) t[i][j]=t[i][k]+t[k][j];
}
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++) printf("%d ",t[i][j]);
printf("\n");
}
return 0;
}