#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <time.h>


/* this function findprime is used to check whehter a number is a prime number or not*/

int findprime(int k)
{  
   int i;
   int sqrtk = (int) sqrt(k);
   for (i=2;i<=sqrtk;i=i+1)  //check untile the sqrt(k)
   {	
	if ((k%i)==0) return 0;
   }
return 1;
}



/*this function prime() is used to store the prime number in array a*/

void prime(int n, int *a)
{
      int i=0,k=2;
      while(i<n)
      {
        if(findprime(k))
         {
           a[i]=k;
           i++;
         }
         if(k%2==1)  //in this if else, only check odd number whether it is a prime or not. 
             k=k+2;
         else 
             k++;
      }
}