hdu 1492 约数个数定理

Problem Description
A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, … shows the first 20 humble numbers.

Now given a humble number, please write a program to calculate the number of divisors about this humble number.For examle, 4 is a humble,and it have 3 divisors(1,2,4);12 have 6 divisors.

Input
The input consists of multiple test cases. Each test case consists of one humble number n,and n is in the range of 64-bits signed integer. Input is terminated by a value of zero for n.

Output
For each test case, output its divisor number, one line per case.

Sample Input
4
12
0

Sample Output
3
6

题解：

紫书P321算法。
对于一个大于1正整数n可以分解质因数：n=p1^a1×p2^a2×p3^a3*…*pk^ak。
则n的正约数的个数就是(a1+1)(a2+1)(a3+1)…(ak+1)

代码：

#include <iostream>

using namespace std;
typedef long long LL;
int main()
{
    LL n;
    while(cin>>n&&n)
    {
        int a[4]={2,3,5,7};
        int count[4]={0,0,0,0};
        for(int i=0;i<4;i++)
        {
            while(n%a[i]==0)
            {
                count[i]++;
                n/=a[i];
            }
        }
        LL ans=1;
        for(int i=0;i<4;i++)
              ans*=(count[i]+1);
        cout<<ans<<endl;
    }
    return 0;
}