hdu1492 The number of divisors(约数) about Humble Numbers

最新推荐文章于 2020-04-22 15:55:55 发布

「已注销」

最新推荐文章于 2020-04-22 15:55:55 发布

阅读量1k

点赞数

分类专栏： C++ 文章标签： C++

本文链接：https://blog.csdn.net/Ni9htMar3/article/details/70495524

版权

C++ 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

question

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

分析

先求出`Humble number=2^a3^b5^c7^d`,然后结果为`ans=(a+1)(b+1)(c+1)(d+1)`;

代码

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main()
{
    __int64 n;
    int map[4]={2,3,5,7};

    while(cin>>n && n)
    {
        int i,j=0;
        __int64 res=1;
        for(i = 0; i < 4; i++)
        {
            __int64 num=n;
            j = 0;
            while(num>0)
            {
                if(num % map[i] == 0)
                {
                    j++;
                    num /= map[i];
                }
                else
                {
                    break;
                }
            }
            res *= (j+1);
        }
        cout<<res<<endl;
    }
    return 0;
}