HDU 1058 Humble Numbers

来源：互联网发布：淘宝网投诉电话编辑：程序博客网时间：2024/06/10 01:50

一看就打表题。

第一次在初始化数组的时候出错了。平时喜欢把 INF 初始化为 1<<30 但是这个题可能一乘就超过了 INF

所以卡了下。 f【n】 = min（f【1~n-1】*2,3,5,7）并且 f【n】> f【n-1】。

#include <cstdio>#include <algorithm>#include <iostream>#include <cstring>#include <cmath>#include <cstdlib>#include <string>#include <map>#include <vector>#include <set>#include <queue>#include <stack>#include <cctype>using namespace std;typedef long long LL;typedef unsigned long long ULL;#define MAXN 6000+10#define INF (1<<30)#define mod 6char s[100][100] = {"th","st","nd","rd","th","th","th","th","th","th"};LL f[MAXN];int init(){    for(int i = 0; i < MAXN; i++)        f[i] = 2147483647;    f[1] = 1;f[2] = 2;f[3] = 3;f[4] = 4;    for(int i = 5; i <= 5842; i++){        for(int j = i-1; j >= 1; j--){            if(f[j]*7 <= f[i-1])                break;            f[i] = min(f[i], f[j]*7);            if(f[j]*5 > f[i-1])            f[i] = min(f[i], f[j]*5);            if(f[j]*3 > f[i-1])            f[i] = min(f[i], f[j]*3);            if(f[j]*2 > f[i-1])            f[i] = min(f[i], f[j]*2);        }    }    return 1;}int main (){    init();    int n;    while(scanf("%d",&n) != EOF && n){        printf("The %d%s humble number is %d.\n",n,(n%100 == 11||n%100 == 12||n%100 == 13)? s[0]:s[n%10],f[n]);    }    return 0;}

0 0