问题 1079 --Factoring Large Numbers

1079: Factoring Large Numbers

时间限制: 1 Sec  内存限制: 128 MB
提交: 1  解决: 1
[提交][状态][讨论版][命题人:]

题目描述

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

提示

来源

[提交][状态]