영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
You have a compass that can point in 360 different directions. Right now it points straight up, at the number 0.
Unfortunately, the compass is broken! The only way you can make it point in other directions is by lifting the whole compass and rotating it a number of degrees counterclockwise. To help you, you have two robot arms. Unfortunately, these are not perfect: the first robot arm can spin the compass exactly a degrees counterclockwise and the second robot arm can spin it b degrees counterclockwise. The robot arms can only rotate the compass exactly a and b degrees, respectively, each time they are used, no more and no less. Because of this, it may not be possible to make the compass point in all 360 directions.
This makes you wonder, how many unique directions can the compass point in? Write a program that figures this out given the numbers a and b. Note that since we rotate in a circle, a rotation of 10 degrees counterclockwise is the same as a rotation of 370 degrees counterclockwise; that is, 0 and 360 are the same number of degrees. More generally, we only care about the remainder of the number of degrees rotated divided by 360.
Input
The first line of input contains the integer a (1 ≤ a ≤ 360), the number of degrees the first robot arm spins the compass.
The second line contains the integer b (1 ≤ b ≤ 360), the number of degrees the second robot arm spins the compass.
Output
Print an integer: the number of unique directions the compass can be pointed in.
Scoring
Your solution will be tested on a set of test groups. To earn points for a group, you must pass all test cases in that group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 20 | a = 13 |
| 2 | 40 | a = b |
| 3 | 40 | No additional constraints. |
예제
예제 1
50 180
36
예제 2
360 360
1