| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 5 초 | 128 MB | 501 | 66 | 42 | 10.448% |
In this problem we are interested only in prime prime powers, i.e., numbers of the form ab, where a and b are prime numbers. For a given number n, we want to find the k-th smallest prime prime power greater than n.
The first and only line of the input contains two integers n and k (1 ≤ n ≤ 1018, 1 ≤ k ≤ 100,000).
The first and only line of output should contain one integer m, such that m is the k-th smallest prime prime power greater than n.
22 1
25
22 2
27
Contest > Algorithmic Engagements > PA 2011 7-7번