HDU——1058Humble Numbers(找规律)
来源:互联网 发布:淘宝客服一般几点上班 编辑:程序博客网 时间:2024/05/16 08:08
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21853 Accepted Submission(s): 9553
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.
#include<iostream>#include<set>using namespace std;typedef long long LL;LL er=1,san=1,wu=1,qi=1;LL minn(const LL &a,const LL &b,const LL &c,const LL &d){LL t=a;if(b<t)t=b;if(c<t)t=c;if(d<t)t=d;//下面都要用if而非else-if 出现重复的数时才可以多个数均被++ if(t==a)er++; if(t==b)san++; if(t==c)wu++; if(t==d)qi++;return t;}int main(void){LL i;LL list[5900]={1,1};for (i=2; i<5900; i++){list[i]=minn(2*list[er],3*list[san],5*list[wu],7*list[qi]);}int n;while (cin>>n&&n){if(n%10==1&&n%100!=11)printf("The %dst humble number is %lld.\n",n,list[n]);else if(n%10==2&&n%100!=12)printf("The %dnd humble number is %lld.\n",n,list[n]);else if(n%10==3&&n%100!=13)printf("The %drd humble number is %lld.\n",n,list[n]);elseprintf("The %dth humble number is %lld.\n",n,list[n]);}return 0;}
0 0
- HDU——1058Humble Numbers(找规律)
- Hdu 1058 — Humble Numbers
- HDU 1058 —— Humble Numbers
- Humble Numbers (HDU 1058)
- HDU 4722 Good Numbers(找规律)
- HDU-4722-Good 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
- MySQL 笔记
- Objc生成搜索引擎查询字符串
- seerThcraeSyraniBeuqinU.96
- HDU 2045 不容易系列之(3)—— LELE的RPG难题(三色涂方格问题详解)(递推)
- Java中的Copy-On-Write容器
- HDU——1058Humble Numbers(找规律)
- LTE的关键任务网
- 【第二章】 IoC 之 2.1 IoC基础 ——跟我学Spring3
- JS产生随机数的几个用法!
- NYOJ14会场安排问题
- POJ 1698 Alice's Chance
- 简单说说glutGet(GLUT_WINDOW_X/Y)与glViewport
- hdu2112 HDU Today (floyd+stl-map)
- NLP系列(5)_从朴素贝叶斯到N-gram语言模型