ACM 数论 hdu 1492 The number of divisors(约数) about Humble Numbers

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

4120

 

Sample Output

36

 

Author

lcy

 

#include<iostream>  
#include<cstring>  
#include<algorithm>  
#include<cstdio>  
#include<cmath>  
  
using namespace std;  
  
#define LL long long   
int main()  
{  
    LL n ;  
    int a , b , c , d ;  
  
    while( cin >> n  , n )  
    {     
        a = b = c = d = 1 ;   
        while( n != 1 )  
        {  
            while( n % 2 == 0 )  
            {  
                n /= 2 ;  
                a++ ;   
            }  
                  
            while( n % 3 == 0 )  
            {  
                n /= 3 ;  
                b++ ;  
            }  
            while(n % 5 == 0 )  
            {  
                n /= 5 ;   
                c++ ;   
            }  
            while( n % 7 == 0 )  
            {  
                n /= 7 ;  
                d++ ;  
            }         
        }  
        cout << ( a * b * c * d ) << endl ;  
    }  
    return 0 ;  
}