fork download
copy 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <time.h>
  4.  
  5. float rand_float (float *, float *);
  6. int rand_int (float *, float *);
  7. void min_max(float *, float *, float *, float *);
  8. int num_intero(float);
  9. void max_elem (int, float*);
  10.  
  11. int main () {
  12.     int n, i, t;
  13.     float x1, x2, *vett;
  14.  
  15.     printf ("array size:\t");
  16.     scanf ("%d", &n);
  17.  
  18.     vett = (float*)calloc(n, sizeof(float));
  19.     if(vett == NULL) {
  20.         printf("BUM\n" );
  21.         exit(0);
  22.     }
  23.  
  24.     printf("\ninterval extremes:\t");
  25.     scanf ("%f %f", &x1, &x2);
  26.  
  27.     do {
  28.         printf("1 for decimal random numbers, 2 for integers:\t");
  29.         scanf("%d", &t);
  30.     } while(t != 1 && t != 2);
  31.  
  32.     srand(time(NULL));
  33.     switch(t) {
  34.     case 1:
  35.         for(i = 0; i < n; i++) {
  36.             *(vett + i) = rand_float(&x1, &x2);
  37.             printf("%d__\t%10f\n", i, *(vett + i));
  38.         }
  39.         max_elem(n, vett);
  40.         break;
  41.  
  42.     case 2:
  43.         for(i = 0; i < n; i++) {
  44.             *(vett + i) = rand_int(&x1, &x2);
  45.             printf("%d__\t%10f\n", i, *(vett + i));
  46.         }
  47.         max_elem(n, vett);
  48.         break;
  49.     }
  50.  
  51.     free(vett);
  52.     return 0;
  53. }
  54.  
  55. void min_max(float* x1, float* x2, float* min, float* max) {
  56.     if(*x1 < *x2) {
  57.         *min = *x1;
  58.         *max = *x2;
  59.     }
  60.     else {
  61.         *min = *x2;
  62.         *max = *x1;
  63.     }
  64. }
  65.  
  66. float rand_float(float* x1, float* x2) {
  67.     float min, max;
  68.  
  69.     min_max(x1, x2, &min, &max);
  70.     return ((max - min) * (float)rand() / RAND_MAX) + min;
  71. }
  72.  
  73. int num_intero(float min) {
  74.     return ((min / (int)min) == 1) ? 1 : 0;
  75. }
  76.  
  77. int rand_int(float* x1, float* x2) {
  78.     float min, max;
  79.     min_max(x1, x2, &min, &max);
  80.  
  81.     if((int)min == (int)max) {
  82.         return (int)min;
  83.     }
  84.     else if(min == 0) {
  85.         return (rand() % ((int)(max) + 1));
  86.     }
  87.     else if(max == 0) {
  88.         return (rand() % ((int)(-min) + 1) + min);
  89.     }
  90.     else if((int)min != (int)max) {
  91.         if(num_intero(min) == 1)
  92.             return (rand() % ((int)(max - min) + 1) + min);
  93.         else if(num_intero(max) == 0)
  94.             return (rand() % ((int)(max - min)) + min + 1);
  95.         else
  96.             return (rand() % ((int)(max - min) + 1) + min + 1);
  97.     }
  98. }
  99.  
  100. void max_elem (int n, float* vett) {
  101.     int i=0, *pos, p = 0, n_ele_pos;
  102.     float max = *(vett);
  103.  
  104.     pos = (int*)malloc(n * sizeof(int));
  105.     if(pos == NULL) {
  106.         printf("BUM\n");
  107.         exit(0);
  108.     }
  109.  
  110.     *(pos) = 0;
  111.     for(i = 1; i < n; i++) {
  112.         if(*(vett + i) > max) {
  113.             max = *(vett + i);
  114.             p = 0;
  115.             *(pos) = i;
  116.         }
  117.         else if(*(vett + i) == max) {
  118.             p++;
  119.             *(pos + p) = i;
  120.         }
  121.     }
  122.  
  123.     if(p == 0) {
  124.         printf("\nmax element is %f, in position %d  ", max, *pos + 1);
  125.     }
  126.     else {
  127.         printf("\n max element %f, %d times in position\n", max, p + 1);
  128.         for(i = 0; i < p + 1; i++)
  129.             printf("%d  ", *(pos + i) + 1);
  130.     }
  131.  
  132.     printf("\n\n");
  133.     free(pos);
  134. }
Success #stdin #stdout 0s 10320KB
comments ()
stdin
copy 
6
1 3
2
stdout
copy 
array size:	
interval extremes:	1 for decimal random numbers, 2 for integers:	0__	  3.000000
1__	  3.000000
2__	  2.000000
3__	  1.000000
4__	  1.000000
5__	  1.000000

 max element 3.000000, 2 times in position
1  2
https://ideone.com/5Ti0UI
language:
C (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!