#pragma warning(disable:4996);
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<time.h>
#include<stdlib.h>
using namespace std;
const int maxn = 100010;
int prime[maxn], pnum=0;//用来存储质因子
bool p[maxn] = { 0 };
void findprime() {
for (int i = 2;i < maxn;i++) {
if (!p[maxn]) {
prime[pnum++] = i;
for (int j = i + i;j < maxn;j += i) {
p[j] = true;
}
}
}
}
struct factor {
int x, cnt;
}fac[10];
int main() {
int n;
findprime();
while (scanf("%d", &n) != EOF) {
int num = 0;
int sqr = int(sqrt(1.0 * n));
for (int i = 0;i < pnum && prime[i] <=sqr;i++) {//注意prime[i] <=sqr,小于可能有漏答案
//质因子要么全是小于sqrt(n),要么仅有一个大于,其余小于;
//查表,利用素数表里的数,来判断质因子,如果是,计入数组;
if (n % prime[i] == 0)
{
fac[num].x = prime[i];
fac[num].cnt = 0;
while (n % prime[i] == 0) {
fac[num].cnt++;
n /= prime[i];
}
num++;
}
if (n == 1) break;
}
if (n != 1) {
fac[num].x = n;
fac[num++].cnt = 1;
}
int count = 0;//记录总数
for (int i = 0;i < num;i++) {
count += fac[i].cnt;
}
printf("%d\n", count);
}
return 0;
}
问题 C: 质因数的个数
最新推荐文章于 2021-03-12 16:59:53 发布