//Bo Zhang
//Homwork 8
//Count B

#include "header.h"

long int CharVect[256][256];				//sets away enough space for 256^2 characters
unsigned char   uc[NMax+1];  

int main(void)
{
 
  clock_t	start, stop;
  unsigned char c,d;					//declates char as unsigned to avoid segmentation error
  char	Format[20];
  int m=0,n=0,i,w;

  start = clock();

  scanf("%c",&c);					//scans the first character


  while((w=ScanFunc(n))!=0)				//scans file for batches of characters, if none is found, 0 should be returns ending the loop
  { 
    for(i=0;i<w;i++)	// Skips zeroth value - already in d
    {
      d = uc[i];
      CharVect[(int)(c)][(int)(d)]=CharVect[(int)(c)][(int)(d)]+1;//adds 1 to the part of the matrix storing value for the found character
      c = d;
    } 
  }


  while(m<(NOut))					//simple sort that goes through every element of the matrix and picks out the largest one
    {
     
     FindLargest();  
      m++;
     }
  stop=clock();

  printf("\nElapsed time = %g Seconds\n", (stop-start)/((float) CLOCKS_PER_SEC));

return 0;
}