Pro.ID21403 TitleFactoring Large Numbers Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21403 AC10 Submit101 Ratio9.90% 时间&空间限制描述One of the central idea 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 will fit in gcc's long long int datatype. 输出Description One of the central idea 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. Input The input will be a sequence of integer values, one per line, terminated by a negative number. The numbers will fit in gcc's long long int datatype. Output 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. Sample Input 90 Sample Output 2 Source 样例输入90 样例输出 2 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-3 01:04 , Processed in 0.034870 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
