#4505. 「一本通 6.3 练习 1」X-factor Chain

「一本通 6.3 练习 1」X-factor Chain

[{"sectionTitle":"题目描述","type":"Text","text":"原题来自 POJ 3421 \r\n\r\n输入正整数 xx,求 xx 的大于 11 的因子组成的满足任意前一项都能整除后一项的序列的最大长度,以及满足最大长度的序列的个数。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"多组数据,每组数据一行,包含一个正整数 xx。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"对于每组数据,输出序列的最大长度以及满足最大长度的序列的个数。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["2\n3\n4\n10\n100","1 1\n1 1\n2 1\n2 2\n4 6"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于全部数据,1lexle2201\\le x\\le 2^{20}。","subType":"markdown"}]