提交统计

做了此题的人还做了哪些题

X-factor Chains

时间限制:1000 ms  |  内存限制:65535 KB
难度:3
描述

Given a positive integer X, an X-factor chain of length m is a sequence of integers,

1 = X0X1X2, …, Xm = X

satisfying

Xi < Xi+1 and Xi | Xi+1 where a | b means a perfectly divides into b.

Now we are interested in the maximum length of X-factor chains and the number of chains of such lengt

输入
The input consists of several test cases. Each contains a positive integer X (X ≤ 220).
输出
For each test case, output the maximum length and the number of such X-factors chains.
样例输入
2
3
4
10
100
样例输出
1 1
1 1
2 1
2 2
4 6
来源
POJ
上传者
iphxer