同余方程 - المسألة

#17190. 同余方程

الإحصائيات

求关于 $x$ 的同余方程 $ax \equiv 1 \pmod b$ 的最小正整数解。

输入格式

输入只有一行，包含两个正整数 $a, b$，用一个空格隔开。

输出格式

输出只有一行，包含一个正整数 $x_0$，即最小正整数解。输入数据保证一定有解。

样例数据

样例输入

3 10

样例输出

数据范围

对于 $40\%$ 的数据，$2 \le b \le 1,000$；

对于 $60\%$ 的数据，$2 \le b \le 50,000,000$；

对于 $100\%$ 的数据，$2 \le a, b \le 2,000,000,000$。

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