The number of divisors(约数) about Humble Numbers[HDU1492]
The number of divisors(约数) about Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2044 Accepted Submission(s): 1006
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
LL
#include<stdio.h>
int main()
{
__int64 n,p1,p2,p3,p4;
while (scanf("%I64d",&n)!=EOF)
{
if (n==) return ;
p1=p2=p3=p4=;
while (n && n%==)
{
p1++;
n/=;
}
while (n && n%==)
{
p2++;
n/=;
}
while (n && n%==)
{
p3++;
n/=;
}
while (n && n%==)
{
p4++;
n/=;
}
printf("%I64d\n",p1*p2*p3*p4);
}
return ;
}
最新文章
- 64位下pwntools中dynELF函数的使用
- JavaScript学习笔记-对象
- 什么是 A 轮融资?有 B轮 C轮么?
- IntelliJ IDEA 使用总结
- Python 列表
- [转载]: delphi中XLSReadWrite控件的使用(3)---基本应用
- Python之添加新元素
- 采用openFileOutput获取输出流
- Python自动化开发-变量、数据类型和运算
- JaveScript变量的简介及其变量的简单使用(JS知识点归纳一)
- KMP 算法 C++
- 单元测试系列:Mock工具Jmockit使用介绍
- QT—QTextEdit控件显示日志
- java不同的包下相同的类名的问题与解决办法
- centos7忘记root密码重置
- linux下安装tomcat和jdk
- 用网站(WebSite而不是WebProject)项目构建ASP.NET MVC网站
- 面对30页左右的运放数据手册datasheet,你需要知道如何看懂
- kerberos中的spn详解
- [Scala]Scala学习笔记四 类