TopCoder

Adrien Wu

$ \begin{align} AC \times 2^9 \\ \text{New TIOJ ?} \end{align} $

User's AC Ratio

96.9% (31/32)

Submission's AC Ratio

55.8% (48/86)

Description

有寫過 A + B problem ?
是否總覺得 A + B 太過於單調?
沒關係, 現在 A! + B! problem 來了!!!
然而, 有鑒於 A! + B! 實在太大了,
和善的乃牛決定, 你只需要輸出 A! + B! 有幾種質因數便可!!

Input Format

測試檔中包含了許多行,
每行包含兩個數字 A, B.
測試檔以 EOF 為結尾.
(1 <= 行數 <= 20)
(1 <= A, B <= 1000000)
(max(A!, B!) / min(A!, B!) <= 1000000000000)

Output Format

對於每組 A, B 請輸出一行.
該行包含一個數字表示 A! + B! 有幾種質因數.

Sample Input

2 3
3 4
1 13

Sample Output

1
3
2

Hints

Problem Source

原TIOJ1615 / Problem Setter：worm

Subtasks

For Testdata: 0 ~ 0, Score: 20
For Testdata: 1 ~ 1, Score: 20
For Testdata: 2 ~ 2, Score: 20
For Testdata: 3 ~ 3, Score: 20
For Testdata: 4 ~ 4, Score: 20

No.	Time Limit (ms)	Memory Limit (KiB)
0	1000	65536
1	1000	65536
2	1000	65536
3	1000	65536
4	1000	65536

Submit

Status

Ranklist

1615 . A! + B! problem