Humble Numbers(优先队列)
来源:互联网 发布:求逆矩阵的方法 编辑:程序博客网 时间:2024/05/22 03:37
Humble Numbers
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 22 Accepted Submission(s) : 3
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
转载来自 http://blog.csdn.net/qianchangdiyin/article/details/50787676这个博客
解释如下
# include<iostream># include<queue># include<cstdio># define MAX 5842using namespace std;__int64 humble_number[MAX+1];struct cmp1{bool operator()(__int64 &a,__int64 &b) { return a>b;//最小值优先 }};int main(){ int i=1,n; humble_number[0]=0; priority_queue<__int64,vector<__int64>,cmp1> q; while(i<=MAX) { q.push(1); while(!q.empty()) { if(i>MAX) break; __int64 j=q.top(); q.pop(); if(j!=humble_number[i-1]) { humble_number[i++]=j; q.push(j*2); q.push(j*3); q.push(j*5); q.push(j*7); } } } //这边是控制输入的问题 while(cin>>n) { if(n==0) break; else { if(n%10==1&&n%100!=11) printf("The %dst humble number is %d.\n",n,humble_number[n]); else if(n%10==2&&n%100!=12) printf("The %dnd humble number is %d.\n",n,humble_number[n]); else if(n%10==3&&n%100!=13) printf("The %drd humble number is %d.\n",n,humble_number[n]); else printf("The %dth humble number is %d.\n",n,humble_number[n]); } } return 0;}
阅读全文
0 0
- Humble Numbers(优先队列)
- HDU1058 Humble Numbers(优先队列+set)
- hdu1058 Humble Numbers【优先队列】
- hdu 1058 Humble Numbers(优先队列+set)
- HDU 1058 Humble Numbers(丑数,优先队列,STL)
- hdu 1058 Humble Numbers 丑数(set,优先队列应用)
- HDU 1058 Humble Numbers【巧用优先队列】
- USACO 3.1 Humble Numbers丑数_优先队列
- 杭电OJ——1058 Humble Numbers(用优先队列也可以解)
- Humble Numbers(hdu1058)
- Humble Numbers(dp)
- poj - 1338 - Ugly Numbers(优先队列)
- poj1338 Ugly Numbers(set + 优先队列)
- UVa136(Ugly Numbers)优先队列
- poj Ugly Numbers(优先队列)
- AtCoder:3N Numbers(优先队列)
- zoj1095 Humble Numbers(2)
- POJ 2247(Humble Numbers)
- canvas scale()画布缩放的使用
- 博客迁移到简书
- json解析数据流代码
- Qt之实现录音播放及raw(pcm)转wav格式
- 内存池的实现
- Humble Numbers(优先队列)
- 周志华《机器学习》学习笔记——线性回归
- Sql server 分页查询
- 微信抢票个人总结
- Caffe(仅CPU)配置+编译+python接口
- POJ-2104:K-th Number(主席树)
- 侧滑菜单
- require的基础使用(一)
- python机器学习实战:Adaboost