#include <stdio.h>
// Histogram with maximum value of MAX
// we have to create enough bins for MAX+1
//For example, max = 18, needs 19 locations
//if 6 bins celing(19/6)
//0 --> 3
//4 --> 7
//8 --> 11
//12 --> 15
//16 --> 19
void main() {
    int ar[200], b[50], a[50], c[50];
    int i,j,k;
    int MAX, N, NN, num;
    for(i=0;i<50;i++) c[i]=0;

    printf("Enter Number of bins  ");
    scanf("%d",&N);
    printf("Enter the data \n");
    i=0;
    for(i=0; i<N; i++) {c[i]=0;}
    i=0;
    while(scanf("%d",&ar[i]) != EOF) i++;
    NN=i;  // number of data point
    MAX=ar[0]; for(i=0;i<NN;i++) {if (ar[i]> MAX) MAX=ar[i];}  // MAX number
    printf("MAX=%d\n",MAX);
    num=(MAX+1)/N;  if ((MAX+1) != N*num) num++; //num is number of elemnts per bin first 0-->num-1
    printf("num = %d\n",num);
    a[0]=0; b[0]=num-1;
    for(i=1; i<N; i++) {a[i]=a[i-1]+num; b[i]=b[i-1]+num;}
    //for(i=0; i<N; i++) b[i]=a[i]+num-1; b[N-1]=MAX;
    printf("--------------\n");
    for (i=0; i<N; i++) printf("[%3d:%3d]\n", a[i],b[i]);
    printf("STARTING COMPUTATIONS\n");



    for(i=0; i<NN; i++){
      for(j=0; j<N; j++) {
            printf("Comparing   %d   %d   %d  \n",a[j], ar[i], b[j]);
        //if( (ar[i]>= a[j]) &&(ar[i]<=b[j])) {c[ar[i]/a[j]++; printf("stored %d in %d\n", ar[i], ar[i]/a[j]);break;}
        if( (ar[i]>= a[j]) &&(ar[i]<=b[j])) {c[ar[i]/num]++; printf("stored %d in %d\n", ar[i], ar[i]/num);break;}
         }
    }
    printf("--------------\n");
    for (i=0; i<N; i++) printf("[%-3d:%-3d]:  %3d\n", a[i],b[i],c[i]);
    }