Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <malloc.h>
- #include <stdlib.h>
- #include <time.h>
- int* kvadrirajPolje(int* polje, int n) {
- int* novoPolje = malloc(sizeof(int)*n);
- int* zauzeto = malloc(sizeof(int)*n);
- int i, rndIndex;
- for (i = 0; i < n; i++) {
- zauzeto[i] = 0;
- }
- srand((unsigned)time(NULL));
- for (i = 0; i < n; i++) {
- do {
- rndIndex = rand() % n;
- } while (zauzeto[rndIndex]);
- novoPolje[rndIndex] = polje[i] * polje[i];
- zauzeto[rndIndex] = 1;
- }
- free(zauzeto);
- return novoPolje;
- }
- int main(void){
- int *p, *p2;
- int n, i, broj;
- srand((unsigned)time(NULL));
- printf("Upisite broj clanova polja> ");
- scanf("%d", &n);
- p = (int*)malloc(n*sizeof(int));
- for (i = 0; i < n; i++){
- scanf("%d", &broj);
- *(p + i) = broj;
- }
- p2 = kvadrirajPolje(p, n);
- for (i = 0; i < n; i++){
- printf("%d ", *(p2 + i));
- }
- free(p);
- free(p2);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement