Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8472 Accepted Submission(s): 3684
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.
Source
HDU1058
今天课多,连晚上也有,刚好看到水题一道,拿来凑数,可纠结的是竟然Wrong Answer!后来才发现原来是我英文水平有待提高,不仅是11,12,13后面是加th的,任何以11,12,13结尾的数字后面都是加th,而非st,nd跟rd。
思路跟[ACM_ZJUT_1089]Ugly Numbers基本一模一样,动态规划,不多讲。
代码如下(时间很晚了,明天有早课,所以没怎么优化,可能难看了点):
#include<stdio.h>
#include<vector>
#include<cmath>
using namespace std;
//_hdu_1058
int main(){
int n = 5842, m;
vector<int> v;
int x2 = 0, x3 = 0, x5 = 0, x7 = 0;
char s[4][3] = {"th", "st", "nd", "rd"};
v.push_back(1);
while(--n){
int r2 = v[x2] * 2;
int r3 = v[x3] * 3;
int r5 = v[x5] * 5;
int r7 = v[x7] * 7;
m = min(r2, r3);
m = min(m, r5);
m = min(m, r7);
v.push_back(m);
if(r2 == m)
++x2;
if(r3 == m)
++x3;
if(r5 == m)
++x5;
if(r7 == m)
++x7;
}
while(scanf("%d", &n) && n){
printf("The %d%s humble number is %d.\n", n, (n % 10 < 4 && n % 100 != 11 && n % 100 != 12 && n % 100 != 13)?s[n % 10]:"th", v[n - 1]);
}
return 0;
}
=======================签 名 档=======================
原文地址(我的博客):http://www.clanfei.com/2012/04/620.html
欢迎访问交流,至于我为什么要多弄一个博客,因为我热爱前端,热爱网页,我更希望有一个更加自由、真正属于我自己的小站,或许并不是那么有名气,但至少能够让我为了它而加倍努力。。
=======================签 名 档=======================
分享到:
相关推荐
ACM_算法模板集史上最完整收藏版223页全免费版.pd
杭电hdu acm资料所用杭电的acm题
noi试题和解析,对于参加acm非常有帮助
浙江大学ACM题解JU_ACM_All_Anwer,里面一本非常好的chm电子书,浙大的所有ACM题及题解都在了,对学习ACM的朋友非常的好~还等什么呢?
ACM_基础篇
Pascal acm_timus_ural_1148.pas
Pascal acm_timus_ural_1099.pas
ACM__ICPC__重要补充知识.doc
ACM,竞赛题目,我已经在上面测试过了,可以用,题目是ARGUS,希望大家可以喜欢,花了长时间才弄好的
ACM_竞赛试题,对于那些参加各种比赛,特别是ACM大赛的人会有很大帮助
ACM的重要PPT资料,对初学者非常有益处
一些关于ACM算法的资料,包括5种算法的详细讲解和ACM题型分类以及一些基础题目
ACM_计算几何_源码.pdf
ACM_String.
ACM_贪心.
杭电 hdu acm 第1084题的解法,ac过了,是一位学长教我的.内有一些中文说明.
ACM_Java 速成,重点讲述了JAVA的基本运用和大数类,以及JAVA中进制转化函数,对ACMer学习JAVA大有帮助
The 2014 ACM-ICPC Asia Beijing Regional Contest
ACM_算法模板集史上最完整收藏版223页 ACM_算法模板集史上最完整收藏版 ACM_算法模板集史上最完整收藏版
2004ACM国际大学生程序设计决赛题目