Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- #include<time.h>
- #define MAX 15
- int najveci(int mat[MAX][MAX], int x, int y, int n, int m)
- {
- int max = mat[x][y];
- int maxi = x, maxj = y;
- int i, j;
- for (i = 0; i<n; i++)
- {
- if (mat[i][y]>max)
- maxi = i;
- }
- for (j = 0; j<m; j++)
- {
- if (mat[x][j]>max)
- maxj = j;
- }
- if (maxi == x&&maxj == y)
- return 1;
- else
- return 0;
- }
- main()
- {
- int n, m, i, j, izbor = 0;
- float a[MAX][MAX], top, bot;
- srand(time(NULL));
- while (1)
- {
- printf("\nUnesite broj redova matrice: ");
- scanf("%d", &n);
- if (n <= 0)break;
- printf("\nUnesite broj kolona matrice: ");
- scanf("%d", &m);
- if (m <= 0)break;
- printf("\n\nDa li zelite da popunite matricnu rucno(1) ili zelite da se popuni random brojevima(2)");
- printf("\n\nVas izbor: ");
- scanf("%d", &izbor);
- switch (izbor)
- {
- default: printf("\nMolim vas izaberite izmedju '1' i '2'\n"); break;
- case 1:
- for (i = 0; i < n; i++)
- for (j = 0; j < m; j++)
- {
- printf("\nUnesite element a[%d][%d]: ", i, j);
- scanf("%f", &a[i][j]);
- printf("\n");
- }
- printf("\nIzgled vase matrice je");
- printf("\n\n");
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < m; j++)
- printf("\t%.2f ", a[i][j]);
- printf("\n\n");
- }break;
- case 2:
- printf("\nUnesie donju granicu opsega random brojeva: ");
- scanf("%f", &bot);
- printf("\nUnesie gornju granicu opsega random brojeva: ");
- scanf("%f", &top);
- printf("\nIzgled vase matrice je");
- printf("\n\n");
- for (i = 0; i < n; i++)
- for (j = 0; j < m; j++)
- {
- a[i][j] = rand() / ((double)RAND_MAX)*(top - bot) + bot;
- }
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < m; j++)
- printf("\t%.2f ", a[i][j]);
- printf("\n\n");
- }break;
- }
- printf("\nNajveci elementi u svojoj vrsti i u svojoj koloni su:\n\n");
- for (i = 0; i<n; i++)
- {
- for (j = 0; j<n; j++)
- {
- if (najveci(a, i, j, n, n) == 1)
- printf("a[%d][%d]:\n\n", i, j);
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement