User talk:Yoosofan: Difference between revisions
Content added Content deleted
mNo edit summary |
No edit summary |
||
Line 1:
My code for [[Almost prime|k-
=={{header|C}}==
<lang c>int kprime(int n,int k){
|
Revision as of 18:45, 16 January 2015
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;
}