The number of divisors(约数) about Humble Numbers

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

题意：求质因子只有2，3，5，7的整数有多少个约数，显然用唯一分解定律。

题解：唯一分解定理：算术基本定理可表述为 任何一个大于1的自然数 N,如果N不为质数，那么N可以唯一分解成有限个质数的乘积。 n=p1^a1 *  p2^a2 . . .*pn^an，数n的因子个数：（1+a1）*(1+a2)*(1+a3)*(1+a4)......*(1+an)。现在题意告诉我们，这个数的质因子只有2，3，5，7，因此找出a1,a2,a3,..就可以了。

代码如下：

Select Code

#include<stdio.h>
int main()
{
    long long n;
    while(scanf("%lld",&n)&&n)
    {
        long long a,b,c,d;
        for(a=0;n%2==0;n/=2)
            a++;
        for(b=0;n%3==0;n/=3)
            b++;
        for(c=0;n%5==0;n/=5)
            c++;
        for(d=0;n%7==0;n/=7)
            d++;
        printf("%lld\n",(1+a)*(1+b)*(1+c)*(1+d));
    }
    return 0;
}