HDU1058 Humble Numbers , dp(数组有序特性)

1.题目描述：

Humble Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25098    Accepted Submission(s): 11074

Problem Description

A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers. 

Write a program to find and print the nth element in this sequence

 

Input

The input consists of one or more test cases. Each test case consists of one integer n with 1 <= n <= 5842. Input is terminated by a value of zero (0) for n.

 

Output

For each test case, print one line saying "The nth humble number is number.". Depending on the value of n, the correct suffix "st", "nd", "rd", or "th" for the ordinal number nth has to be used like it is shown in the sample output.

 

Sample Input

  
  

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

 

Sample Output

  
  

   
   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.
  
  

 

Source

University of Ulm Local Contest 1996

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:   1159  1069  1024  1025  1081 

3.思路分析：

如果一个数是Humble Number,那么它的2倍,3倍,5倍,7倍仍然是Humble Number
定义dp[i]为第i个Humble Number
dp[n]=min(2*dp[i],3*dp[j],5*dp[k],7*dp[l]), i,j,k,l在被选择后相互移动
然后还要特殊处理一下输出问题，不会爆int，瞎搞即可

4.Ac代码：

#include 
   
   
    
    
#define INF 0x7fffffff
#define maxn 5843
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7;
using namespace std;
typedef long long ll;
int dp[maxn] = {0};
int i, j, k, l;
int min(int a, int b, int c, int d)
{
  int min = a;
  if (b < min)
    min = b;
  if (c < min)
    min = c;
  if (d < min)
    min = d;
  if (a == min)
    i++;
  if (b == min)
    j++;
  if (c == min)
    k++;
  if (d == min)
    l++;
  return min;
}
void solve()
{
  i = j = k = l = 1;
  dp[1] = 1;
  for (int t = 2; t <= maxn; t++)
    dp[t] = min(2 * dp[i], 3 * dp[j], 5 * dp[k], 7 * dp[l]);
}
int main()
{
#ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
  long _begin_time = clock();
#endif
  solve();
  int n;
  while (scanf("%d", &n) != EOF && n)
  {
    if (n % 10 == 1 && n % 100 != 11)
      printf("The %dst humble number is %d.\n", n, dp[n]);
    else if (n % 10 == 2 && n % 100 != 12)
      printf("The %dnd humble number is %d.\n", n, dp[n]);
    else if (n % 10 == 3 && n % 100 != 13)
      printf("The %drd humble number is %d.\n", n, dp[n]);
    else
      printf("The %dth humble number is %d.\n", n, dp[n]);
  }
#ifndef ONLINE_JUDGE
  long _end_time = clock();
  printf("time = %ld ms\n", _end_time - _begin_time);
#endif
  return 0;
}