A11523 | Prime Gift
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Opposite to Grisha's nice behavior, Oleg, though he has an entire year at his disposal, didn't manage to learn how to solve number theory problems in the past year. That's why instead of Ded Moroz he was visited by his teammate Andrew, who solemnly presented him with a set of $n$ distinct prime numbers alongside with a simple task: Oleg is to find the $k$ -th smallest integer, such that all its prime divisors are in this set.
输入格式
The first line contains a single integer $n$ ( $1<=n<=16$ ).
The next line lists $n$ distinct prime numbers $p_{1},p_{2},...,p_{n}$ ( $2<=p_{i}<=100$ ) in ascending order.
The last line gives a single integer $k$ ( $1<=k$ ). It is guaranteed that the $k$ -th smallest integer such that all its prime divisors are in this set does not exceed $10^{18}$ .
The next line lists $n$ distinct prime numbers $p_{1},p_{2},...,p_{n}$ ( $2<=p_{i}<=100$ ) in ascending order.
The last line gives a single integer $k$ ( $1<=k$ ). It is guaranteed that the $k$ -th smallest integer such that all its prime divisors are in this set does not exceed $10^{18}$ .
输出格式
Print a single line featuring the $k$ -th smallest integer. It's guaranteed that the answer doesn't exceed $10^{18}$ .
输入输出样例
输入 #1
3 2 3 5 7
输出 #1
8
输入 #2
5 3 7 11 13 31 17
输出 #2
93
The list of numbers with all prime divisors inside ${2,3,5}$ begins as follows:
$(1,2,3,4,5,6,8,...)$
The seventh number in this list ( $1$ -indexed) is eight.
$(1,2,3,4,5,6,8,...)$
The seventh number in this list ( $1$ -indexed) is eight.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted