CF1297G.M-numbers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
For a given positive integer m , a positive number is called a m -number if the product of its digits is m . For example, the beginning of a series of 24 -numbers are as follows: 38 , 46 , 64 , 83 , 138 , 146 , 164 , 183 , 226 ...
You are given a positive integer m and k . Print k -th among m -numbers if all m -numbers are sorted in ascending order.
输入格式
A single line of input contains two integers m and k ( 2≤m≤109 , 1≤k≤109 ).
输出格式
Print the desired number — k -th among all m -numbers if m -numbers are sorted in ascending order. If the answer does not exist, print -1.
输入输出样例
输入#1
24 9
输出#1
226
输入#2
24 1
输出#2
38
输入#3
5040 1000000000
输出#3
111121111315213227111
输入#4
2020 2020
输出#4
-1