User talk:Yoosofan: Difference between revisions
Content added Content deleted
No edit summary |
m (the page appears among the C tasks) |
||
| Line 1: | Line 1: | ||
My code for [[Almost prime|k-Almost-prime]] was more clear but less efficient, so I remove it. Here is my code |
My code for [[Almost prime|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){ |
<lang c>int kprime(int n,int k){ |
||
int p=2; |
int p=2; |
||
Latest revision as of 16:21, 19 November 2017
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;
}