A10859 | k-th divisor
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given two integers $n$ and $k$ . Find $k$ -th smallest divisor of $n$ , or report that it doesn't exist.
Divisor of $n$ is any such natural number, that $n$ can be divided by it without remainder.
Divisor of $n$ is any such natural number, that $n$ can be divided by it without remainder.
输入格式
The first line contains two integers $n$ and $k$ ( $1<=n<=10^{15}$ , $1<=k<=10^{9}$ ).
输出格式
If $n$ has less than $k$ divisors, output -1.
Otherwise, output the $k$ -th smallest divisor of $n$ .
Otherwise, output the $k$ -th smallest divisor of $n$ .
输入输出样例
输入 #1
4 2
输出 #1
2
输入 #2
5 3
输出 #2
-1
输入 #3
12 5
输出 #3
6
In the first example, number $4$ has three divisors: $1$ , $2$ and $4$ . The second one is $2$ .
In the second example, number $5$ has only two divisors: $1$ and $5$ . The third divisor doesn't exist, so the answer is -1.
In the second example, number $5$ has only two divisors: $1$ and $5$ . The third divisor doesn't exist, so the answer is -1.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted