标签：
The number of divisors(约数) about Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3033 Accepted Submission(s):
1465
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
Sample Output
3
6
1 #include <cstdio>
2 #include <iostream>
3 using namespace std;
4 int main()
5 {
6 long long n;
7 while(cin>>n&&n)
8 {
9 long long a[4]={1,1,1,1};
10 int b[4]={2,3,5,7},i;
11 for(i=0;i<4;i++)
12 {
13 while(n%b[i]==0)
14 {
15 a[i]++;
16 n=n/b[i];
17 }
18 }
19 cout<<a[0]*a[1]*a[2]*a[3]<<endl;
20 }
21 }
The number of divisors(约数) about Humble Numbers
标签：
原文地址：http://www.cnblogs.com/a1225234/p/4691370.html
