CodeForces - 664A
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. Sample Input
Input
1 2
Output
1
Input
61803398874989484820458683436563811772030917980576 61803398874989484820458683436563811772030917980576
Output
61803398874989484820458683436563811772030917980576 Source
//题意:
给你两个数(非常大),让你找出它们的最大公因子d,使得从a---b之间的数都可以整除d.
//思路:
这个显然是不可能的,所以只可能是1(两数不同)或者它本身(两数相同)
|
CodeForces - 664A Complicated GCD (技巧)水
最新推荐文章于 2020-03-20 11:01:12 发布