#include <stdio.h>#include <stdlib.h>#define N 5int findMin(int a[][N], int k);int main(int argv,char **argc){ FILE *fmatrix; int a[N][N]; int b[N][N]; int c[N]; int i,j,min; fmatrix = fopen(argc[1], "r"); if (fmatrix == NULL) { printf("Can't read %s", argc[1]); return 1; } else { // diavazei ton katw trigwniko pinaka apo to arxeio while (!feof(fmatrix)) { for (i = 0; i < N; i++) { for (j = 0; j < i+1; j++) { fscanf(fmatrix, "%d", &a[i][j]); } } } } for (i = 0; i < N; i++) { // "anoigei" ton pinaka metatrepontas ton apo anw trigwniko se tetragwniko for (j = 0; j < N; j++) { a[i][j] = a[j][i]; } } for (i = 0; i < N; i++) { // typwnei ton pinaka for (j = 0; j < N; j++) { printf("%d\t", a[i][j]); } printf("\n"); } printf("\n"); for (i = 0; i < N; i++) printf("%d\n", findMin(a,i));}int findMin(int a[][N], int k){ int i,j; int min = a[0][0]; for (j = 1; j < N; j++) { if ((a[k][j] < min) && (a[j][k] != 0)) min = a[j][k]; } return min;}