fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int main(void){
  4.     int i,n,imax, maximum,minimum;
  5.     int *arr,sum;
  6.  
  7.     printf("N: ");
  8.     scanf("%d",&n);
  9.  
  10.     srand(time(NULL));
  11.     arr=(int*)calloc(n,sizeof(int));
  12.     imax=0;
  13.     for(i=0; i<n; i++)
  14.     {
  15.         arr[i]=rand()%21-10;
  16.         printf("%2d ",arr[i]);
  17.       // printf("array[%d]=",i);
  18.       //scanf("%lf",arr+i);
  19.        if(arr[imax]<arr[i]) imax=i;
  20.     }
  21.     printf("\nmax=%2d\n",arr[imax]);
  22.     printf("minimum a potom maximum: ");
  23.     scanf("%d%d",&minimum,&maximum);
  24.  
  25.     sum=0;
  26.     for(i=0; i<n; i++){
  27.         if(fabs(arr[i])>=minimum && fabs(arr[i])<=maximum)
  28.             sum += arr[i];
  29.         else arr[i] = 0;
  30.     }
  31.  
  32.     printf("Array after: \n");
  33.     for(i=0; i<n; i++){
  34.         printf("%2d ",arr[i]);
  35.     }
  36.  
  37.     printf("\nsum=%4d\n",sum);
  38.     free(arr);
  39.  
  40.     return 0;
  41. }
Success #stdin #stdout 0s 9424KB
comments (?)
stdin
copy 
5
2 5
stdout
copy 
N:  1 -5 -9  7 -7 
max= 7
minimum a potom maximum: Array after: 
 0 -5  0  0  0 
sum=  -5
https://ideone.com/bPWz3e
language:
C (gcc 8.3)
created:
4 years ago
visibility:
secret

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!