HDU 1058 Humble Numbers(打表+暴力)
来源:互联网 发布:樱井知香黑人 编辑:程序博客网 时间:2024/06/14 16:44
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22427 Accepted Submission(s): 9800
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.
题解:
找出能被2,3,5,7整除的数,即素因子。既是素数,又是因子。然后找出是第几个。。。。
AC代码:
暴力+打表
#include <cstdio>#define min(a,b) ((a) < (b) ? (a):(b))#define min4(a,b,c,d) min(min(a,b),min(c,d))int a[5850];int main(void){int n = 1;int p2,p3,p5,p7;p2 = p3 = p5 = p7 = 1;a[1] = 1;while(a[n] < 2000000000){a[++n] = min4(2 * a[p2],3 * a[p3], 5 * a[p5], 7 * a[p7]);if(a[n] == 2 * a[p2])p2++;if(a[n] == 3 * a[p3])p3++;if(a[n] == 5 * a[p5])p5++;if(a[n] == 7 * a[p7])p7++;}while(~scanf("%d",&n)){if(n==0)break;printf("The %d",n);int ten = n/10%10;if(n%10 == 1 && ten != 1)printf("st");else if(n%10 == 2 && ten != 1)printf("nd");else if(n%10 == 3 && ten != 1)printf("rd");elseprintf("th");printf(" humble number is %d.\n",a[n]);}return 0;}
1 0
- HDU 1058 Humble Numbers(打表+暴力)
- HDU-1058-Humble Numbers(暴力打表)
- HDU 1058 Humble Numbers (dp+打表)
- HDU 1058 Humble Numbers (打表)
- HDU-1058-Humble Numbers-暴力贪心
- HDU 1058 Humble Numbers 【暴力(DFS)】
- HDU 1058 Humble Numbers (DP,打表)
- HDU:1058 Humble Numbers(技巧打表)
- hdu 1085 Humble Numbers(打表)
- hdu Humble Numbers(打表)
- HDU1058 Humble Numbers(动态规划+暴力打表)
- HDOJ 1058 Humble Numbers(打表过)
- HDU 1058 Humble Numbers 动态规划 或 暴力
- HDU 1058 Humble Numbers ..没用STL暴力过了
- HDU 1058 Humble Numbers
- hdu 1058 Humble Numbers
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers
- 在ubuntu14.04上安装spacemacs
- 手算KMP匹配的Next值和Nextval值
- Handler
- 线程与进程
- HDU2544 最短路 + 裸 + Bellman-ford + 链表存储
- HDU 1058 Humble Numbers(打表+暴力)
- 浅谈HashMap
- 面试:数组:插入区间:057
- Linux网络编程-客户端和服务器端互相收发消息
- 提高PHP代码质量的36个技巧
- PhantomJS
- 如何学习java
- 图片,还可以这样玩儿
- angularjs结合localstorage完成一个简单的备忘录