Pagini recente » Cod sursa (job #1512831) | Cod sursa (job #2482150) | Cod sursa (job #965300) | Cod sursa (job #1255742) | Cod sursa (job #717091)
Cod sursa(job #717091)
#include <fstream>
#define N 110
#define INF 999999999
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,A[N][N],i,j,k;
void update(int k,int i,int j) {
if (A[i][k]<=0 || A[k][j]<=0 || i==j) return;
if (A[i][j]<=A[i][k]+A[k][j] && A[i][j]!=0) return;
A[i][j]=A[i][k]+A[k][j];
}
int main() {
f >> n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++) f >> A[i][j];
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
update(k,i,j);
for (i=1;i<=n;i++) {
for (j=1;j<=n;j++) g << A[i][j] << ' ';
g << '\n';
}
f.close();g.close();
return 0;
}