【HDU-1058】Humble Numbers 丑数
来源:互联网 发布:java图形界面时间控件 编辑:程序博客网 时间:2024/04/30 15:19
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
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
1
2
3
4
11
12
13
21
22
23
100
1000
5842
0
Sample Output
The 1st humble 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.
题目大意
求1~5842之间除了2,3,5,7之外不能被其它 素数 整除的数
思路
dp问题,满足条件的数都可以被拆分成2,3,5,7的乘积,状态转移方程:
dp[i]=min(dp[a]*2,min(dp[b]*3,min(dp[c]*5,dp[d]*7)));
当n%10==1并且n%100!=11时,输出时要输出”st”;
当n%10==2并且n%100!=12时,输出时要输出”nd”
当n%10==3并且n%100!=13时,输出时要输出”rd”
代码
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=6000;int dp[maxn],n;int min(int a,int b){ if(a<b)return a; else return b;}int main(){ dp[1]=1; int a,b,c,d; a=b=c=d=1; for(int i=2;i<=5842;i++) { dp[i]=min(dp[a]*2,min(dp[b]*3,min(dp[c]*5,dp[d]*7))); if(dp[i]==dp[a]*2) a++; if(dp[i]==dp[b]*3) b++; if(dp[i]==dp[c]*5) c++; if(dp[i]==dp[d]*7) d++; } while(~scanf("%d",&n)&&n) { if(n%10==1&&n%100!=11) {printf("The %dst humble number is %d.\n",n,dp[n]);continue;} if(n%10==2&&n%100!=12) {printf("The %dnd humble number is %d.\n",n,dp[n]);continue;} if(n%10==3&&n%100!=13) {printf("The %drd humble number is %d.\n",n,dp[n]);continue;} printf("The %dth humble number is %d.\n",n,dp[n]); } return 0;}
- hdu 1058 Humble Numbers【丑数】
- HDU 丑数 - 1058 Humble Numbers
- 【HDU-1058】Humble Numbers 丑数
- hdu 1058 Humble Numbers 丑数
- HDU 1058 Humble Numbers (动规+寻找丑数问题)
- HDU 1058 Humble Numbers && NOJ 1420 丑数 (数位dp)
- HDU 1058 Humble Numbers(丑数,优先队列,STL)
- Humble Numbers 丑数
- Humble Numbers(丑数)
- USACO : Humble Numbers (丑数)
- 丑数问题 hdu— — Humble Numbers
- hdu 1058 Humble Numbers 丑数(set,优先队列应用)
- HDOJ 1058:Humble Numbers 寻找丑数问题 解题报告
- 寻找丑数问题 HDOJ 1058 Humble Numbers
- HDOJ题目1058Humble Numbers(数学,丑数)
- zoj 1095 Humble Numbers(丑数+dp)
- USACO 3.1.3 Humble Numbers 丑数
- 堆----【USACO3.1.3】Humble Numbers丑数
- LeetCode 54 - Spiral Matrix
- Face Alignment by 3000 FPS系列学习总结(一)
- <LeetCode OJ> 73. Set Matrix Zeroes
- android学习之基础一android事件处理机制
- Edittext ---Android
- 【HDU-1058】Humble Numbers 丑数
- hdoj 1027 Ignatius and the Princess II
- 辞职申请
- HDU 5637 Transform
- Source Insight的安装及使用
- Android从网上获取图片的简单示例
- Struts2入门示例教程
- 写String类的普通构造函数,析构函数,拷贝构造函数和赋值函数
- 同一个类不同对象,可以互相访问对方的私有成员而不通过get()或set()