A1230. [COCI-2011_2012-contest4]#1 BROJ
编程题
普及/提高-
知识点
题目描述
Find the N-th smallest positive integer whose least prime factor is P, or state that the result is greater than 10^
9.
9.
输入格式
The first and only line of input contains space seperated integers N and P (1 ≤ N, P ≤ 109). P will always be prime.
输出格式
Output a single line with the expected result, or zero if result exceeds 10^
9.
9.
输入输出样例
输入 #1
1 2
输出 #1
2
输入 #2
2 3
输出 #2
9
输入 #3
1000 1000003
输出 #3
0
说明/提示
In test cases worth 30% of total points, expected result will either be less than 100 000, or will exceed
10^9.
In test cases worth additional 30% of total points, P will be greater than 1000.
10^9.
In test cases worth additional 30% of total points, P will be greater than 1000.