Advertisement
Guest User

Untitled

a guest
Mar 27th, 2017
43
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <malloc.h>
  3. #include <stdlib.h>
  4. #include <time.h>
  5.  
  6. int* kvadrirajPolje(int* polje, int n) {
  7. int* novoPolje = malloc(sizeof(int)*n);
  8. int* zauzeto = malloc(sizeof(int)*n);
  9. int i, rndIndex;
  10.  
  11. for (i = 0; i < n; i++) {
  12. zauzeto[i] = 0;
  13. }
  14.  
  15. srand((unsigned)time(NULL));
  16.  
  17. for (i = 0; i < n; i++) {
  18. do {
  19. rndIndex = rand() % n;
  20. } while (zauzeto[rndIndex]);
  21. novoPolje[rndIndex] = polje[i] * polje[i];
  22. zauzeto[rndIndex] = 1;
  23. }
  24.  
  25. free(zauzeto);
  26. return novoPolje;
  27. }
  28.  
  29. int main(void){
  30. int *p, *p2;
  31. int n, i, broj;
  32.  
  33. srand((unsigned)time(NULL));
  34. printf("Upisite broj clanova polja> ");
  35. scanf("%d", &n);
  36.  
  37. p = (int*)malloc(n*sizeof(int));
  38. for (i = 0; i < n; i++){
  39. scanf("%d", &broj);
  40. *(p + i) = broj;
  41. }
  42.  
  43. p2 = kvadrirajPolje(p, n);
  44.  
  45. for (i = 0; i < n; i++){
  46. printf("%d ", *(p2 + i));
  47. }
  48. free(p);
  49. free(p2);
  50. return 0;
  51.  
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement