Home > Back-end >  Problem.
Problem.

Time:09-27

Come to
I want to a interesting topic
See

The subject background
Winter is coming, brothers chipmunk began to prepare for winter food, two of them the appointment, a collection of pine nuts, a collecting acorns,
Title description
After JiuJiuBaShiTian struggle, they finally collected a pine nuts and b, respectively, acorn, chipmunks had a habit of Tibetan food, they all decide to pine nuts and acorns are divided into the same number of small pile, a pile of pine nuts with a pile of acorn hidden, that is to say, pine nuts and acorns have the same number, due to too much worry about hiding place will forget, so hiding place no more than 1000, but it is too much, pine nuts and acorns number them brothers so I'd like you to help finish assigned work,
Input format
Have two rows, each row is a nonnegative integer less than 300, there may be redundant leading 0,

The output format
An integer less than 1000 can be divided into the biggest pile number

Input and output sample
Enter the # 1
98
63
Output # 1
7
Enter the # 2
113
135
Output # 2
1

CodePudding user response:

Thought have what meaning, is the greatest common divisor,