3004
来源:互联网 发布:模拟城市5 for mac 编辑:程序博客网 时间:2024/05/12 19:04
3004
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. <br><br>Write a program to find and print the nth element in this sequence<br>
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.<br>
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.<br>
Sample Input
1234111213212223100100058420
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.
题意:
按顺序输出因子只有2,3,7,5的数
思路:
肯定是动态规划问题,动态转移方程为:F(n)=min(F(i)*2,F(j)*3,F(k)*5,F(m)*7),i,j,k,m,只有在被选中后才移动
AC代码:
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 5843;
int humber[maxn];
void prepare() {
int i;
humber[1] = 1;
int na;
int nb;
int nc;
int nd;
int pos1 = 1;
int pos2 = 1;
int pos3 = 1;
int pos4 = 1;
for (i = 2; i <= maxn; ++i) {
//从符合要求的数中找到最小的那个数作为目前humber数
humber[i] = min(min(na = humber[pos1] * 2,nb = humber[pos2] * 3),
min(nc = humber[pos3] * 5, nd = humber[pos4] * 7));
if (humber[i] == na) {//如果选择了这个因子,则将起索引向后移一位
pos1++;
}
if (humber[i] == nb) {
pos2++;
}
if (humber[i] == nc) {
pos3++;
}
if(humber[i] == nd){
pos4++;
}
}
}
int main() {
prepare();
int n;
while (scanf("%d", &n) != EOF, n) {
printf("The %d",n);
if (n % 100 != 11 && n % 10 == 1){
printf("st");
}else if (n % 100 != 12 && n % 10 == 2){
printf("nd");
}else if (n % 100 != 13 && n % 10 == 3){
printf("rd");
}else{
printf("th");
}
printf(" humble number is %d.\n",humber[n]);
}
return 0;
}
#include<algorithm>
using namespace std;
const int maxn = 5843;
int humber[maxn];
void prepare() {
int i;
humber[1] = 1;
int na;
int nb;
int nc;
int nd;
int pos1 = 1;
int pos2 = 1;
int pos3 = 1;
int pos4 = 1;
for (i = 2; i <= maxn; ++i) {
//从符合要求的数中找到最小的那个数作为目前humber数
humber[i] = min(min(na = humber[pos1] * 2,nb = humber[pos2] * 3),
min(nc = humber[pos3] * 5, nd = humber[pos4] * 7));
if (humber[i] == na) {//如果选择了这个因子,则将起索引向后移一位
pos1++;
}
if (humber[i] == nb) {
pos2++;
}
if (humber[i] == nc) {
pos3++;
}
if(humber[i] == nd){
pos4++;
}
}
}
int main() {
prepare();
int n;
while (scanf("%d", &n) != EOF, n) {
printf("The %d",n);
if (n % 100 != 11 && n % 10 == 1){
printf("st");
}else if (n % 100 != 12 && n % 10 == 2){
printf("nd");
}else if (n % 100 != 13 && n % 10 == 3){
printf("rd");
}else{
printf("th");
}
printf(" humble number is %d.\n",humber[n]);
}
return 0;
}
0 0
- 3004
- HDU 3004 the chess
- 【bzoj 3004】: 吊灯
- 【3004】循环数
- BZOJ 3004 吊灯
- BZOJ 3004 吊灯 树形DP
- POJ 3004 Subway planning 笔记
- HDU 3004 the chess 【bfs模拟】
- 宏碁Aspire 3004wlci - 快速回顾
- 宏碁Aspire 3004wlci - 快速回顾
- POJ 3004 && HDU 1922 Subway planning
- SDUT 3004-盒子游戏(博弈)
- 【hadoop】 3004-hadoop序列化机制思想
- AIX修改密码报错3004-314
- codevs 3004 我是世界之王
- CODEVS 3004 我是世界之王
- 问题1、3004-505 Cannot set process environment.
- hdu 3004 不错的搜索题(广搜)
- SVN 错误:Error validating server certificate for 'https://xxxxxxx':443... Mac os svn客户端证书验证缓存 解决
- 继承和多态
- C#之二十一 创建MDI应用程序和组件开发
- IO管理二IORESOURCE_IO和IORESOURCE_MEM
- ring0下cr0的作用
- 3004
- 物联网:以物为本还是以人为本?
- C语言位运算
- 数据库触发器的使用范例
- SSDT Hook实现内核级的进程保护
- redis
- Activiti工作流引擎数据库表结构
- OC怪异bug总结
- 对话框