hdu1058 Humble Numbers
2013-01-29 23:29
330 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1058
DP
DP
#include <stdio.h> #define N 5848 int h ; int a[4]; int p[4] = {1, 1, 1, 1}; int min() { int i, flag = 0; for(i=1; i<4; i++) { if(a[i] < a[flag]) { flag = i; } } for(i=0; i<4; i++) { if(a[i] == a[flag]) { p[i] ++; } } return a[flag]; } void init() { int hash[4] = {2, 3, 5, 7}; int i, j; h[1] = 1; for(i=2; i<N; i++) { for(j=0; j<4; j++) { a[j] = h[p[j]] * hash[j]; } h[i] = min(); //printf("%d ", h[i]); } } int main() { int i; init(); while(scanf("%d", &i), i) { printf("The %d", i); if((10<i%100 && i%100<20) || i%10>3 || i%10==0) { printf("th"); } else { if(i%10==1) { printf("st"); } else { if(i%10==2) { printf("nd"); } else { printf("rd"); } } } printf(" humble number is %d.\n", h[i]); } return 0; }
相关文章推荐
- HDU1058 Humble Numbers
- hdu1058 Humble Numbers
- HDU1058 Humble Numbers
- HDU1058 Humble Numbers(动态规划+暴力打表)
- HDU1058[Humble Numbers]
- HDU1058 Humble Numbers(优先队列+set)
- hdu1058 Humble Numbers
- hdu1058 Humble Numbers DP
- hdu1058-Humble Numbers
- hdu1058 Humble Numbers(dp打表)
- hdu1058.Humble Numbers
- hdu1058 Humble Numbers && hdu3199 Hamming Problem(简单dp)
- hdu1058 Humble Numbers 解题报告
- hdu1058 Humble Numbers
- ACM-DP之Humble Numbers——hdu1058
- HDU1058:Humble Numbers
- hdu1058 Humble Numbers (动态规划)
- HDU1058:Humble Numbers
- HDU1058 Humble Numbers , dp(数组有序特性)
- Humble Numbers-hdu1058