As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
Sheng bill 有着惊人的心算能力，甚至能用大脑计算出两个巨大的数的 GCD（最大公约数）！因此他经常和别人比赛计算 GCD。有一天 Sheng bill 很嚣张地找到了你，并要求和你比赛，但是输给Sheng bill岂不是很丢脸！所以你决定写一个程序来教训他。
共两行：
一行，表示 $A$ 和 $B$ 的最大公约数。
12
546| 测试点 | $A,B \leq $ |
|---|---|
| $1 \sim 2$ | $10^{18}$ |
| $3$ | $10^{100}$ |
| $4$ | $10^{500}$ |
| $5$ | $10^{5\,000}$ |
| $6$ | $10^{6\,000}$ |
| $7$ | $10^{7\,000}$ |
| $8 \sim 10$ | $10^{10\,000}$ |
对于 $100\%$ 的数据，$1 \leq A,B \leq 10^{10\,000}$。
The discussion section is only for posting: Editorials, 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.
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: