当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1228:Factoring Large Numbers

题目描述

One of the central ideas behind much cryptography is that factoring large numbers is computationally
intensive. In this context one might use a 100 digit number that was a product of two 50 digit prime
numbers. Even with the fastest projected computers this factorization will take hundreds of years.
You don’t have those computers available, but if you are clever you can still factor fairly large numbers.

输入解释

The input will be a sequence of integer values, one per line, terminated by a negative number. The
numbers (other than the terminator) will be greater than 0 and less than 262 .

输出解释

Each positive number from the input must be factored and all factors (other than 1) printed out. The
factors must be printed in ascending order with 4 leading spaces preceding a left justified number, and
followed by a single blank line.

输入样例
90
1234567891
18991325453139
12745267386521023
-1
输出样例
    2
    3
    3
    5

    1234567891

    3
    3
    13
    179
    271
    1381
    2423

    30971
    411522630413

该题目包含在题集 ACM赛制

题目来源 19 June

共提交 9

通过率 44.44%
时间上限 内存上限
1000 MS 128 MB