HDU 1058 Humble Numbers (思维)
来源:互联网 发布:c语言输出杨辉三角形 编辑:程序博客网 时间:2024/04/30 17:19
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23838 Accepted Submission(s): 10411
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
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
University of Ulm Local Contest 1996
Recommend
JGShining | We have carefully selected several similar problems for you: 1159 1024 1025 1081 1505
输出真的让人无语。。。
#include<string.h>#include<stdio.h>#include<algorithm>using namespace std;int main(){int a2,a3,a5,a7,k,n;int b2,b3,b5,b7;int ans[6000];ans[1]=1;a2=a3=a5=a7=1;for(int i=2;i<5843;i++){b2=ans[a2]*2;b3=ans[a3]*3;b5=ans[a5]*5;b7=ans[a7]*7;ans[i]=min(min(b2,b3),min(b5,b7));if(ans[i]==b2)a2++;if(ans[i]==b3)a3++;if(ans[i]==b5)a5++;if(ans[i]==b7)a7++;}while(scanf("%d",&n),n){k=n%100;if(k>=10&&k<=20){printf("The %dth humble number is %d.\n",n,ans[n]);continue;}k=n%10;printf("The %d",n);if(k==1)printf("st ");else if(k==2)printf("nd ");else if(k==3)printf("rd ");elseprintf("th ");printf("humble number is %d.\n",ans[n]);}return 0;}
0 0
- HDU 1058 Humble Numbers (思维)
- 【HDU 1058 Humble Numbers】+ 思维
- HDU-1058-Humble Numbers【思维】
- Humble Numbers (HDU 1058)
- hdoj 1058 Humble Numbers 【思维】
- hdu1058 Humble Numbers(思维)
- HDU 1058 Humble Numbers
- hdu 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- hdu 1058 humble numbers
- hdu 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- HDU 1058 Humble Numbers
- HDU 1058 Humble Numbers
- Reward(反向拓扑)
- 正对android面试的一些技术问题(摘抄自网络)
- 机器学习简单实验(线性分类)
- 2016.8.5_状压dp
- Gradle介绍
- HDU 1058 Humble Numbers (思维)
- linux kernel file_open
- 位运算入门应用以及技巧
- artist-mode & ditaa
- PyQt5教程(四)——事件与信号
- 【解题报告】2016.8.5·Day2·状压DP
- 【CodeForces】701A - Cards(暴力 || 思维)
- 关于java的IO流
- 数据结构实验之栈六:下一较大值(二)