HDU 1492 The number of divisors(约数) about Humble Numbers

The number of divisors(约数) about Humble Numbers

http://acm.hdu.edu.cn/showproblem.php?pid=1492

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1780    Accepted Submission(s): 871

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

 

Author

lcy

 

Source

“2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛

 

 

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;

int a[4]={2,3,5,7},b[4];
long long n;

int main(){

    //freopen("input.txt","r",stdin);

    while(~scanf("%I64d",&n) && n){      //在行电用%lld提交WA了。。。。。。。。。
        for(int i=0;i<4;i++){
            b[i]=0;
            while(n%a[i]==0){
                b[i]++;
                n/=a[i];
            }
        }
        int ans=(b[0]+1)*(b[1]+1)*(b[2]+1)*(b[3]+1);    //乘法计数原理(想想排列组合，某个数选或者不选）
        printf("%d\n",ans);
    }
    return 0;
}