// counts distinct values in array
// wdg 2008
#include <stdio.h>

int main(void) 
{
  
   const int COUNT = 100;
   int A[COUNT];

   // for testing purposes fill strangely
   int i;
   for(i=0; i<COUNT; i++) 
       A[ i ] = (i*i) % (COUNT+1) + 1;

   // counting distinct elements
   // increment counter if element differs from those before it
   int j,k;
   int different=0;
   for(j=0; j<COUNT; j++) {
     int isFirst = 1; 
     for(k=0; k<j; k++) {
        if( A[k] == A[j]) 
           isFirst = 0;
     }
     if( isFirst ) 
        different++;
  }

  // for testing purposes only
  // should be COUNT/2+1 if COUNT+1 is a prime 
  printf("Different are %d\n", different);

  return 0;

}