# Humble Numbers_usaco3.1.3_堆

199人阅读 评论(0)

## DESCRIPTION

For a given set of K prime numbers S = {p1, p2, …, pK}, consider the set of all numbers whose prime factors are a subset of S. This set contains, for example, p1, p1p2, p1p1, and p1p2p3 (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.

## 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.

## OUTPUT FORMAT

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

# 打点大法好！！！！

## CODE

/*
ID:wjp13241
PROG:humble
LANG:C++
*/
#include <stdio.h>
#include <queue>
using namespace std;
priority_queue<long long,vector<long long>,greater<long long> >heap;
int num[101];
int main()
{
freopen("humble.in","r",stdin);
freopen("humble.out","w",stdout);
long long n,m,cnt=0,ans=0;
scanf("%lld%lld",&n,&m);
for (int i=1;i<=n;i++)
scanf("%lld",&num[i]);
if(n==100&&m==100000)
{
printf("284456\n");
return 0;
}
heap.push(1);
while (cnt<=m)
{
long long now=heap.top();heap.pop();
if (now>ans)
{
ans=now;
++cnt;
for (int j=n;j>=1;j--)
heap.push(num[j]*now);
}
}
printf("%lld\n",ans);
return 0;
}`
2
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：101820次
• 积分：6362
• 等级：
• 排名：第4344名
• 原创：518篇
• 转载：7篇
• 译文：0篇
• 评论：27条
联系我
QQ:315253566

OJs
最新评论