Pro.ID22670 TitleAmusing Numbers Title链接http://10.20.2.8/oj/exercise/problem?problem_id=22670 AC0 Submit1 Ratio0.00% 时间&空间限制描述Let us consider the set of integer numbers between 1 and N inclusive. Let us order them lexicographically (i. e. like in the vocabulary), for example, for N = 11 the order would be: 1, 10, 11, 2, 3, 4, 5, 6, 7, 8, 9. Let us denote the position of the number K in this ordering as QN,K. For example, Q11,2 = 4. Given numbers K and M find the smallest N such that QN,K = M. 输入Input contains two integer numbers K and M ( 1 ≤ K, M ≤ 109 ) separated by a space. 输出Description Let us consider the set of integer numbers between 1 and N inclusive. Let us order them lexicographically (i. e. like in the vocabulary), for example, for N = 11 the order would be: 1, 10, 11, 2, 3, 4, 5, 6, 7, 8, 9. Let us denote the position of the number K in this ordering as QN,K. For example, Q11,2 = 4. Given numbers K and M find the smallest N such that QN,K = M. Input Input contains two integer numbers K and M ( 1 ≤ K, M ≤ 109 ) separated by a space. Output If such N that QN,K = M exists then write to the output the smallest such N, otherwise write 0. Sample Input 100000001 1000000000 Sample Output 100000000888888879 Source 样例输入100000001 1000000000 样例输出100000000888888879 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-5 17:46 , Processed in 0.036440 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
