Equal Digits - Problème

#16746. Equal Digits

Statistiques

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

给定整数 $N$ 和数字 $D$，求最小的整数 $K \ge 2$，使得 $N$ 在以 $K$ 为基数的记数法（即 $K$ 进制）下的表示中，末尾包含最多数量的连续数字 $D$。

输入格式

输入包含两个整数 $N$ 和 $D$（$0 \le N \le 10^{15}$，$0 \le D \le 9$）。

输出格式

输出两个整数：$K$（即问题的答案）和 $R$（即 $N$ 在 $K$ 进制表示中末尾连续数字 $D$ 的个数）。

样例

输入样例 1

3 1

输出样例 1

2 2

输入样例 2

29 9

输出样例 2

10 1

输入样例 3

0 4

输出样例 3

2 0

输入样例 4

90 1

输出样例 4

89 2

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0