Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int main()
- {
- int m,n,i,j,mat[99][99],br=0,suma=0;
- // unos dimenzija matrice
- printf("Unesi dimenzije matrice!");
- for (;;)
- {
- printf ("\nBroj redova: ");
- scanf ("%d", &m);
- printf ("Broj kolona: ");
- scanf ("%d", &n);
- int x = m, y = n;
- if (m < 1 || m > 100 || n < 1 || n > 100 || m != x || n != y)
- {
- printf ("\nGreska, pokusajte ponovo.\n");
- continue; // u slucaju greske, preskace break i vraca se na ponovni unos
- }
- break; // prekida se petlja ako je unos ispravan
- }
- // unos elemenata matrice
- printf ("\nUnesi elemente matrice:\n");
- for (i=0; i<m; i++)
- for (j=0; j<n; j++)
- {
- printf ("Element [%d][%d]: ", i,j);
- scanf ("%d", &mat[i][j]);
- }
- int min = mat[0][0], max = mat[0][0],red_min=0,red_max=0;
- // nalazenje minimuma i maksimuma
- for(i=0; i<m; i++)
- {
- int min_red = mat[i][0], max_red = mat[i][0];
- for (j=0; j<n; j++)
- {
- if (mat[i][j] < min_red) min_red = mat[i][j];
- if (mat[i][j] > max_red) max_red = mat[i][j];
- }
- if (min_red < min)
- {
- min = min_red;
- red_min = i;
- }
- if (max_red > max)
- {
- max = max_red;
- red_max = i;
- }
- }
- // provjera
- printf ("\nNajmanji element je %d u %d. redu , maksimalni je %d u %d. redu.\n", min, red_min+1, max, red_max+1);
- if (red_min == red_max)
- {
- printf ("\nNajmanji i najveci element se nalaze u istom redu.\n");
- return 0;
- }
- else
- {
- // zamjena redova
- for (i=0; i<m; i++)
- for (j=0; j<n; j++)
- if (i == red_min)
- {
- int temp = mat[i][j];
- mat[i][j] = mat[red_max][j];
- mat[red_max][j] = temp;
- }
- }
- //provjera, ispis matrice
- for (i=0; i<m; i++)
- {
- for (j=0; j<n; j++)
- printf ("%d ", mat[i][j]);
- printf ("\n");
- }
- printf ("\n");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement