The number of divisors(约数) about Humble Numbers

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

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

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

Recommend

分解质因数

 1 //http://acm.hdu.edu.cn/showproblem.php?pid=1492
 2 #include<iostream>
 3 #include<cstdio>
 4 using namespace std;
 5 int main()
 6 {
 7     _int64 i,n,c1,c2,c3,c4;
 8
 9     while(scanf("%I64d",&n),n)
10     {
11         for(c1=1,i=n;i%2==0&&i!=0;i/=2)
12                    c1++;
13         for(c2=1,i=n;i%3==0&&i!=0;i/=3)
14                     c2++;
15         for(c3=1,i=n;i%5==0&&i!=0;i/=5)
16                     c3++;
17          for(c4=1,i=n;i%7==0&&i!=0;i/=7)
18                     c4++;
19         printf("%I64d\n",c1*c2*c3*c4);
20     }
21 return 0;
22 }

View Code

HDUOJ---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 Lim ...
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 ...
HDU1492 The number of divisors(约数) about Humble Numbers【约数】
The number of divisors(约数) about Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Lim ...
图论 + 数论 ---- CF1325E E. Ehab‘s REAL Number Theory Problem (约数个数 + 枚举 + bfs找最小环)[从图结构优化搜索]
题目链接题目大意: 给你nnn个数,每个数保证约数个数不超过777个.问你从中选出若干个数的乘积是完全平方数,最少要选择多少个数?,不存在输出-1. 题目思路: 1.每个数约数不超过7个→\rig ...
poj 2247 Humble Numbers
Humble Numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9453 Accepted: 4440 题目 ...
HDU1058 Humble Numbers
题目:Humble Numbers humble number从1为"始祖",剩下的所有数,其实都是在此基础上乘以2,3,5,7演化出来的,代码主要语句:f[t]=min(2*f[ ...
NUC1077 Humble Numbers【数学计算+打表】
Humble Numbers 时间限制: 1000ms 内存限制: 65536KB 通过次数: 1总提交次数: 1 问题描述 A number whose only prime factors are ...
NUC1077 Humble Numbers【数学计算+打表+水题】
Humble Numbers 时间限制: 1000ms 内存限制: 65536KB 通过次数: 1总提交次数: 1 问题描述 A number whose only prime factors are ...

HDUOJ---The number of divisors(约数) about Humble Numbers

The number of divisors(约数) about Humble Numbers

HDUOJ---The number of divisors(约数) about Humble Numbers相关推荐

最新文章

热门文章