HDU 1058.Humble Numbers【这个题怎么定位呢···就【DP】吧】【8月28】

标签：acm   c++   hdu   dp   

Humble Numbers

1
2
3
4
11
12
13
21
22
23
100
1000
5842
0

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<cstdio>
int minx(int a,int b,int c,int d){//求a,b,c,d最小值
    if(a<b&&a<c&&a<d) return a;
    else if(b<c&&b<d) return b;
    else if(c<d) return c;
    else return d;
}
int main(){
    int f[6000],h2=1,h3=1,h5=1,h7=1,n;
    f[1]=1;
    for(int i=2;i<5843;i++){
        f[i]=minx(2*f[h2],3*f[h3],5*f[h5],7*f[h7]);
        if(f[i]==2*f[h2]) h2++;
        if(f[i]==3*f[h3]) h3++;//千万别用else，不然就会有重复的数字了
        if(f[i]==5*f[h5]) h5++;//注意！
        if(f[i]==7*f[h7]) h7++;//千万注意！
    }
    while(scanf("%d",&n)==1&&n)//下面这行代码我觉得我写的挺有意思的，嘿嘿。不断的连接起来~~自己仔细看看，挺好玩的
        printf("The %d%s humble number is %d.\n",n,n%100==11?"th":n%100==12?"th":n%100==13?"th":n%10==1?"st":n%10==2?"nd":n%10==3?"rd":"th",f[n]);
    return 0;
}

HDU 1058.Humble Numbers【这个题怎么定位呢···就【DP】吧】【8月28】

标签：acm   c++   hdu   dp   

原文地址：http://blog.csdn.net/a995549572/article/details/48056659