HDOJ1058 Humble Numbers丑数的问题
来源:互联网 发布:小颖java源代码反编译 编辑:程序博客网 时间:2024/04/28 02:11
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24222 Accepted Submission(s): 10610
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.
Write a program to find and print the nth element in this sequence
Write a program to find and print the nth element in this sequence
Input
The input consists of one or more test cases. Each test case consists of one integer n with 1 <= n <= 5842. Input is terminated by a value of zero (0) for n.
Output
For each test case, print one line saying "The nth humble number is number.". Depending on the value of n, the correct suffix "st", "nd", "rd", or "th" for the ordinal number nth has to be used like it is shown in the sample output.
Sample Input
1234111213212223100100058420
(n>i,j,k,m)
特别的:
i,j,k,m 只有在本项被选中后才移动
ijkm的数值表示 在第该数值的答案是由ijkm个对应因素乘过的数字。
Sample Output
The 1st humble#include<stdio.h>#include<math.h>#include<algorithm>using namespace std;int ugly[5842];int Min(int a,int b,int c,int d){int temp=(a<b?a:b);temp= (temp<c?temp:c);return (temp<d?temp:d);}int main(){int N;ugly[0]=1;int index2=0;int index3=0;int index5=0;int index7=0;int index=1;while(index<5842){int val=Min(ugly[index2]*2,ugly[index3]*3,ugly[index5]*5,ugly[index7]*7);if(val==ugly[index2]*2)index2++;if(val==ugly[index3]*3)index3++;if(val==ugly[index5]*5)index5++;if(val==ugly[index7]*7)index7++;ugly[index++]=val;}while(scanf("%d",&N)&&N!=0){if(N % 10 == 1 && N % 100 != 11)printf("The %dst humble number is %d.\n",N,ugly[N-1]);else if(N % 10 == 2 && N % 100 != 12)printf("The %dnd humble number is %d.\n",N,ugly[N-1]);else if(N % 10 == 3 && N % 100 != 13)printf("The %drd humble number is %d.\n",N,ugly[N-1]);else printf("The %dth humble number is %d.\n",N,ugly[N-1]);}return 0;}
number is 1.The 2nd humble number is 2.The 3rd humble number is 3.The 4th humble number is 4.The 11th humble number is 12.The 12th humble number is 14.The 13th humble number is 15.The 21st humble number is 28.The 22nd humble number is 30.The 23rd humble number is 32.The 100th humble number is 450.The 1000th humble number is 385875.The 5842nd humble number is 2000000000.
0 0
- HDOJ1058 Humble Numbers丑数的问题
- Humble Numbers 丑数
- hdoj1058 Humble Numbers (排序)
- HDOJ1058 Humble Numbers
- Humble Numbers(hdoj1058)
- Humble Numbers(丑数)
- USACO : Humble Numbers (丑数)
- HDOJ 1058:Humble Numbers 寻找丑数问题 解题报告
- 寻找丑数问题 HDOJ 1058 Humble Numbers
- HDU 1058 Humble Numbers (动规+寻找丑数问题)
- 丑数问题 hdu— — Humble Numbers
- hdoj1058 Humble Numbers ( set 水)
- hdoj1058 Humble Numbers(值得注意的简单题)
- zoj 1095 Humble Numbers(丑数+dp)
- hdu 1058 Humble Numbers【丑数】
- USACO 3.1.3 Humble Numbers 丑数
- HDU 丑数 - 1058 Humble Numbers
- 堆----【USACO3.1.3】Humble Numbers丑数
- C++中交换指针的问题
- 第九周项目3——稀疏矩阵的三元组表示的实现及应用(2)
- ReactiveCocoa之简介(一)
- 超级好用的流程图js框架
- php excel 表格导入
- HDOJ1058 Humble Numbers丑数的问题
- Excel VBA利用Transform函数+SQL交叉汇总数据
- coreseek安装及使用
- 梯度下降算法
- 51nod 1682 打标记
- 3. React 组件生命周期介绍
- Python 进阶_OOP 面向对象编程_self 的实例绑定
- centos 7 安装reids-3.0.0
- UVALive 7148 LRIP