这篇博客介绍了如何解决codeforces664A问题，涉及寻找1到b之间所有整数的最大公约数。当a等于b时，答案是a；否则，答案为1。这是一个简单的GCD应用问题。
Description
Greatest common divisor GCD(a, b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are divisible by d. There are many efficient algorithms to find greatest common divisor GCD(a, b), for example, Euclid algorithm.
Formally, find the biggest integer d, such that all integers a, a + 1, a + 2, …, b are divisible by d. To make the problem even more complicated we allow a and b to be up to googol, 10100 — such number do not fit even in 64-bit integer type!
Input
The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 10100).
Output
Output one integer — greatest common divisor of all integers from a to b inclusive.
Examples
Input
1 2
最低0.47元/天 解锁文章
361
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
