Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem E. The Turanga Leela Problem

It’s been a few years since Bender solved his famous bending problem. Today, Turanga Leela, son of Morris and Munda and captain of the Planet Express spaceship, is playing a game with Bender and Philip J. Fry.

Everybody knows that Leela is cyclop. When Leela was still an infant, her parents gave her up to an orphanarium with a note scribbled with mysterious symbols to make an impression that Leela was an alien, so that she would have a better life than a typical mutant. But other kids used to make fun of her only eye, so Leela had a very perturbing childhood.

Bender and Philip J. Fry are making fun of Leela, because apparently she doesn’t know how to count (they say her parents didn’t know how to count either, and that’s why she has only one eye. Then they burst out in explosive laughter). She insists that she knows how to count, but secretly she needs your help.

Philip J. Fry chooses a positive integer a, and Bender chooses a positive integer b. Leela is supposed to count the number of positive integers m such that a and b leave the same remainder when divided by m. In other words, she’s supposed to find the size of the set {m ∈ ℤ _>0 | a ≡ b (mod m)}.

But she’s totally clueless on how to proceed. Help her, please!

Input

The input file contains several test cases (at most 150). Each test case is described with two different integers a and b on a single line (1 ≤ a, b ≤ 10⁹).

The last line contains two zeros and should not be processed.

Output

For each test case, output one integer on a single line  — the number of positive integers m such that a and b leave the same remainer when divided by m.

Sample input and output

Explanation of the sample cases

• 2 and 3 only leave the same remainder when divided by 1.
• 2 and 4 leave the same remainder when divided by 1 or 2.
• 5 and 7 leave the same remainder when divided by 1 or 2.
• 4 and 8 leave the same remainder when divided by 1, 2 or 4.
• 100 and 205 leave the same remainder when divided by 1, 3, 5, 7, 15, 21, 35 or 105.
• 33043387 and 255936619 leave the same remainder when divided by 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 569, 1138, 1707, 2276, 3414, 4552, 6828, 8161, 9104, 13656, 16322, 24483, 27312, 32644, 48966, 65288, 97932, 130576, 195864, 391728, 4643609, 9287218, 13930827, 18574436, 27861654, 37148872, 55723308, 74297744, 111446616 or 222893232.