HDOJ(HDU).1058 Humble Numbers (DP)

最新推荐文章于 2024-10-01 18:52:56 发布

pengwill97

最新推荐文章于 2024-10-01 18:52:56 发布

阅读量241

点赞数

文章标签： dp 动态规划

本文链接：https://blog.csdn.net/pengwill97/article/details/55145039

版权

算法---动态规划专栏收录该内容

60 篇文章 1 订阅

订阅专栏

HDOJ(HDU).1058 Humble Numbers (DP)

点我挑战题目

题意分析

水

代码总览

/*
    Title:HDOJ.1058
    Author:pengwill
    Date:2017-2-15
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define nmax 6000
#define min(a,b) (a<b?a:b)
#define min4(a,b,c,d) min(min(a,b),min(c,d))
using namespace std;
int r[nmax];
int a = 1,b=1,c=1,d=1,len,tail;
int main()
{
    r[1] =1;
    for(int i = 2; i<=5842;++i){
        r[i] = min4(2*r[a],3*r[b],5*r[c],7*r[d]);
        if(r[i] == 2*r[a]) a++;
        if(r[i] == 3*r[b]) b++;
        if(r[i] == 5*r[c]) c++;
        if(r[i] == 7*r[d]) d++;
    }
    int t;
    while(scanf("%d",&t) && t ){
         printf("The %d", t);
         if(t%10 == 1 && t%100 != 11) printf("st ");
         else if(t%10 == 2 && t%100 != 12) printf("nd ");
         else if(t%10 == 3 && t%100 != 13) printf("rd ");
         else printf("th ");
         printf("humble number is %d.\n", r[t]);

    }
    return 0;
}