杭电1058
2013-09-27 21:42
691 查看
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13689 Accepted Submission(s): 5956
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
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.
代码如下:
#include <iostream> #include <algorithm> using namespace std; #define N 5842 int values[N + 1] ; inline int minValue(int n1, int n2, int n3, int n4) { return min(min(n1, n2), min(n3, n4)) ; } int main(int argc, char ** argv) { memset(values, 0, ( N + 1 ) * sizeof(int)) ; values[1] = 1 ; int p1, p2, p3, p4 ; p1 = p2 = p3 = p4 = 1 ; for (int i = 2; i <= N; ++ i) { values[i] = minValue(values[p1] * 2, values[p2] * 3, values[p3] * 5, values[p4] * 7) ; if (values[p1] * 2 == values[i]) p1 ++ ; if (values[p2] * 3 == values[i]) p2 ++ ; if (values[p3] * 5 == values[i]) p3 ++ ; if (values[p4] * 7 == values[i]) p4 ++ ; } int inValue ; while(cin >> inValue && inValue != 0) { if (inValue % 100 == 11 || inValue % 100 == 12 || inValue % 100 == 13) cout << "The "<< inValue << "th humble number is " <<values[inValue]<< "." << endl; else if (inValue % 10 == 1) cout << "The "<< inValue << "st humble number is " <<values[inValue]<< "." << endl; else if (inValue % 10 == 2) cout << "The "<< inValue << "nd humble number is " <<values[inValue]<< "." << endl; else if (inValue % 10 == 3) cout << "The "<< inValue << "rd humble number is " <<values[inValue]<< "." << endl; else cout << "The "<< inValue << "th humble number is " <<values[inValue]<< "." << endl; } return 0 ; }
相关文章推荐
- Redis-主从复制
- CoreAnimation编程指南(五)图层内容
- 016、AppWidgetProvider桌面小控件
- UDP和TCP协议的各种应用和应用层协议
- Nagios监控Oralce
- 使用多线程和sleep函数生成字符串的伪随机排列(阿里巴巴2014武汉站一道题)
- 病毒交叉感染
- 经典PS教程
- CoreAnimation编程指南(四)图层树结构
- 015、SlidingDrawer 隐藏式抽屉
- Redis-持久化
- 使用disk genius合并C盘和D盘
- struts2中select的使用
- VirtualBox 出现错误 VT-x features locked or unavailable in MSR.
- 2013(秋季)CocoaChina开发者大会实录:彭晓波《助力游戏开发:ARM Neon技术及Ne10开源项目》
- 全排列
- CoreAnimation编程指南(三)几何变换
- 组队赛130926 Regionals 2011, Latin America
- javaFX实践-快递查询工具 part 1
- 014、ListActivity