1947: 质因数的个数
时间限制: 1 Sec 内存限制: 32 MB
献花: 60 解决: 39
[献花][花圈][TK题库]
题目描述
求正整数N(N>1)的质因数的个数。
相同的质因数需要重复计算。如120=2*2*2*3*5,共有5个质因数。
输入
可能有多组测试数据,每组测试数据的输入是一个正整数N,(1
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <fstream>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
const int MaxN = 100001;
int Prime[MaxN] , PN = 0 ,FN = 0;
bool Nop[MaxN] = { 0 };
struct Factor
{
int num;
int c;
}Fact[100] = { 0 };
void GetPrimeTable(int n)
{
for (int i = 2; i < MaxN; ++i)
{
if (!Nop[i])
{
Prime[PN++] = i;
if (PN >= n)break;
for (int j = 2 * i; j < MaxN; j += i)//倍数关系,因此直接到2 * i即可
{
if (j % i == 0)
{
Nop[j] = true;
}
}
}
}
}
int main()
{
#ifdef _DEBUG
freopen("data.txt", "r+", stdin);
#endif // _DEBUG
int Num;
int i,c = 0;
double sqr;
GetPrimeTable(100);
while (EOF != scanf("%d",&Num))
{
c = 0;
sqr = sqrt(Num);
FN = 0;
memset(Fact, 0, sizeof(Factor) * 100);
for (i = 0; i < PN && Prime[i] <= sqr && Num != 1; ++i)
{
if (Num % Prime[i] == 0)
{
Fact[FN].c = 1;
Fact[FN].num = Prime[i];
Num /= Prime[i];
while (Num % Prime[i] == 0)
{
Num /= Prime[i];
Fact[FN].c += 1;
}
++FN;
}
}
if (Num != 1)
{
Fact[FN].num = Num;
Fact[FN++].c = 1;
}
for (int i = 0; i < FN; ++i)
{
c += Fact[i].c;
}
printf("%d\n", c);
}
return 0;
}
/**************************************************************
Problem: 1947
User: Sharwen
Language: C++
Result: 升仙
Time:4 ms
Memory:2220 kb
****************************************************************/