USACO : Humble Numbers (丑数)

最新推荐文章于 2018-12-20 13:09:29 发布

youzn99

最新推荐文章于 2018-12-20 13:09:29 发布

阅读量650

点赞数

分类专栏： USACO 二分数论文章标签： c语言数论

本文链接：https://blog.csdn.net/youzn99/article/details/50594142

版权

该博客介绍了一个USACO问题，涉及基于给定的质数集合找到第N个仅包含这些质数因子的卑微数（丑数）。输入包括质数的数量K和目标卑微数的索引N，输出为对应的卑微数。示例中，对于集合{2, 3, 5, 7}，第19个卑微数是27。" 84405540,7436586,Github Emoji API探索,"['github emoji', 'api']

摘要由CSDN通过智能技术生成

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.

INPUT FORMAT

最低0.47元/天解锁文章

youzn99

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
USACO : Humble Numbers (丑数)

Humble NumbersFor 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
复制链接

扫一扫

专栏目录