HDU 1058

来源:互联网 发布:炫踪网络加班厉害吗 编辑:程序博客网 时间:2024/06/05 21:51

[http://acm.hdu.edu.cn/showproblem.php?pid=1058]

//属于动态规划的水题#include<stdio.h>#define min(a,b) (a<b?a:b)#define min4(a,b,c,d) min(min(a,b),min(c,d))int main(void){    int p2,p3,p5,p7,a[100000];    int i;    int n;    i=1;    a[1]=1;    p2=p3=p5=p7=1;    while(a[i]<2000000000)    {        a[++i]=min4(2*a[p2],3*a[p3],5*a[p5],7*a[p7]);//根据2,3,5,7的倍数进行变幻        if(a[i]==2*a[p2]) p2++;        if(a[i]==3*a[p3]) p3++;        if(a[i]==5*a[p5]) p5++;        if(a[i]==7*a[p7]) p7++;    }    while(scanf("%d",&n)!=EOF&&n!=0)    {        if(n%10==1&&n%100!=11)//注意第1,2,3个字母的变化        {            printf("The %dst humble number is ",n);        }        else if(n%10==2&&n%100!=12)        {            printf("The %dnd humble number is ",n);        }        else if(n%10==3&&n%100!=13)        {            printf("The %drd humble number is ",n);        }        else        {            printf("The %dth humble number is ",n);        }        printf("%d.\n",a[n]);    }    return 0;}
原创粉丝点击