3199：Hamming Problem

题目描述

For each three prime numbers p1, p2 and p3, let's define Hamming sequence Hi(p1, p2, p3), i=1, ... as containing in increasing order all the natural numbers whose only prime divisors are p1, p2 or p3.

For example, H(2, 3, 5) = 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 25, 27, ...

So H5(2, 3, 5)=6.

输入解释

In the single line of input file there are space-separated integers p1 p2 p3 i.

输出解释

The output file must contain the single integer - Hi(p1, p2, p3). All numbers in input and output are less than 10^18.

输入样例

7 13 19 100

输出样例

26590291

来自杭电HDUOJ的附加信息

Recommend

lcy

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 Northeastern Europe 2000 - Far-Eastern Subregion

源链接： HDU-3199

最后修改于 2020-10-25T23:01:07+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
2000/1000MS(Java/Others)	32768/32768K(Java/Others)