The number of divisors(约数) about Humble Numbers

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

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校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛

Recommend

很简单的题目。。

只要求得有多少个2，3，5，7

然后结果就是 (p2-1)*(p3-1)*(p5-1)*(p7-1)

#include<stdio.h>
int main()
{long long n;int p2,p3,p5,p7;while(scanf("%I64d",&n),n){p2=p3=p5=p7=0;while(n%2==0){n/=2;p2++;}    while(n%3==0){n/=3;p3++;}    while(n%5==0){n/=5;p5++;}    while(n%7==0){n/=7;p7++;}    printf("%d\n",(p2+1)*(p3+1)*(p5+1)*(p7+1));}    return 0;
}

HDU 1492 The number of divisors(约数) about Humble Numbers（数论，简单约数）相关推荐

HDU 1492 The number of divisors(约数) about Humble Numbers
The number of divisors(约数) about Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: ...
杭电1492 The number of divisors(约数) about Humble Numbers
The number of divisors(约数) about Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Lim ...
HDUOJ---The number of divisors(约数) about Humble Numbers
The number of divisors(约数) about Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Lim ...
HDU1492 The number of divisors(约数) about Humble Numbers【约数】
The number of divisors(约数) about Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Lim ...
HDU 3826 Squarefree number：题目解答源码
2019独角兽企业重金招聘Python工程师标准>>> HDU 3826 Squarefree number:题目解答源码 In mathematics,a squarefree n ...
第F题真约束之和（通解）古希腊数学家毕达哥拉斯在自然数研究中发现，220的所有真约数(即不是自身的约数)之和为： 1+2+4+5+10+11+20+22+44+55+110＝284
古希腊数学家毕达哥拉斯在自然数研究中发现,220的所有真约数(即不是自身的约数)之和为: 1+2+4+5+10+11+20+22+44+55+110＝284. 而284的所有真约数为1.2.4.71. ...
真约数求法 c语言,怎样求真约数
匿名用户 1级 2018-11-14 回答约数定义如果一个整数能被另一个整数整除,那么第二个整数就是第一个整数的约数.约数是有限的,一般用最大公约数. (在自然数的范围内) 6的约数有:1.2. ...
约数的一些定理——数论
算术基本定理: 又称为正整数的唯一分解定理,即:每个大于1的自然数,要么本身就是质数,要么可以写为2个或以上的质数的积,而且这些质因子按大小排列之后,写法仅有一种方式. 公式:A=(p1^k1 ...
【HDU】1005 Number Sequence （有点可爱）
http://acm.hdu.edu.cn/showproblem.php?pid=1005 A number sequence is defined as follows: f(1) = 1, f( ...

HDU 1492 The number of divisors(约数) about Humble Numbers（数论，简单约数）

The number of divisors(约数) about Humble Numbers

HDU 1492 The number of divisors(约数) about Humble Numbers（数论，简单约数）相关推荐

最新文章

热门文章