Pagini recente » Cod sursa (job #2653653) | Cod sursa (job #1019715) | Cod sursa (job #2826552) | Cod sursa (job #2304071) | Cod sursa (job #2289619)
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define N 101
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[N][N];
int main(){
int n,i,j,k;
in>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
in>>a[i][j];
for(k=1; k<=n; ++k){
for(i=1; i<=n; ++i){
for(j=1; j<=n; ++j){
if(a[i][k] && a[k][j] && i!=j)
if(!a[i][j])
a[i][j]=a[i][k]+a[k][j];
else
a[i][j]=min(a[i][j], a[i][k]+a[k][j]);
}
}
}
for(i=1; i<=n; ++i){
for(j=1; j<=n; ++j)
out<<a[i][j]<<" ";
out<<"\n";
}
return 0;
}