Key:数论 DP
题意
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.
一个数,如果它的质因子只有2,3,5,7,则它是一个:Humble Numbers。输入一个n,输出第n个Humble Numbers。
题解
规律:Humble Numbers必然是由前面的某个*2,*3,*5,*7得到。
然后维护4个指针。就可以O(n)
最后。。注意英语里面的-st后缀是%10==1且%100!=11的的序数..
-nd,-rd后缀同理..
#include<cstdio>
#include<iostream>
#include<cmath>