#include <stdio.h>
#include <stdlib.h>
int isPrim(int n)
{
int i;
if(n <= 1)return 0;
for(i=2; i*i<=n; i++)
{
if(0 == n%i)return 0;
}
return 1;
}
int func(int n)
{
int count = 1,i;
if(n<2)
return 0;
printf("%d = ",n);
while(!isPrim(n))
{
for(i=2; i*i<=n; i++)
{
if(!isPrim(i) || n%i != 0)continue;
printf("%d * ",i);
count++;
n /= i;
break;
}
}
printf("%d\t",n);
return count;
}
int main(int argc, char *argv[])
{
int n = atoi(argv[1]),count;
count = func(n);
printf("\nTotal : %d\n",count);
return 0;
}
求一个数的质因素 因式分解
最新推荐文章于 2021-05-25 19:17:50 发布