小红特别喜欢斐波那契数列,所以他想问你,在前 个斐波那契数中(保证 ),谁包含数位 的次数最多(如果有多个就输出最小的)。 我们定义斐波那契数列如下:1&1\le n \le 2\\\operatorname{Fib}_{n-1}+\operatorname{Fib}_{n-2}&3 \le n\end{cases}" ,第 个斐波那契数即 。 例如,前 个斐波那契数为 ,包含数位 的次数最多的为 (包含 次)。 #videoTogetherLoading { touch-action: none; height: 50px; border: 1px solid #c9c8c8; background: #ffffff; color: #212529; display: flex; align-items: center; z-index: 2147483646; position: fixed; bottom: 15px; right: 15px; width: 250px; text-align: center; box-shadow: 0 3px 6px -4px #0000001f, 0 6px 16px #00000014, 0 9px 28px 8px #0000000d; border-radius: 5px; } #videoTogetherLoadingwrap { width: 100%; display: flex; align-items: center; justify-content: center; } #videoTogetherLoadingwrap img { margin-right: 12px; } #videoTogetherLoadingwrap a { color: #212529; text-decoration: none; } #videoTogetherLoadingwrap a:hover { color: #1890ff; text-decoration: underline; } #videoTogetherLoading { touch-action: none; height: 50px; border: 1px solid #c9c8c8; background: #ffffff; color: #212529; display: flex; align-items: center; z-index: 2147483646; position: fixed; bottom: 15px; right: 15px; width: 250px; text-align: center; box-shadow: 0 3px 6px -4px #0000001f, 0 6px 16px #00000014, 0 9px 28px 8px #0000000d; border-radius: 5px; } #videoTogetherLoadingwrap { width: 100%; display: flex; align-items: center; justify-content: center; } #videoTogetherLoadingwrap img { margin-right: 12px; } #videoTogetherLoadingwrap a { color: #212529; text-decoration: none; } #videoTogetherLoadingwrap a:hover { color: #1890ff; text-decoration: underline; } #videoTogetherLoading { touch-action: none; height: 50px; border: 1px solid #c9c8c8; background: #ffffff; color: #212529; display: flex; align-items: center; z-index: 2147483646; position: fixed; bottom: 15px; right: 15px; width: 250px; text-align: center; box-shadow: 0 3px 6px -4px #0000001f, 0 6px 16px #00000014, 0 9px 28px 8px #0000000d; border-radius: 5px; } #videoTogetherLoadingwrap { width: 100%; display: flex; align-items: center; justify-content: center; } #videoTogetherLoadingwrap img { margin-right: 12px; } #videoTogetherLoadingwrap a { color: #212529; text-decoration: none; } #videoTogetherLoadingwrap a:hover { color: #1890ff; text-decoration: underline; }
输入描述:
在一行上输入两个整数  。


输出描述:
在一行上输出一个整数,代表最小的包含数位  最多的斐波那契数。保证一定存在这样的数字。
示例1

输入

5 2

输出

2

说明

该样例已在题目中加以解释。
示例2

输入

30 6

输出

6765

说明

加载中...