User talk:Yoosofan

My code for k-almost-prime was more clear but less efficient, so I remove it. Here is my code

C

<lang c>int kprime(int n,int k){

 int p=2;
 while(p<=n) 
   if(n%p==0)
   {n/=p;k--;} 
   else p++;
 return !k;

}