【其他】【USACO】Humble Numbers

 

For a given set of K prime numbers S = {p₁, p₂, ..., p_K}, consider the set of all numbers whose prime factors are a subset of S. This set contains, for example, p₁, p₁p₂, p₁p₁, and p₁p₂p₃ (among others). This is the set of `humble numbers' for the input set S. Note: The number 1 is explicitly declared not to be a humble number.

Your job is to find the Nth humble number for a given set S. Long integers (signed 32-bit) will be adequate for all solutions.

PROGRAM NAME: humble

INPUT FORMAT

Line 1:	Two space separated integers: K and N, 1 <= K <=100 and 1 <= N <= 100,000.
Line 2:	K space separated positive integers that comprise the set S.

SAMPLE INPUT (file humble.in)

4 19
2 3 5 7

OUTPUT FORMAT

The Nth humble number from set S printed alone on a line.

SAMPLE OUTPUT (file humble.out)

27

 
 

描述
对于一给定的素数集合 S = {p1, p2, ..., pK},考虑一个正整数集合，该集合中任一元素的质因数全部属于S。这个正整数集合包括，p1、p1*p2、p1*p1、p1*p2*p3...(还有其它)。该集合被称为S集合的“丑数集合”。
注意：我们不认为1 是一个丑数。
你的工作是对于输入的集合S去寻找“丑数集合”中的第N个“丑数”。所有答案可以用longint(signed 32-bit)存储。
补充：丑数集合中每个数从小到大排列，每个丑数都是素数集合中的数的乘积，第N个“丑数”就是在能由素数集合中的数相乘得来的（包括它本身）第n小的数。
[编辑]格式
PROGRAM NAME: humble
INPUT FORMAT:
(file humble.in)
第 1 行: 二个被空格分开的整数:K 和 N ， 1<= K<=100 ， 1<= N<=100,000.
第 2 行: K 个被空格分开的整数:集合S的元素
OUTPUT FORMAT:
(file humble.out)
单独的一行，输出对于输入的S的第N个丑数。
[编辑]SAMPLE INPUT
 4 19
 2 3 5 7


[编辑]SAMPLE OUTPUT
27
  
  
顺推
对于第i个humble number
枚举每个质数，然后让他找到第一个相乘比第i-1个质数大的丑数。
/*
ID:sephiro5
LANG:C++
PROG:humble
*/
#include <stdio.h>
#include <limits.h>
#define MAXINT INT_MAX
#define maxn 100010

int p[maxn],q[maxn];
int hum[maxn];
int n,k;

int main()
{
    freopen("humble.in","r",stdin);
    freopen("humble.out","w",stdout);
    
    scanf("%d%d",&k,&n);
    for (int i=1;i<=k;++i)
    {
        scanf("%d",&q[i]);
        p[i]=1;
    }
    
    hum[1]=1;
    for (int i=2;i<=n+1;++i)
    {
        int min=MAXINT;
        for (int j=1;j<=k;++j)
        {
            while (q[j]*hum[p[j]]<=hum[i-1]) ++p[j];
            if (q[j]*hum[p[j]]<min) min=q[j]*hum[p[j]];
        }    
        hum[i]=min;
    }
    
    printf("%d/n",hum[n+1]);
    
    return 0;
}